Cover-free families and superimposed codes: constructions, bounds and applications to cryptography and group testing

Authors :: Arkadii G. D'yachkov
Sergey Yekhanin
Pavel A. Vilenkin
V.S. Lebedev
Source :: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).
Publication Year :: 2002
Publisher :: IEEE, 2002.
Abstract: This paper deals with (s,l)-cover-free families or superimposed (s,l)-codes. They generalize the concept of superimposed s-codes and have several applications for cryptography and group testing. We present a new asymptotic bound on the rate of optimal codes and develop some constructions.

Subjects :: Combinatorics
Discrete mathematics
Block code
Group code
business.industry
Reed–Solomon error correction
Concatenated error correction code
Turbo code
Tornado code
Cryptography
business
Linear code
Mathematics

Database :: OpenAIRE
Journal :: Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252)
Accession number :: edsair.doi...........f7139089de48f41edb54922cd46c5b0f
Full Text :: https://doi.org/10.1109/isit.2001.935980

Full Text Access

Tools