A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate

DOI10.1109/18.179365zbMath0766.94022OpenAlexW2165005000MaRDI QIDQ4034459

Ba-Zhong Shen

Publication date: 16 May 1993

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

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

zbMATH Keywords

algebraic-geometric codesbinary codesconcatenated codesouter codesZyablov boundgeneralized Hermitian curvesJustesen's construction of concatenation

Mathematics Subject Classification ID

Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Other types of codes (94B60)

Related Items

Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes, Non-malleable encryption: simpler, shorter, stronger, On quasilinear-time complexity theory, Non-Malleable Encryption: Simpler, Shorter, Stronger