|
Problemy Peredachi Informatsii, 1981, Volume 17, Issue 2, Pages 52–56
(Mi ppi1392)
|
|
|
|
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.
Received: 20.08.1980
Citation:
G. L. Katsman, “On Packing Density for Unit Spheres in Hamming Space”, Probl. Peredachi Inf., 17:2 (1981), 52–56; Problems Inform. Transmission, 17:2 (1981), 114–117
Linking options:
https://www.mathnet.ru/eng/ppi1392 https://www.mathnet.ru/eng/ppi/v17/i2/p52
|
Statistics & downloads: |
Abstract page: | 279 | Full-text PDF : | 98 |
|