On optimal superimposed codes
From MaRDI portal
Publication:4458733
DOI10.1002/JCD.10056zbMATH Open1051.94013OpenAlexW2083710324MaRDI QIDQ4458733FDOQ4458733
Authors: Hyun Kwang Kim, Vladimir Lebedev 
Publication date: 15 March 2004
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.10056
Recommendations
- Some new results on superimposed codes
- scientific article; zbMATH DE number 2154117
- Optimal superimposed codes and designs for Renyi's search model
- On the optimality of trivial \((w,r)\)-cover-free codes
- Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others
concatenationcovering arrayalgebraic geometric codet-designsuperimposed codecover-free familykey distribution patternsuper-simple designmutually orthogonal latin squares, MOLS
Cryptography (94A60) Combinatorial aspects of block designs (05B05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40) Extremal set theory (05D05)
Cites Work
Cited In (61)
- Decomposable super‐simple BIBDs with block size 4 and index 4, 6
- Asymptotic bounds for the rate of colored superimposed codes
- The existence of \(2^3\)-decomposable super-simple \((v,4,6)\)-BIBDs
- Title not available (Why is that?)
- Uniform hypergraphs containing no grids
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Some new results on superimposed codes
- Super-simple pairwise balanced designs with block sizes 3 and 4
- Nonadaptive algorithms for threshold group testing
- A note on the uniqueness of \((w, r)\) cover-free codes
- \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Super-simple, pan-orientable and pan-decomposable GDDs with block size 4
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures
- Nonrandom binary superimposed codes
- Super-simple balanced incomplete block designs with block size 4 and index 6
- Super-simple group divisible designs with block size 4 and index 9
- Super-simple BIBDs with block size 4 and index 7
- Completely reducible super-simple designs with block size four and related super-simple packings
- Super-simple balanced incomplete block designs with block size 5 and index 3
- Super-simple group divisible designs with block size 4 and index 2
- A survey on nonadaptive group testing algorithms through the angle of decoding
- Super-simple balanced incomplete block designs with block size 4 and index 9
- Super-simple group divisible designs with block size 4 and index 5
- Superimposed codes for the search model of a. renyi
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- Title not available (Why is that?)
- Super-simple \((\nu, 5, 5)\) designs
- Super-simple cyclic designs with small values
- On the optimality of trivial \((w,r)\)-cover-free codes
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution
- A combinatorial problem in the superimposed codes theory
- Super-simple twofold Steiner pentagon systems
- On the construction of \((w,r)\) cover-free codes
- Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\)
- Bounds on the rate of disjunctive codes
- Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4
- On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\)
- Separating codes and a new combinatorial search model
- Superimposed concatenated codes (Corresp.)
- A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets
- Super-simple \((5, 4)\)-GDDs of group type \(g^u\)
- Title not available (Why is that?)
- Decomposable super‐simple NRBIBDs with block size 4 and index 6
- Some constructions of superimposed codes in Euclidean spaces.
- Uniqueness of some optimal superimposed codes
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 4
- An improved analysis of least squares superposition codes with Bernoulli dictionary
- Super-visible codes
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
- The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$
- Improved constructions for non-adaptive threshold group testing
- A classification of the structures of some Sperner families and superimposed codes
- On the Probability Distribution of Superimposed Random Codes
- Superimposed Codes and Threshold Group Testing
- New constructions of superimposed codes
- Super-simple \((v,5,4)\) designs
- Super-simple balanced incomplete block designs with block size 4 and index 5
- On some optimal \((N,T,1,2)\) and \((N,T,1,3)\) superimposed codes
- Optimal superimposed codes and designs for Renyi's search model
This page was built for publication: On optimal superimposed codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458733)
