List decodability at small radii
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.
| Prif Awduron: | , , , , |
|---|---|
| Awduron Eraill: | |
| Fformat: | Journal Article |
| Iaith: | English |
| Cyhoeddwyd: |
2012
|
| Pynciau: | |
| Mynediad Ar-lein: | https://hdl.handle.net/10356/94478 http://hdl.handle.net/10220/7490 |
| Crynodeb: | 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. |
|---|