An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
From MaRDI portal
Publication:3604447
DOI10.1109/TIT.2008.917682zbMATH Open1328.94099OpenAlexW2147760514MaRDI QIDQ3604447FDOQ3604447
Authors: Michael Chertkov, M. G. Stepanov 
Publication date: 24 February 2009
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2008.917682
Recommendations
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- Using linear programming to decode LDPC codes
- Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity
- Efficient Implementation of Linear Programming Decoding
- Multistep linear programming approaches for decoding low-density parity-check codes
- Efficient decoding implementations of LDPC codes
- A parameter search algorithm based on optimal linear codes
- Pseudocodeword Performance Analysis for LDPC Convolutional Codes
- An Efficient Instanton Search Algorithm for LP Decoding of LDPC Codes Over the BSC
- Linear-Programming Decoding of Nonbinary Linear Codes
Cited In (8)
- Minimum Pseudoweight and Minimum Pseudocodewords of LDPC Codes
- Using linear programming to decode LDPC codes
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- Pseudocodeword Performance Analysis for LDPC Convolutional Codes
- A search algorithm for linear codes: Progressive dimension growth
- On linear programming decoding on a quantized additive white Gaussian noise channel
- New results on the pseudoredundancy
- A branch-cut-and-price algorithm for optimal decoding in digital communication systems
This page was built for publication: An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604447)
