Name
Abstract | ||
|---|---|---|
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 $$\\mathbf {A}(2,q)$$ A ( 2 , q ) as the Tanner graph, and we are able to describe the codes succinctly using Gröbner bases. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/s10623-014-9962-4 | Des. Codes Cryptography |
Keywords | Field | DocType |
Tanner codes,Graph codes,Graph based codes,Expander codes,Affine variety codes,Gröbner bases,11T71,94B15,94B25,94B27 | Discrete mathematics,Combinatorics,Group code,Luby transform code,Block code,Expander code,Raptor code,Linear code,Reed–Muller code,Tanner graph,Mathematics | Journal |
Volume | Issue | ISSN |
76 | 1 | 0925-1022 |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tom Høholdt | 1 | 186 | 28.53 |
| Fernando Piñero | 2 | 1 | 1.73 |
| Peng Zeng | 3 | 6 | 1.47 |