List decodability at small radii

Authors:
Yeow Meng Chee;Gennian Ge;Lijun Ji;San Ling;Jianxing Yin
Affiliations:
Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, Singapore, Singapore 637371;Department of Mathematics, Zhejiang University, Hangzhou, China 310027;Department of Mathematics, Suzhou University, Suzhou, China 215006;Division of Mathematical Sciences, School of Physical & Mathematical Sciences, Nanyang Technological University, Singapore, Singapore 637371;Department of Mathematics, Suzhou University, Suzhou, China 215006
Venue:
Designs, Codes and Cryptography
Year:
2011

Citing 5
Cited 0

A hard-core predicate for all one-way functions

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Decoding of Reed Solomon codes beyond the error-correction bound

Journal of Complexity
Asymptotic Combinatorial Coding Theory

Asymptotic Combinatorial Coding Theory
List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)

List Decoding of Error-Correcting Codes: Winning Thesis of the 2002 ACM Doctoral Dissertation Competition (Lecture Notes in Computer Science)
Asymptotic Determination of the Last Packing Number of Quadruples

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.