A Note on Decoding of Superimposed Codes

详细信息    查看全文

• 作者：Tayuan Huang and Chih-Wen Weng
• 关键词：superimposed codes
• 刊名：Journal of Combinatorial Optimization
• 出版年：2003
• 出版时间：December 2003
• 年：2003
• 卷：7
• 期：4
• 页码：381-384
• 全文大小：5 KB

文摘

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 \fracD - 12\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).