Finding All Small Error-Prone Substructures in LDPC Codes
From MaRDI portal
Publication:4975832
DOI10.1109/TIT.2009.2015993zbMath1367.94459MaRDI QIDQ4975832
Sanjeev R. Kulkarni, H. Vincent Poor, Chih-Chun Wang
Publication date: 8 August 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Bounds on codes (94B65) Other types of codes (94B60)
Related Items
On the complexity of and solutions to the minimum stopping and trapping set problems, A study of error floor behavior in QC-MDPC codes, Effect of one redundant parity-check equation on the stopping distance
