An upper bound for the number of uniformly packed binary codes Научная публикация
| Журнал |
Journal of Applied and Industrial Mathematics
ISSN: 1990-4789 , E-ISSN: 1990-4797 |
||
|---|---|---|---|
| Вых. Данные | Год: 2008, Том: 2, Номер: 3, Страницы: 426-431 Страниц : 6 DOI: 10.1134/S1990478908030137 | ||
| Авторы |
|
||
| Организации |
|
Реферат:
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).
Библиографическая ссылка:
Токарева Н.Н.
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
Идентификаторы БД:
| Scopus: | 2-s2.0-52749085976 |
| OpenAlex: | W1992988210 |
Цитирование в БД:
Пока нет цитирований