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

Math @ Duke



Publications [#319392] of Henry Pfister

Papers Published

  1. Pfister, HD; Sason, I, Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity, Ieee Transactions on Information Theory, vol. 53 no. 6 (June, 2007), pp. 2088-2115, Institute of Electrical and Electronics Engineers (IEEE) [doi]
    (last updated on 2019/07/17)

    This paper introduces ensembles of systematic accumulaterepeataccumulate (ARA) codes which asymptotically achieve capacity on the binary erasure channel (BEC) with bounded complexity, per information bit, of encoding and decoding. It also introduces symmetry properties which play a central role in the construction of new capacity-achieving ensembles for the BEC. The results here improve on the tradeoff between performance and complexity provided by previous constructions of capacity-achieving code ensembles defined on graphs. The superiority of ARA codes with moderate to large block length is exemplified by computer simulations which compare their performance with those of previously reported capacity-achieving ensembles of low-density parity-check (LDPC) and irregular repeataccumulate (IRA) codes. ARA codes also have the advantage of being systematic. © 2007 IEEE.
ph: 919.660.2800
fax: 919.660.2821

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