Iterative Approximate Linear Programming Decoding of LDPC Codes With Linear Complexity

DOI10.1109/TIT.2009.2030477zbMath1367.94421OpenAlexW2172190188MaRDI QIDQ4974042

David Burshtein

Publication date: 8 August 2017

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

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

Mathematics Subject Classification ID

Linear programming (90C05) Other types of codes (94B60) Decoding (94B35)

Related Items (1)

A branch-cut-and-price algorithm for optimal decoding in digital communication systems

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