Bounds on the length of disjunctive codes
From MaRDI portal
Publication:594081
zbMath0524.94015MaRDI QIDQ594081
Vyacheslav V. Rykov, Arkadii G. D'yachkov
Publication date: 1982
Published in: Problems of Information Transmission (Search for Journal in Brave)
Related Items (10)
Optimal group testing ⋮ Tracing a single user ⋮ Codes identifying sets of vertices in random networks ⋮ Strongly separable matrices for nonadaptive combinatorial group testing ⋮ Combinatorial search in two and more rounds ⋮ Strict group testing and the set basis problem ⋮ Almost separable matrices ⋮ A new kind of selectors and their applications to conflict resolution in wireless multichannels networks ⋮ Separable collusion-secure multimedia codes ⋮ A SEMI-SPLITTING FINITE DIFFERENCE SCHEME OF MATRIX COEFFICIENTS AND ITS APPLICATION TO DESCRIBE THE TSUNAMI PROPAGATION
This page was built for publication: Bounds on the length of disjunctive codes
