An upper bound for the number of uniformly packed binary codes Full article
| Journal |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||
|---|---|---|---|
| Output data | Year: 2008, Volume: 2, Number: 3, Pages: 426-431 Pages count : 6 DOI: 10.1134/S1990478908030137 | ||
| Authors |
|
||
| Affiliations |
|
Abstract:
Under study are the binary codes uniformly packed (in the wide sense) of length n with minimum distance d and covering radius ρ. It is shown that every code of this kind is uniquely determined by the set of its codewords of weights [n/2]-ρ..., [n/2] + ρ. For odd d, the number of distinct codes is at most 22n-d/2log2n+o(log2n).
Cite:
Токарева Н.Н.
An upper bound for the number of uniformly packed binary codes
Journal of Applied and Industrial Mathematics. 2008. Т.2. №3. С.426-431. DOI: 10.1134/S1990478908030137 Scopus OpenAlex
An upper bound for the number of uniformly packed binary codes
Journal of Applied and Industrial Mathematics. 2008. Т.2. №3. С.426-431. DOI: 10.1134/S1990478908030137 Scopus OpenAlex
Identifiers:
| Scopus: | 2-s2.0-52749085976 |
| OpenAlex: | W1992988210 |
Citing:
Пока нет цитирований