# Finite-length analysis of a capacity-achieving ensemble for the binary erasure channel

Published

Conference Paper

In this paper, we consider the finite-length performance of a capacity-achieving sequence of irregular repeat-accumulate (IRA) code ensembles. We focus on a sequence of bit-regular ensembles with degree 3 which was shown to achieve capacity with bounded complexity [9]. To characterize how fast the block length of the code must grow with respect to the truncation point of the degree distribution (i.e., maximum check degree), we compute an upper bound on the average weight enumerator. Based on this analysis, we present a particular truncation sequence that could achieve a minimum distance which grows like n1/3 even as the gap to capacity goes to zero. We also consider the performance of these codes in the waterfall region by extending the finite-length scaling law [1] from low-density parity-check codes to IRA codes. This shows that the performance near the iterative decoding threshold is well characterized by a suitably scaled Q-function for large enough block length. Numerical results are given for the scaling parameters of this ensemble sequence and for a few other IRA codes. Unfortunately, the simulation results for the capacity-achieving sequence start to match the scaling law only for very large block lengths. © 2005 IEEE.

### Full Text

### Duke Authors

### Cited Authors

- Pfister, HD

### Published Date

- December 1, 2005

### Published In

- Proceedings of the Ieee Itsoc Information Theory Workshop 2005 on Coding and Complexity, Itw2005

### Start / End Page

- 166 - 170

### International Standard Book Number 10 (ISBN-10)

- 078039481X

### International Standard Book Number 13 (ISBN-13)

- 9780780394810

### Digital Object Identifier (DOI)

- 10.1109/ITW.2005.1531880

### Citation Source

- Scopus