Access the full text.
Sign up today, get DeepDyve free for 14 days.
A. D'yachkov, V. Rykov, C. Deppe, V. Lebedev (2014)
Superimposed Codes and Threshold Group TestingArXiv, abs/1401.7485
H. Kim, V. Lebedev (2004)
On optimal superimposed codesJournal of Combinatorial Designs, 12
A. D'yachkov, A. Macula, D. Torney, P. Vilenkin (2014)
Two Models of Nonadaptive Group Testing for Designing Screening ExperimentsArXiv, abs/1401.7508
Yongxi Cheng, D. Du (2008)
New Constructions of One- and Two-Stage Pooling DesignsJournal of computational biology : a journal of computational molecular cell biology, 15 2
(1980)
Random Constant - Composition Codes for Multiple Access Channels
AG D’yachkov (2003)
Com 2 MaC Lect. Note Ser., vol. 10
W. Kautz, R. Singleton (1964)
Nonrandom binary superimposed codesIEEE Trans. Inf. Theory, 10
A. D'yachkov, P. Vilenkin, D. Torney, A. Macula (2002)
Families of Finite Sets in which No Intersection of Sets Is Covered by the Union of s OthersJ. Comb. Theory, Ser. A, 99
AG D’yachkov, VV Rykov (1982)
Bounds on the Length of Disjunctive CodesProbl. Peredachi Inf., 18
A. D'yachkov, V. Rykov (1983)
A survey of superimposed code theory, 12
A D’yachkov, A Macula, VV Rykov (2000)
Numbers, Information, and Complexity
A. D'yachkov, A. Macula, V. Rykov (2000)
New constructions of superimposed codesIEEE Trans. Inf. Theory, 46
V. Sidelnikov, O. Prikhodov (2009)
On the construction of (w, r) cover-free codesProblems of Information Transmission, 45
M. Dyer, T. Fenner, A. Frieze, A. Thomason (1995)
On key storage in secure networksJournal of Cryptology, 8
(1982)
Bounds on the Length of Disjunctive Codes, Probl
CJ Mitchell, FC Piper (1988)
Key Storage in Secure NetworksDiscrete Appl. Math., 21
I. Csiszár, J. Körner (2011)
Information Theory - Coding Theorems for Discrete Memoryless Systems, Second Edition
A. D'yachkov, P. Vilenkin, S. Yekhanin (2006)
Upper Bounds on the Rate of Superimposed ( s ; ` )-Codes Based on Engel ' s Inequality 1
A. D'yachkov, A. Macula, D. Torney, P. Vilenkin, S. Yekhanin (2000)
New Results in the Theory of Superimposed Codes: Part I
VS Lebedev (2003)
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free CodesProbl. Peredachi Inf., 39
D. Coppersmith, J. Shearer (1998)
New Bounds for Union-free Families of SetsElectron. J. Comb., 5
VM Sidelnikov, OYu Prikhodov (2009)
On the Construction of (w, r) Cover-Free CodesProbl. Peredachi Inf., 45
Douglas Stinson, R. Wei, Lie Zhu (2000)
Some New Bounds for Cover-Free FamiliesJ. Comb. Theory, Ser. A, 90
Hong-Bin Chen, H. Fu (2009)
Nonadaptive algorithms for threshold group testingDiscret. Appl. Math., 157
V. Lebedev (2003)
Asymptotic Upper Bound for the Rate of (w, r) Cover-Free CodesProblems of Information Transmission, 39
K. Engel (1996)
Interval Packing and Covering in the Boolean LatticeCombinatorics, Probability and Computing, 5
G. Barnard, R. Fano (1961)
Transmission of Information: A Statistical Theory of Communications., 125
(2000)
New Applications and Results of Superimposed Code Theory Arising from Potentialities of Molecular Biology, Numbers, Information
I Csiszár, J Körner (1981)
Information Theory: Coding Theorems for Discrete Memoryless Systems
(1990)
Random Coding Bounds on the Rate for List-Decoding Superimposed Codes, Probl
EM Galeev, VM Tikhomirov (2000)
Optimizatsiya: teoriya, primery, zadachi
(1989)
Disjunctive Codes with List Decoding
(2000)
Optimizatsiya: teoriya, primery, zadachi (Optimization: Theory, Examples, Problems)
A. D'yachkov, A. Rashad (1989)
Universal decoding for random design of screening experimentsMicroelectronics Reliability, 29
(1981)
On One Application of Codes for a Multiple Access Channel in the ALOHA System
(2003)
Lectures on Designing Screening Experiments, Com2MaC Lect
A Nguyen Quang, T Zeisel (1988)
Bounds on Constant Weight Binary Superimposed CodesProbl. Control Inform. Theory, 17
AG D’yachkov, VV Rykov, MA Antonov (1989)
Proc. 10th Sympos. on Reliability Problem in Information Systems
A. D'yachkov, V. Rykov, A. Rashad (1989)
Superimposed distance codes, 18
(1980)
Bounds on the Average Error Probability for a Code Ensemble with Fixed Composition, Probl
AG D’yachkov, PA Vilenkin, AJ Macula, DC Torney (2001)
Advances in Model Oriented Design and Analysis (Proc. 6th Int. Workshop on Model Oriented Design and Analysis, Puchberg/Schneeberg, Austria, 2001)
AG D’yachkov, VV Rykov, C Deppe, VS Lebedev (2013)
Information Theory, Combinatorics, and Search Theory. In Memory of Rudolf Ahlswede
A binary code is said to be a disjunctive (s, ℓ) cover-free code if it is an incidence matrix of a family of sets where the intersection of any ℓ sets is not covered by the union of any other s sets of this family. A binary code is said to be a list-decoding disjunctive of strength s with list size L if it is an incidence matrix of a family of sets where the union of any s sets can cover no more that L − 1 other sets of this family. For L = ℓ = 1, both definitions coincide, and the corresponding binary code is called a disjunctive s-code. This paper is aimed at improving previously known and obtaining new bounds on the rate of these codes. The most interesting of the new results is a lower bound on the rate of disjunctive (s, ℓ) cover-free codes obtained by random coding over the ensemble of binary constant-weight codes; its ratio to the best known upper bound converges as s → ∞, with an arbitrary fixed ℓ ≥ 1, to the limit 2e −2 = 0.271 ... In the classical case of ℓ = 1, this means that the upper bound on the rate of disjunctive s-codes constructed in 1982 by D’yachkov and Rykov is asymptotically attained up to a constant factor a, 2e −2 ≤ a ≤ 1.
Problems of Information Transmission – Springer Journals
Published: Apr 15, 2014
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.