Analog Product Codes Decodable by Linear Programming

Autor:	Amir Leshem, E. Zehavi, Avi Zanko
Rok vydání:	2012
Předmět:	Block code Theoretical computer science Compressed sensing Linear programming Computer science Library and Information Sciences Communication complexity Block size Algorithm Decoding methods Linear programming decoding Computer Science Applications Information Systems
Zdroj:	IEEE Transactions on Information Theory. 58:509-518
ISSN:	1557-9654 0018-9448
DOI:	10.1109/tit.2011.2173709
Popis:	In this paper, we present a new analog error correcting coding scheme for real valued signals that are corrupted by impulsive noise. This product code improves Donoho's deterministic construction by using a probabilistic approach. More specifically, our construction corrects more errors than the Donoho matrices by allowing a vanishingly small probability of error (with the increase in block size). The problem of decoding the long block code is decoupled into two sets of parallel Linear Programming problems. This leads to a significant reduction in decoding complexity as compared to one-step Linear Programming decoding.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::42285a666f92473e2b5727f3a90c0bab https://doi.org/10.1109/tit.2011.2173709 Zobrazit plný text záznamu