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

DOI10.1109/18.179365zbMATH Open0766.94022OpenAlexW2165005000MaRDI QIDQ4034459FDOQ4034459

Authors: 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

Recommendations

• The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
• Concatenated Codes: Serial and Parallel
• Algebraic Codes Achieving the Capacity of the Binary Symmetric Channel
• Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
• Better Binary List-Decodable Codes Via Multilevel Concatenation

zbMATH Keywords

binary codesalgebraic-geometric 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)

Cited In (5)

• Non-malleable encryption: simpler, shorter, stronger
• The existence of binary linear concatenated codes with Reed - Solomon outer codes which asymptotically meet the Gilbert- Varshamov bound
• Non-malleable encryption: simpler, shorter, stronger
• Optimal Rate List Decoding over Bounded Alphabets Using Algebraic-geometric Codes
• On quasilinear-time complexity theory

This page was built for publication: A Justesen construction of binary concatenated codes that asymptotically meet the Zyablov bound for low rate

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