Abstract
In this paper we consider the finite-length performance of Repeat-Accumulate codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.
Details
Title
Finite-length scaling of repeat-accumulate codes on the BEC
Author(s)
Andriyanova, Iryna
Published in
2008 International Zurich Seminar On Communications
Pages
64-67
Conference
International Zurich Seminar on Communications, Zurich, SWITZERLAND, Mar 12-14, 2008
Date
2008
Publisher
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa
ISBN
978-1-4244-1681-3
Other identifier(s)
View record in Web of Science
Laboratories
LTHC
Record Appears in
Scientific production and competences > I&C - School of Computer and Communication Sciences > IINFCOM > LTHC - Communication Theories Laboratory
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Peer-reviewed publications
Conference Papers
Work produced at EPFL
Published
Record creation date
2010-11-30