1 Department of Applied Mathematics and Computer Science, Technical University of Denmark2 Mathematics, Department of Applied Mathematics and Computer Science, Technical University of Denmark3 Discrete mathematics, Department of Mathematics, Technical University of Denmark
In this article we study a class of graph codes with cyclic code component codes as affine variety codes. Within this class of Tanner codes we find some optimal binary codes. We use a particular subgraph of the point-line incidence plane of A(2,q) as the Tanner graph, and we are able to describe the codes succinctly using Gröbner bases.
Designs, Codes and Cryptography, 2014, Vol 76, Issue 1, p. 37-47