LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes

DOI10.1109/TIT.2017.2678531zbMATH Open1395.94008OpenAlexW2963479010MaRDI QIDQ5375586FDOQ5375586

Authors: Badih Ghazi, Euiwoong Lee 

Publication date: 14 September 2018

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

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

Mathematics Subject Classification ID

Communication theory (94A05)

Cited In (3)

• Improved Linear Programming Decoding of LDPC Codes and Bounds on the Minimum and Fractional Distance
• Upper bounds on the rate of LDPC codes
• Approximately Lower Triangular Ensembles of LDPC Codes With Linear Encoding Complexity

This page was built for publication: LP/SDP Hierarchy Lower Bounds for Decoding Random LDPC Codes

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