Abstract
Next we consider the estimation for the cardinality of L-packing. Fix \( L \in Z_ + ^1 \triangleq \{ 1,2,...\} . \) Let A ∈ Fn be a binary code. Denote by t A (L) the maximal radius of the Hamming ball such that an arbitrary ball of radius t A (L) contains not more that L vectors from A. t A (L) is called the radius of the list-of-L decoding ball. Let K(n, L, t) be the maximal cardinality of the code A with parameters n, t A (L) = t.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Blinovsky, V. (1997). List Decoding. In: Asymptotic Combinatorial Coding Theory. The Springer International Series in Engineering and Computer Science, vol 415. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-6193-4_2
Download citation
DOI: https://doi.org/10.1007/978-1-4615-6193-4_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7839-6
Online ISBN: 978-1-4615-6193-4
eBook Packages: Springer Book Archive