Asymptotic bounds for the rate of colored superimposed codes

Authors:
V. S. Lebedev
Affiliations:
Kharkevich Institute for Information Transmission Problems, RAS, Moscow, Russia
Venue:
Problems of Information Transmission
Year:
2008

Citing 3
Cited 0

Key storage in secure networks

Discrete Applied Mathematics
Some new bounds for cover-free families

Journal of Combinatorial Theory Series A
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free Codes

Problems of Information Transmission

Quantified Score

Hi-index	0.00

Visualization

Abstract

We introduce the notion of a q-ary (r 0, r 1, ..., r q驴1) superimposed code. We obtain upper and lower asymptotic bounds for the rate of these (colored) codes.