Information Theory and Coding Theory

On Packing Density for Unit Spheres in Hamming Space

G. L. Katsman


Abstract: The author constructs two nonlinear codes of length 66 and 143 that have minimum distance 3 and cardinality $24\cdot2^{55}$ and $144^2\cdot2^{121}$, respectively. These codes are used to improve the lower limit for the lower bound of the packing density of spheres of radius 1 in Hamming space.

UDC: 621.391.15:513.3

Received: 20.08.1980

 English version: Problems of Information Transmission, 1981, 17:2, 114–117

Bibliographic databases:

• 
•