Using Linear Programming to Decode Linear Codes

Abstract

Given a linear code and observations from a noisy channel, the decoding problem is to determine the most likely (ML) codeword. We describe a method for approximate ML decoding of an arbitrary binary linear code, based on a linear programming (LP) relaxation that is defined by a factor graph or parity check representation of the code. The resulting LP… (More)

2 Figures and Tables

Topics

Statistics

051015'04'06'08'10'12'14'16'18
Citations per Year

71 Citations

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

See our FAQ for additional information.

  • Presentations referencing similar topics