The ubiquity of order domains for the construction of error control codes

DOI10.3934/AMC.2007.1.151zbMATH Open1198.94190arXivmath/0304292OpenAlexW2085460751MaRDI QIDQ874425FDOQ874425

John B. Little

Publication date: 5 April 2007

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: The order domains are a class of commutative rings introduced by H{o}holdt, van Lint, and Pellikaan to simplify the theory of error control codes using ideas from algebraic geometry. The definition is largely motivated by the structures utilized in the Berlekamp-Massey-Sakata (BMS) decoding algorithm, with Feng-Rao majority voting for unknown syndromes, applied to one-point geometric Goppa codes constructed from curves. However, order domains are much more general, and O'Sullivan has shown that the BMS algorithm can be applied to decode all codes constructed from order domains by a suitable generalization of Goppa's procedure for curves. In this article we will first discuss the connection between order domains and valuations on function fields over a finite field. Under some mild conditions, we will see that a general projective variety over a finite field has projective models which can be used to construct order domains and Goppa-type codes for which the BMS algorithm is applicable. We will then give a slightly different interpretation of Geil and Pellikaan's extrinsic characterization of order domains via the theory of Gr"obner bases, and show that their results are related to the existence of toric deformations of varieties. To illustrate the potential usefulness of these observations, we present a series of new explicit examples of order domains associated to varieties with many rational points over finite fields: Hermitian hypersurfaces, Grassmannians, and flag varieties.

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

Recommendations

• Algebraic geometry codes from order domains
• The key equation for codes from order domains
• On the structure of order domains
• Evaluation codes from order domain theory
• Evaluation codes and plane valuations

zbMATH Keywords

function fieldvaluationorder domainerror control code

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Applications to coding theory and cryptography of arithmetic geometry (14G50) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Valuations and their generalizations for commutative rings (13A18)

Cited In (8)

• Improved evaluation codes defined by plane valuations
• Codes defined by forms of degree 2 on non-degenerate Hermitian varieties in \(\mathbb{P}^4(\mathbb{F}_q)\)
• On the structure of order domains
• Near weights on higher dimensional varieties
• The key equation for codes from order domains
• Algebraic geometry codes from order domains
• Evaluation codes defined by finite families of plane valuations at infinity
• Feng-Rao decoding of primary codes

Uses Software

• SINGULAR

This page was built for publication: The ubiquity of order domains for the construction of error control codes

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