Toric codes over finite fields

DOI10.1007/S00200-004-0152-XzbMATH Open1092.94031arXivmath/0208155OpenAlexW2119509521MaRDI QIDQ1885355FDOQ1885355

Publication date: 28 October 2004

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Abstract: In this note, a class of error-correcting codes is associated to a toric variety associated to a fan defined over a finite field

f f f_{q}

, analogous to the class of Goppa codes associated to a curve. For such a ``toric code satisfying certain additional conditions, we present an efficient decoding algorithm for the dual of a Goppa code. Many examples are given. For small $q$ , many of these codes have parameters beating the Gilbert-Varshamov bound. In fact, using toric codes, we construct a $(n, k, d) = (49, 11, 28)$ code over $f f f_{8}$ , which is better than any other known code listed in Brouwer's on-line tables for that $n$ and $k$ .

Full work available at URL: https://arxiv.org/abs/math/0208155

Recommendations

zbMATH Keywords

Gilbert-Varshamov bound Reed-Muller codes AG codes Toric varieties

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Bounds on codes (94B65) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Cited In (39)

Uses Software

This page was built for publication: Toric codes over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885355)