|
Problemy Peredachi Informatsii, 2005, Volume 41, Issue 1, Pages 28–38
(Mi ppi86)
|
|
|
|
This article is cited in 30 scientific papers (total in 30 papers)
Coding Theory
Code Bounds for Multiple Packings over a Nonbinaxy Finite Alphabet
V. M. Blinovskiiab a Institute for Information Transmission Problems, Russian Academy of Sciences
b Bielefeld University
Abstract:
The problem of constructing asymptotic bounds for multiple packings in the space
of $q$-ary sequences of length $n$ is considered. For the zero rate, tightness of the expurgation
bound is proved.
Received: 05.06.2001 Revised: 16.09.2004
Citation:
V. M. Blinovskii, “Code Bounds for Multiple Packings over a Nonbinaxy Finite Alphabet”, Probl. Peredachi Inf., 41:1 (2005), 28–38; Problems Inform. Transmission, 41:1 (2005), 23–32
Linking options:
https://www.mathnet.ru/eng/ppi86 https://www.mathnet.ru/eng/ppi/v41/i1/p28
|
Statistics & downloads: |
Abstract page: | 371 | Full-text PDF : | 102 | References: | 69 |
|