Saleemi, MehwishMehwishSaleemiZimmermann, Karl-HeinzKarl-HeinzZimmermann2022-04-072022-04-072011-12-01International Journal of Pure and Applied Mathematics 73 (4): 435-442 (2011)http://hdl.handle.net/11420/12257A linear code over a prime field can be described by a binomial ideal in a polynomial ring given as the sum of a toric ideal and a nonprime ideal. A Groebner basis for such an ideal can be read off from a systematic generator matrix of the corresponding code. In this paper, a similar result will be presented for linear codes over GF(4). To this end, the extented alphabet GF(4) is dealt with by enlarging the polynomial ring. © 2011 Academic Publications, Ltd.en1314-339520114435442Academic PublicationsBinomial idealGroebner basisLinear codeNonprime idealPolynomial ringToric idealMathematikJournal ArticleJournal Article