A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC

DOI10.1109/TIT.2019.2909917zbMath1432.94202arXiv1709.00873OpenAlexW2750886954MaRDI QIDQ5224115

Yanfang Liu, Tobias Koch, Pablo M. Olmos

Publication date: 19 July 2019

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

Full work available at URL: https://arxiv.org/abs/1709.00873

zbMATH Keywords

asymptotic performanceHamming boundcoding rateVarshamov boundgeneralized low-density parity-check (GLDPC) codes

Mathematics Subject Classification ID

Decoding (94B35)

This page was built for publication: A Probabilistic Peeling Decoder to Efficiently Analyze Generalized LDPC Codes Over the BEC