Using linear programming to Decode Binary linear codes

Abstract

A new method is given for performing approximate maximum-likelihood (ML) decoding of an arbitrary binary linear code based on observations received from any discrete memoryless symmetric channel. The decoding algorithm is based on a linear programming (LP) relaxation that is defined by a factor graph or parity-check representation of the code. The resulting… (More)
DOI: 10.1109/TIT.2004.842696

Topics

11 Figures and Tables

Statistics

0204060'05'07'09'11'13'15'17
Citations per Year

536 Citations

Semantic Scholar estimates that this publication has 536 citations based on the available data.

See our FAQ for additional information.