RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive
Probl. Peredachi Inf., 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.

UDC: 621.391.15:004.7

Received: 29.10.2007
Revised: 29.01.2008


 English version: Problems of Information Transmission, 2008, 44:1, 112–118

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024