id: 06019443
dt: j
an: 06019443
au: Leppert, Robert; Saleemi, Mehwisch; Zimmermann, Karl-Heinz
ti: Groebner bases for quaternary codes.
so: Int. J. Pure Appl. Math. 71, No. 4, 595-608 (2011).
py: 2011
pu: Academic Publications, Sofia
la: EN
cc: 
ut: linear code; binomial ideal; polynomial ring; toric ideal; nonprime ideal;
    Groebner basis; quaternary codes
ci: 
li: http://www.ijpam.eu/contents/2011-71-4/7/index.html
ab: Summary: A 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.
rv: