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.
Saved in:
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/94478 http://hdl.handle.net/10220/7490 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |
| id |
sg-ntu-dr.10356-94478 |
|---|---|
| record_format |
dspace |
| spelling |
sg-ntu-dr.10356-944782023-02-28T19:39:17Z List decodability at small radii Chee, Yeow Meng Ge, Gennian Ji, Lijun Ling, San Yin, Jianxing School of Physical and Mathematical Sciences DRNTU::Science::Mathematics 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. Accepted version 2012-02-02T04:58:28Z 2019-12-06T18:56:47Z 2012-02-02T04:58:28Z 2019-12-06T18:56:47Z 2010 2010 Journal Article Chee, Y. M., Ge, G., Ji, L., Ling, S. & Yin, J. (2010). List decodability at small radii. Designs, Codes and Cryptography, 61(2), 151-166. 0925-1022 https://hdl.handle.net/10356/94478 http://hdl.handle.net/10220/7490 10.1007/s10623-010-9445-1 en 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 . 14 p. application/pdf |
| institution |
Nanyang Technological University |
| building |
NTU Library |
| continent |
Asia |
| country |
Singapore Singapore |
| content_provider |
NTU Library |
| collection |
DR-NTU |
| language |
English |
| topic |
DRNTU::Science::Mathematics |
| spellingShingle |
DRNTU::Science::Mathematics Chee, Yeow Meng Ge, Gennian Ji, Lijun Ling, San Yin, Jianxing List decodability at small radii |
| description |
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. |
| author2 |
School of Physical and Mathematical Sciences |
| author_facet |
School of Physical and Mathematical Sciences Chee, Yeow Meng Ge, Gennian Ji, Lijun Ling, San Yin, Jianxing |
| format |
Article |
| author |
Chee, Yeow Meng Ge, Gennian Ji, Lijun Ling, San Yin, Jianxing |
| author_sort |
Chee, Yeow Meng |
| title |
List decodability at small radii |
| title_short |
List decodability at small radii |
| title_full |
List decodability at small radii |
| title_fullStr |
List decodability at small radii |
| title_full_unstemmed |
List decodability at small radii |
| title_sort |
list decodability at small radii |
| publishDate |
2012 |
| url |
https://hdl.handle.net/10356/94478 http://hdl.handle.net/10220/7490 |
| _version_ |
1759855533819428864 |