Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound

DOI10.1109/TIT.2003.813559zbMath1154.94487OpenAlexW2061394882MaRDI QIDQ3547802

Xing, Chaoping

Publication date: 21 December 2008

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

Full work available at URL: https://doi.org/10.1109/tit.2003.813559

Mathematics Subject Classification ID

Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items (8)

Further improvements on asymptotic bounds for codes using distinguished divisors ⋮ Nonlinear codes with asymptotic parameters better than the Gilbert-Varshamov and the Xing bounds ⋮ On the locality of codeword symbols in non-linear codes ⋮ Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes ⋮ Deterministic Construction of Compressed Sensing Matrices from Codes ⋮ Deterministic constructions of compressed sensing matrices based on codes ⋮ On improved asymptotic bounds for codes from global function fields ⋮ High-rate codes with sublinear-time decoding

This page was built for publication: Nonlinear codes from algebraic curves improving the Tsfasman-Vladut-Zink bound