|
Problemy Peredachi Informatsii, 2008, Volume 44, Issue 1, Pages 38–44
(Mi ppi1264)
|
|
|
|
This article is cited in 13 scientific papers (total in 13 papers)
Coding Theory
On the Convexity of One Coding-Theory Function
V. M. Blinovsky A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
The paper completes the proof of an upper bound for multiple packings in a $q$-ary Hamming space
Received: 20.11.2007
Citation:
V. M. Blinovsky, “On the Convexity of One Coding-Theory Function”, Probl. Peredachi Inf., 44:1 (2008), 38–44; Problems Inform. Transmission, 44:1 (2008), 34–39
Linking options:
https://www.mathnet.ru/eng/ppi1264 https://www.mathnet.ru/eng/ppi/v44/i1/p38
|
Statistics & downloads: |
Abstract page: | 383 | Full-text PDF : | 99 | References: | 60 | First page: | 2 |
|