List decodability at small radii
Chee, Yeow Meng
Date of Issue2010
School of Physical and Mathematical Sciences
A′(n, d, e), the smallest ℓ for which every binary error-correcting code of length n and minimum distance d is decodable with a list of size ℓ up to radius e, is determined for all d ≥ 2e − 3. As a result, A′(n, d, e) is determined for all e ≤ 4, except for 42 values of n.
Designs, codes and cryptography
© 2010 Springer Science+Business Media This is the author created version of a work that has been peer reviewed and accepted for publication by Designs, Codes and Cryptography, Springer. It incorporates referee’s comments but changes resulting from the publishing process, such as copyediting, structural formatting, may not be reflected in this document. The published version is available at: http://dx.doi.org/10.1007/s10623-010-9445-1 .