A note on decoding of superimposed codes
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
384 | en_US |
dc.citation.issue |
4 | en_US |
dc.citation.spage |
381 | en_US |
dc.citation.volume |
7 | en_US |
dc.citation.woscount |
5 | |
dc.contributor.author |
Huang, T | en_US |
dc.contributor.author |
Weng, CW | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:40:01Z | |
dc.date.available |
2014-12-08T15:40:01Z | |
dc.date.issued |
2003-12-01 | en_US |
dc.description.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 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). | en_US |
dc.identifier.doi |
10.1023/B:JOCO.0000017386.09330.70 | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1023/B:JOCO.0000017386.09330.70 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/27335 | |
dc.identifier.wosnumber |
WOS:000189208100006 | |
dc.language.iso |
en_US | en_US |
dc.subject |
superimposed codes | en_US |
dc.title |
A note on decoding of superimposed codes | en_US |
dc.type |
Article | en_US |
檔案
- 000189208100006.pdf (73.7 KB, Adobe PDF)
所屬典藏: 期刊論文