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:
Bibliographic Details
Main Authors: Chee, Yeow Meng, Ge, Gennian, Ji, Lijun, Ling, San, Yin, Jianxing
Other Authors: School of Physical and Mathematical Sciences
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