The following pages link to On optimal superimposed codes (Q4458733):
Displaying 50 items.
- Super-simple resolvable balanced incomplete block designs with block size 4 and index 4 (Q367079) (← links)
- Improved constructions for non-adaptive threshold group testing (Q378256) (← links)
- Uniform hypergraphs containing no grids (Q390731) (← links)
- Super-simple group divisible designs with block size 4 and index 9 (Q546108) (← links)
- Separating codes and a new combinatorial search model (Q619509) (← links)
- On the construction of \((w,r)\) cover-free codes (Q734287) (← links)
- Low-weight superimposed codes and their applications (Q777294) (← links)
- Super-simple \((v,5,4)\) designs (Q881570) (← links)
- Uniqueness of some optimal superimposed codes (Q926629) (← links)
- An upper bound of the number of tests in pooling designs for the error-tolerant complex model (Q941032) (← links)
- Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 (Q966044) (← links)
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures (Q968218) (← links)
- Super-simple group divisible designs with block size 4 and index 2 (Q974497) (← links)
- Nonadaptive algorithms for threshold group testing (Q1028130) (← links)
- Super-simple balanced incomplete block designs with block size 4 and index 5 (Q1043632) (← links)
- Super-simple group divisible designs with block size 4 and index 5 (Q1044987) (← links)
- Super-visible codes (Q1208354) (← links)
- On the optimality of trivial \((w,r)\)-cover-free codes (Q1776203) (← links)
- Super-simple balanced incomplete block designs with block size 4 and index 6 (Q1781533) (← links)
- Further results on the existence of super-simple pairwise balanced designs with block sizes 3 and 4 (Q1783730) (← links)
- Some constructions of superimposed codes in Euclidean spaces. (Q1811096) (← links)
- A combinatorial problem in the superimposed codes theory (Q1908398) (← links)
- Super-simple twofold Steiner pentagon systems (Q1926041) (← links)
- Super-simple BIBDs with block size 4 and index 7 (Q2005681) (← links)
- Union-intersection-bounded families and their applications (Q2026353) (← links)
- Super-simple group divisible designs with block size 4 and index \(\lambda = 7,8\) (Q2231706) (← links)
- Super-simple \((5, 4)\)-GDDs of group type \(g^u\) (Q2258085) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- On super-simple group divisible designs with block size four and index \(\lambda =3,4,6\) (Q2266904) (← links)
- Super-simple balanced incomplete block designs with block size 4 and index 9 (Q2272116) (← links)
- Low-weight superimposed codes and related combinatorial structures: bounds and applications (Q2285161) (← links)
- An improved analysis of least squares superposition codes with Bernoulli dictionary (Q2303504) (← links)
- Super-simple cyclic designs with small values (Q2370484) (← links)
- Super-simple pairwise balanced designs with block sizes 3 and 4 (Q2374179) (← links)
- Asymptotic upper bound for the rate of \((w,r)\) cover-free codes (Q2388455) (← links)
- A survey on nonadaptive group testing algorithms through the angle of decoding (Q2426664) (← links)
- On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design (Q2426665) (← links)
- Completely reducible super-simple designs with block size four and related super-simple packings (Q2430413) (← links)
- A note on the uniqueness of \((w, r)\) cover-free codes (Q2432945) (← links)
- Super-simple balanced incomplete block designs with block size 5 and index 3 (Q2444531) (← links)
- An unexpected meeting of four seemingly unrelated problems: graph testing, DNA complex screening, superimposed codes and secure key distribution (Q2471071) (← links)
- Super-simple \((\nu, 5, 5)\) designs (Q2491294) (← links)
- A classification of the structures of some Sperner families and superimposed codes (Q2502898) (← links)
- \(4^2\)-decomposable super-simple \((v,4,8)\)-BIBDs (Q2675827) (← links)
- A Unifying Order-Theoretic Framework for Superposition Coding: Polymatroidal Structure and Optimality in the Multiple-Access Channel With General Message Sets (Q2979072) (← links)
- (Q4006427) (← links)
- Decomposable super‐simple NRBIBDs with block size 4 and index 6 (Q4629520) (← links)
- Superimposed Codes and Threshold Group Testing (Q4915254) (← links)
- Asymptotic bounds for the rate of colored superimposed codes (Q5121240) (← links)
- Some new results on superimposed codes (Q5462393) (← links)
