Various constructions of good codes

Publication date 23 September 2003

algebraic-geometry codes binary nonlinear codes class field towers distribution of symbols Galois rings survey

Arithmetic theory of algebraic function fields (11R58) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Review text

This is a survey article on applications of number theory and algebraic geometry to coding theory. First, the results from the 1980s on good algebraic-geometry codes are reviewed. Then the method of class field towers for the construction of asymptotically good towers of global function fields is described, which leads in particular to the result of \textit{H. Niederreiter} and \textit{C. P. Xing} [Math. Nachr. 195, 171-186 (1998; Zbl 0920.11039)] on sequences of algebraic-geometry codes beating the Gilbert-Varshamov bound. Further topics include codes over Galois rings, e.g. the well-known construction of good binary nonlinear codes from linear codes over \({\mathbb Z}_4\), and character sum techniques for measuring the distribution of symbols in nonzero codewords of certain codes.NEWLINENEWLINEFor the entire collection see [Zbl 0953.00031].

Recommendations

Cited in

(9)

This page was built for publication: Various constructions of good codes

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