By Topic

Analog Product Codes Decodable by Linear Programming

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Avi Zanko ; School of Engineering, Bar-Ilan University, Ramat-Gan, Israel ; Amir Leshem ; Ephraim Zehavi

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.

Published in:

IEEE Transactions on Information Theory  (Volume:58 ,  Issue: 2 )