Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity

DOI10.1109/TIT.2012.2211859zbMATH Open1364.94644OpenAlexW2065212815MaRDI QIDQ2989459FDOQ2989459

Authors: Dina Goldin, David Burshtein 

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.2012.2211859

Mathematics Subject Classification ID

Linear programming (90C05) Convolutional codes (94B10) Decoding (94B35)

Cited In (5)

• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
• Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity
• Smoothing out binary linear codes and worst-case sub-exponential hardness for LPN
• Efficient Implementation of Linear Programming Decoding
• An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes

This page was built for publication: Iterative Linear Programming Decoding of Nonbinary LDPC Codes With Linear Complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2989459)