Improved linear programming decoding and bounds on the minimum distance of LDPC codes

David Burshtein, Idan Goldenberg

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We propose a technique for improving LP decoding, based on the merging of check nodes. This technique can be applied to standard as well as generalized LDPC codes. Furthermore, we show how a recently-discovered linear-complexity LP decoder can be used to derive non-trivial lower bounds on the minimum distance of specific LDPC codes, with complexity that exhibits quadratic growth with respect to the block length. This bound can be refined using the check node merging technique. The lower bound on the minimum distance is shown to be an upper bound on the fractional distance of the code.

Original languageEnglish
Title of host publication2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings
DOIs
StatePublished - 2010
Event2010 IEEE Information Theory Workshop, ITW 2010 - Dublin, Ireland
Duration: 30 Aug 20103 Sep 2010

Publication series

Name2010 IEEE Information Theory Workshop, ITW 2010 - Proceedings

Conference

Conference2010 IEEE Information Theory Workshop, ITW 2010
Country/TerritoryIreland
CityDublin
Period30/08/103/09/10

Keywords

  • Linear programming decoding
  • iterative decoding
  • low-density parity-check (LDPC) codes
  • maximum likelihood (ML) decoding

Fingerprint

Dive into the research topics of 'Improved linear programming decoding and bounds on the minimum distance of LDPC codes'. Together they form a unique fingerprint.

Cite this