A New Upper Bound on Codes Decodable into Size-2 Lists (original) (raw)

Numbers, Information and Complexity, 2000

Abstract

A new asymptotic upper bound on the size of binary codes with the property described inthe title is derived. The proof relies on the properties of the distance distribution of binarycodes established in earlier related works of the authors. 1 IntroductionLet C 2 Zn2 be a binary block code. One says that C corrects r errors if every sphere ofradius r in Zn2 contains at most one codevector and r is the maximal number with suchproperty. Relaxing this definition, one may require that every such sphere contain at mostm vectors from the code. ...

Alexei Ashikhmin hasn't uploaded this paper.

Let Alexei know you want this paper to be uploaded.

Ask for this paper to be uploaded.