On upper bounds for the distance of codes of small size
Ilia Krasikov, Simon N. Litsyn · 2002
Combining a linear programming approach with the Plotkin-Johnson argument for constant weight codes, we derive upper bounds on the size of codes of length n and minimum distance d=(n-j)/2, 0<j<n/sup 1/3/. For j=o(n/sup 1/3/) these bounds practically coincide with the Tietavainen bound (1980) and are slightly better. For fixed j and j proportional to n/sup 1/3/, j