DIMACS TR: 99-05

A New Upper Bound on Codes Decodable into Size-2 Lists

Authors: A. Ashikhmin, A. Barg, and S. Litsyn


A new asymptotic upper bound on the size of binary codes with the property described in the title is derived. The proof relies on the properties of the distance distribution of binary codes established in earlier related works of the authors.

Paper Available at: ftp://dimacs.rutgers.edu/pub/dimacs/TechnicalReports/TechReports/1999/99-05.ps.gz
DIMACS Home Page