A Note on Decoding of Superimposed Codes
Tayuan Huang and
Chih-Wen Weng ()
Additional contact information
Tayuan Huang: National Chiao Tung University
Chih-Wen Weng: National Chiao Tung University
Journal of Combinatorial Optimization, 2003, vol. 7, issue 4, No 6, 384 pages
Abstract:
Abstract A superimposed code with general distance D can be used to construct a non-adaptive pooling design. It can then be used to identify a few unknown positives from a large set of items by associating naturally an outcome vector u. A simple method for decoding the outcome vector u is given whenever there are at most $$\frac{{D - 1}}{2}$$ errors occuring in the outcome vector u. Moreover, another simple method of detecting whether there is any error occuring in the outcome vector u is also given whenever there are at most D − 1 errors in u. Our method is a generalization of the classical result of Kautz and Singleton (Nonadaptive binary superimposed codes, IEEE Trans. Inform. Theory, vol. 10, pp. 363–377, 1964).
Keywords: superimposed; codes (search for similar items in EconPapers)
Date: 2003
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)
Downloads: (external link)
http://link.springer.com/10.1023/B:JOCO.0000017386.09330.70 Abstract (text/html)
Access to the full text of the articles in this series is restricted.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:7:y:2003:i:4:d:10.1023_b:joco.0000017386.09330.70
Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878
DOI: 10.1023/B:JOCO.0000017386.09330.70
Access Statistics for this article
Journal of Combinatorial Optimization is currently edited by Thai, My T.
More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().