A Note on Decoding of Superimposed Codes

Author: Huang Tayuan   Weng Chih-Wen  

Publisher: Springer Publishing Company

ISSN: 1382-6905

Source: Journal of Combinatorial Optimization, Vol.7, Iss.4, 2003-12, pp. : 381-384

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

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 \lfloor \frac{d-1}{2}\rfloor 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).