Decoding Error-Correcting Codes via Linear Programming (2003)
| Citations: | 53 - 5 self |
BibTeX
@TECHREPORT{Feldman03decodingerror-correcting,
author = {Jon Feldman and David R. Karger},
title = {Decoding Error-Correcting Codes via Linear Programming},
institution = {},
year = {2003}
}
Years of Citing Articles
OpenURL
Abstract
Abstract. Error-correcting codes are fundamental tools used to transmit digital information over unreliable channels. Their study goes back to the work of Hamming [Ham50] and Shannon [Sha48], who used them as the basis for the field of information theory. The problem of decoding the original information up to the full error-correcting potential of the system is often very complex, especially for modern codes that approach the theoretical limits of the communication channel. In this thesis we investigate the application of linear programming (LP) relaxation to the problem of decoding an error-correcting code. Linear programming relaxation is a standard technique in approximation algorithms and operations research, and is central to the study of efficient algorithms to find good (albeit suboptimal) solutions to very difficult optimization problems. Our new “LP decoders ” have tight combinatorial characterizations of decoding success that can be used to analyze error-correcting performance. Furthermore, LP decoders have the desirable (and rare) property that whenever they output a result, it is guaranteed to be the optimal result: the most likely (ML) information sent over the







