Robert Leppert, Mehwish Saleemi, Karl-Heinz Zimmermann
Institute of Computer Technology (E-13)
Hamburg University of Technology
Schwarzenbergstr. 95E, Hamburg, 21073, GERMANY

Abstract. 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.

Received: April 13, 2011

AMS Subject Classification: 13P10, 94B05

Key Words and Phrases: linear code, binomial ideal, polynomial ring, toric ideal, nonprime ideal, Groebner basis, quaternary codes

Download paper from here.