Using linear programming to decode LDPC codes
From MaRDI portal
Publication:3021082
zbMATH Open1226.90042MaRDI QIDQ3021082FDOQ3021082
Authors: Z.-J. Dong, Guang-Zeng Feng 
Publication date: 5 August 2011
Recommendations
- Using Linear Programming to Decode Binary Linear Codes
- Multistep linear programming approaches for decoding low-density parity-check codes
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
- A New Linear Programming Approach to Decoding Linear Block Codes
- Decoding turbo-like codes via linear programming
Linear programming (90C05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)
Cited In (14)
- Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
- Decoding turbo-like codes via linear programming
- Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
- Efficient Implementation of Linear Programming Decoding
- Adaptive Methods for Linear Programming Decoding
- Analog Product Codes Decodable by Linear Programming
- Implementing gradient descent decoding
- Linear Programming Decoding of Spatially Coupled Codes
- Reweighted LP Decoding for LDPC Codes
- Solving LPN Using Covering Codes
- Using Linear Programming to Decode Binary Linear Codes
- Multistep linear programming approaches for decoding low-density parity-check codes
- A New Linear Programming Approach to Decoding Linear Block Codes
- An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
This page was built for publication: Using linear programming to decode LDPC codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3021082)
