Leppert, RobertRobertLeppertSaleemi, MehwishMehwishSaleemiZimmermann, Karl-HeinzKarl-HeinzZimmermann2022-07-202022-07-202011International Journal of Pure and Applied Mathematics 71 (4): 595-608 (2011)http://hdl.handle.net/11420/13236A linear code 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 for the corresponding code. In this paper, an analogue result will be presented for quaternary codes. © 2011 Academic Publications, Ltd.en1314-3395International journal of pure and applied mathematics20114595608Academic PublicationsBinomial idealGroebner basisLinear codeNonprime idealPolynomial ringQuaternary codesToric idealMathematikGroebner bases for quaternary codesJournal ArticleJournal Article