On optimal superimposed codes
From MaRDI portal
Publication:4458733
Recommendations
Cites work
Cited in
(67)- Uniform hypergraphs containing no grids
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model
- Optimal superimposed codes and designs for Renyi's search model
- scientific article; zbMATH DE number 55892 (Why is no real title available?)
- Nonadaptive algorithms for threshold group testing
- Super-simple pairwise balanced designs with block sizes 3 and 4
- A note on the uniqueness of \((w, r)\) cover-free codes
- \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs
- Some new results on superimposed codes
- scientific article; zbMATH DE number 4135867 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 2154117 (Why is no real title available?)
- 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
- Decomposable super‐simple BIBDs with block size 4 and index 4, 6
- Decomposable super-simple NRBIBDs with block size 4 and index 6
- 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
- Super-simple group divisible designs with block size 4 and index 5
- 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
- Superimposed codes for the search model of a. renyi
- Asymptotic bounds for the rate of colored superimposed codes
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes
- scientific article; zbMATH DE number 4064918 (Why is no real title available?)
- Super-simple \((\nu, 5, 5)\) designs
- Superimposed codes and threshold group testing
- Super-simple cyclic designs with small values
- On the optimality of trivial \((w,r)\)-cover-free codes
- Some constructions of mutually orthogonal Latin squares and superimposed 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
- Superimposed codes and hypergraphs containing no grids.
- Completely reducible super-simple (v,4,4)-BIBDs and related constant weight codes
- 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
- A binary superimposed \( (z,u)\)-code based on permutation matrix
- Super-simple \((5, 4)\)-GDDs of group type \(g^u\)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications
- scientific article; zbMATH DE number 2154113 (Why is no real title available?)
- Low-weight superimposed codes and their applications
- Some constructions of superimposed codes in Euclidean spaces.
- The existence of 2³-decomposable super-simple (v,4,6)-BIBDs
- Uniqueness of some optimal superimposed codes
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 4
- Super-visible codes
- An improved analysis of least squares superposition codes with Bernoulli dictionary
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design
- Union-intersection-bounded families and their applications
- A classification of the structures of some Sperner families and superimposed codes
- The existence of λ $\lambda $‐decomposable super‐simple (4,2λ) $(4,2\lambda )$‐GDDs of type gu ${g}^{u}$ with λ=2,4 $\lambda =2,4$
- On the Probability Distribution of Superimposed Random Codes
- Super-simple \((v,5,4)\) designs
- New constructions of superimposed codes
- 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
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)
