|
Problemy Peredachi Informatsii, 2008, Volume 44, Issue 2, Pages 46–53
(Mi ppi1270)
|
|
|
|
Coding Theory
Asymptotic Bounds for the Rate of Colored Superimposed Codes
V. S. Lebedev A. A. Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences
Abstract:
We introduce the notion of a $q$-ary $(r_0,r_1,\dots,r_{q-1})$ superimposed code. We obtain upper and lower asymptotic bounds for the rate of these (colored) codes.
Received: 29.10.2007 Revised: 29.01.2008
Citation:
V. S. Lebedev, “Asymptotic Bounds for the Rate of Colored Superimposed Codes”, Probl. Peredachi Inf., 44:2 (2008), 46–53; Problems Inform. Transmission, 44:1 (2008), 112–118
Linking options:
https://www.mathnet.ru/eng/ppi1270 https://www.mathnet.ru/eng/ppi/v44/i2/p46
|
|