List decodability at small radii

DOI10.1007/S10623-010-9445-1MaRDI QIDQ717148zbMATH OpenOpenAlexFDO

Authors Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin

Publication date 27 September 2011

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1010.3312, http://hdl.handle.net/10220/7490

zbMATH Keywords

error-correcting codeslist decodingconstant-weight codesbounded-weight codes

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorial aspects of packing and covering (05B40)

Abstract: $A^{\prime }(n,d,e)$, the smallest $ell$ for which every binary error-correcting code of length $n$ and minimum distance $d$ is decodable with a list of size $ell$ up to radius $e$, is determined for all $dgeq2e-3$. As a result, $A^{\prime }(n,d,e)$ is determined for all $eleq4$, except for 42 values of $n$.

Recommendations

• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
• Combinatorial bounds for list decoding
• Combinatorial Limitations of Average-Radius List Decoding
• scientific article; zbMATH DE number 3970683
• Bounds on the List-Decoding Radius of Reed--Solomon Codes

Cites work

• scientific article; zbMATH DE number 3689406 (Why is no real title available?)
• scientific article; zbMATH DE number 3235247 (Why is no real title available?)
• scientific article; zbMATH DE number 3410920 (Why is no real title available?)
• A new table of constant weight codes
• Asymptotic determination of the last packing number of quadruples
• Bounds for codes in the case of list decoding of finite volume
• Channel capacities for list codes
• Decoding of Reed Solomon codes beyond the error-correction bound
• Error-correcting codes for list decoding
• Exponential error bounds for erasure, list, and decision feedback schemes
• List cascade decoding
• List decoding of error-correcting codes. Winning thesis of the 2002 ACM Doctoral Dissertation Competition
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Maximal consistent families of triples
• On Quadruple Systems
• Optimal packings of \(K_4\)'s into a \(K_n\)
• Upper bounds for constant weight error correcting codes

Cited in

(2)

• The List Decoding Radius of Reed-Muller Codes over Small Fields
• Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: List decodability at small radii

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