Optimal codes as Tanner codes with cyclic component codes

Tom Høholdt, Fernando Pinero, Peng Zeng

Research output: Contribution to journalJournal articleResearchpeer-review


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.
Original languageEnglish
JournalDesigns, Codes and Cryptography
Issue number1
Pages (from-to)37-47
Publication statusPublished - 2014


  • Tanner codes
  • Graph codes
  • Graph based codes
  • Expander codes
  • Affine variety codes
  • Gröbner bases

Cite this