Details:

Title	Groebner bases for linear codes over $GF(4)$.
Author(s)	Mehwish Saleemi, Karl-Heinz Zimmermann
Type	Article in Journal
Abstract	A 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.
Keywords	Groebner basis, linear code, binomial ideal, polynomial ring, toric ideal, nonprime ideal
ISSN	1311-8080; 1314-3395/e
File
URL	http://www.ijpam.eu/contents/2011-73-4/3/index.html
Language	English
Journal	Int. J. Pure Appl. Math.
Volume	73
Number	4
Pages	435--442
Publisher	Academic Publications, Sofia
Year	2011
Edition	0
Translation	No
Refereed	No