A note on decoding of superimposed codes

檔案

日期

2003-12-01

類型

期刊名稱

JOURNAL OF COMBINATORIAL OPTIMIZATION

卷期與頁次

第 7 卷第 4 期,頁 381–384

ISSN

1382-6905

語言

英文

摘要

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 fewunknown 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 [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).

關鍵詞

superimposed codes

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Huang, T., & Weng, C. (2003). A note on decoding of superimposed codes. JOURNAL OF COMBINATORIAL OPTIMIZATION, 7(4), 381–384. https://doi.org/10.1023/B:JOCO.0000017386.09330.70

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/27335