A class of linear codes with good parameters from algebraic curves

DOI10.1109/18.850687zbMath1003.94038OpenAlexW2147409243MaRDI QIDQ4503620

Xing, Chaoping, San Ling

Publication date: 7 September 2000

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10220/8820

zbMATH Keywords

linear codesalgebraic curvesGoppa codesalgebraic-geometry codessubfield subcodes

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (7)

Minimum weight codewords in dual algebraic-geometric codes from the Giulietti-Korchmáros curve ⋮ Rational points on cubic surfaces and AG codes from the norm-trace curve ⋮ Multi point AG codes on the GK maximal curve ⋮ Three classes of binary linear codes with good parameters ⋮ Intersections between the norm-trace curve and some low degree curves ⋮ An explicit class of codes with good parameters and their duals ⋮ \(\mathbb{F}_{p^2}\)-maximal curves with many automorphisms are Galois-covered by the Hermitian curve

This page was built for publication: A class of linear codes with good parameters from algebraic curves