Approaching capacity at high rates with iterative hard-decision decoding Conference Paper uri icon


  • A variety of low-density parity-check (LDPC) ensembles have now been observed to approach capacity with message-passing decoding. However, all of them use soft (i.e., non-binary) messages and a posteriori probability (APP) decoding of their component codes. In this paper, we analyze a class of spatially-coupled generalized LDPC codes and observe that, in the high-rate regime, they can approach capacity under iterative hard-decision decoding. These codes can be seen as generalized product codes and are closely related to braided block codes. 2012 IEEE.

name of conference

  • 2012 IEEE International Symposium on Information Theory - ISIT

published proceedings

  • 2012 IEEE International Symposium on Information Theory Proceedings

author list (cited authors)

  • Jian, Y., Pfister, H. D., & Narayanan, K. R.

citation count

  • 31

complete list of authors

  • Jian, Yung-Yih||Pfister, Henry D||Narayanan, Krishna R

publication date

  • July 2012