On optimal superimposed codes
From MaRDI portal
Publication:4458733
DOI10.1002/jcd.10056zbMath1051.94013OpenAlexW2083710324MaRDI QIDQ4458733
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
key distribution patternconcatenationcovering arrayalgebraic geometric codet-designsuperimposed codecover-free familysuper-simple designmutually orthogonal latin squares, MOLS
Combinatorial aspects of block designs (05B05) Cryptography (94A60) Extremal set theory (05D05) Combinatorial codes (94B25) Combinatorial aspects of packing and covering (05B40)
Related Items (40)
Super-simple cyclic designs with small values ⋮ Super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ Super-simple resolvable balanced incomplete block designs with block size 4 and index 4 ⋮ Improved constructions for non-adaptive threshold group testing ⋮ Super-simple \((v,5,4)\) designs ⋮ Super-simple twofold Steiner pentagon systems ⋮ Uniform hypergraphs containing no grids ⋮ \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs ⋮ Separating codes and a new combinatorial search model ⋮ The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$ ⋮ Decomposable super‐simple BIBDs with block size 4 and index 4, 6 ⋮ A survey on nonadaptive group testing algorithms through the angle of decoding ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ Completely reducible super-simple designs with block size four and related super-simple packings ⋮ A note on the uniqueness of \((w, r)\) cover-free codes ⋮ Asymptotic bounds for the rate of colored superimposed codes ⋮ Super-simple balanced incomplete block designs with block size 5 and index 3 ⋮ Uniqueness of some optimal superimposed codes ⋮ Decomposable super‐simple NRBIBDs with block size 4 and index 6 ⋮ Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\) ⋮ An upper bound of the number of tests in pooling designs for the error-tolerant complex model ⋮ An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution ⋮ Superimposed Codes and Threshold Group Testing ⋮ Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 ⋮ Super-simple BIBDs with block size 4 and index 7 ⋮ Super-simple \((5, 4)\)-GDDs of group type \(g^u\) ⋮ Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures ⋮ Super-simple group divisible designs with block size 4 and index 9 ⋮ Bounds on the rate of disjunctive codes ⋮ Super-simple group divisible designs with block size 4 and index 2 ⋮ Super-simple \((\nu, 5, 5)\) designs ⋮ On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\) ⋮ Super-simple balanced incomplete block designs with block size 4 and index 9 ⋮ Super-simple balanced incomplete block designs with block size 4 and index 6 ⋮ A classification of the structures of some Sperner families and superimposed codes ⋮ Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 ⋮ On the construction of \((w,r)\) cover-free codes ⋮ Nonadaptive algorithms for threshold group testing ⋮ Super-simple balanced incomplete block designs with block size 4 and index 5 ⋮ Super-simple group divisible designs with block size 4 and index 5
Cites Work
This page was built for publication: On optimal superimposed codes
