On two-fold packings of radius-1 balls in Hamming graphs Научная публикация
| Журнал |
IEEE International Symposium on Information Theory - Proceedings
ISSN: 2157-8095 |
||
|---|---|---|---|
| Вых. Данные | Год: 2019, Том: 2019, Страницы: 2773-2777 Страниц : 5 DOI: 10.1109/ISIT.2019.8849832 | ||
| Ключевые слова | completely regular codes, Hamming graph, l-list decodable codes, linear programming bound, multifold ball packings, two-fold ball packings | ||
| Авторы |
|
||
| Организации |
|
Реферат:
A λ-fold r-packing in a Hamming metric space is a code C such that the radius-r balls centered in C cover each vertex of the space by not more than λ-times. The well-known r- error-correcting codes correspond to the case λ = 1. We propose asymptotic bounds for q-ary 2-fold 1-packings as q grows, find that the maximum size of a binary 2-fold 1-packing of length 9 is 96, and derive upper bounds for the size of a binary λ-fold 1 -packing.
Библиографическая ссылка:
Krotov D.S.
, Potapov V.N.
On two-fold packings of radius-1 balls in Hamming graphs
IEEE International Symposium on Information Theory - Proceedings. 2019. V.2019. P.2773-2777. DOI: 10.1109/ISIT.2019.8849832 WOS Scopus РИНЦ OpenAlex
On two-fold packings of radius-1 balls in Hamming graphs
IEEE International Symposium on Information Theory - Proceedings. 2019. V.2019. P.2773-2777. DOI: 10.1109/ISIT.2019.8849832 WOS Scopus РИНЦ OpenAlex
Даты:
| Опубликована online: | 26 сент. 2019 г. |
Идентификаторы БД:
| Web of science: | WOS:000489100302174 |
| Scopus: | 2-s2.0-85073150638 |
| РИНЦ: | 41689008 |
| OpenAlex: | W2977064539 |