New constructions of superimposed codes
From MaRDI portal
Publication:4503517
DOI10.1109/18.817530zbMath0999.94044OpenAlexW2106329929MaRDI QIDQ4503517
Vyacheslav V. Rykov, Arkadii G. D'yachkov, Anthony J. Macula
Publication date: 7 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.817530
Related Items
List decoding for a multiple access hyperchannel ⋮ SOME CONSTRUCTIONS OF MUTUALLY ORTHOGONAL LATIN SQUARES AND SUPERIMPOSED CODES ⋮ A group testing method for finding patterns in data ⋮ Synthetic sequence design for signal location search ⋮ Improved constructions for non-adaptive threshold group testing ⋮ On a hyperplane arrangement problem and tighter analysis of an error-tolerant pooling design ⋮ Trivial two-stage group testing for complexes using almost disjunct matrices. ⋮ Constructions of generalized superimposed codes with applications to group testing and conflict resolution in multiple access channels. ⋮ Uniqueness of some optimal superimposed codes ⋮ Strict group testing and the set basis problem ⋮ Coding for a multiple access OR channel: A survey ⋮ Superimposed Codes and Threshold Group Testing ⋮ New Construction of Error-Tolerant Pooling Designs ⋮ Families of finite sets in which no intersection of \(\ell\) sets is covered by the union of \(s\) others ⋮ Bounds on the rate of disjunctive codes ⋮ On the upper bounds of the minimum number of rows of disjunct matrices ⋮ Unnamed Item ⋮ Coding for a Multiple Access OR Channel: a Survey ⋮ Almost disjunctive list-decoding codes
