In this article we study a class of graph codes with cyclic code component codes as affine variety...
1
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.
In this article we study a class of graph codes with cyclic code component codes as affine variety codes.docx
In this article we study a class of graph codes with cyclic code component codes as affine variety codes.docx
Citation preview
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 ofA(2,q)as the Tanner
graph, and we are able to describe the codes succinctly using
Grbner bases.
