Groebner bases for linear codes over GF(4)
Publikationstyp
Journal Article
Date Issued
2011-12-01
Sprache
English
Institut
Volume
73
Issue
4
Start Page
435
End Page
442
Citation
International Journal of Pure and Applied Mathematics 73 (4): 435-442 (2011)
Scopus ID
Publisher
Academic Publications
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. © 2011 Academic Publications, Ltd.
Subjects
Binomial ideal
Groebner basis
Linear code
Nonprime ideal
Polynomial ring
Toric ideal
DDC Class
510: Mathematik