On affine variety codes from the Klein quartic

Abstract

We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in Kolluru et al., (Appl. Algebra Engrg. Comm. Comput. 10(6):433–464, 2000, Ex. 3.2). Among the codes that we construct almost all have parameters as good as the best known codes according to Grassl (2007) and in the remaining few cases the parameters are almost as good. To establish the code parameters we apply the footprint bound (Geil and Hoholdt, IEEE Trans. Inform. Theory 46(2), 635–641, 2000 and Hoholdt 1998) from Grobner basis theory and for this purpose we develop a new method where we inspired by Buchberger’s algorithm perform a series of symbolic computations.