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. Keywords Bounded-weight codes

• Type: Journal
• Year: 2010
• Where: CORR
• Authors: Yeow Meng Chee, Gennian Ge, Lijun Ji, San Ling, Jianxing Yin
• Keywords: Binary Error-correcting Code, CORR 2010, Education