Department of Mathematics
 Search | Help | Login | pdf version | printable version

Math @ Duke



Publications [#319349] of Henry Pfister

Papers Published

  1. Jian, YY; Pfister, HD; Narayanan, KR, Approaching capacity at high rates with iterative hard-decision decoding, Ieee International Symposium on Information Theory Proceedings (October, 2012), pp. 2696-2700, IEEE, ISBN 9781467325790 [doi]
    (last updated on 2019/07/21)

    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.
ph: 919.660.2800
fax: 919.660.2821

Mathematics Department
Duke University, Box 90320
Durham, NC 27708-0320