Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Finite-Length Scaling of Parallel Turbo Codes on the BEC
 
Loading...
Thumbnail Image
conference paper

Finite-Length Scaling of Parallel Turbo Codes on the BEC

Andriyanova, Iryna
2008
2008 Ieee International Symposium On Information Theory Proceedings
IEEE International Symposium on Information Theory

In this paper we consider the finite-length performance of turbo codes in the waterfall region assuming the transmission on the binary erasure channel. We extend the finite-length scaling law of LDPC codes [1] and of Repeat-Accumulate codes [3] to this ensemble and we derive the scaling parameter. The obtained performance estimations match very well with numerical results.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/ISIT.2008.4595317
Web of Science ID

WOS:000260364401100

Author(s)
Andriyanova, Iryna
Date Issued

2008

Publisher

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa

Journal
2008 Ieee International Symposium On Information Theory Proceedings
ISBN of the book

978-1-4244-2256-2

Start page

1893

End page

1897

Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LTHC  
Event nameEvent placeEvent date
IEEE International Symposium on Information Theory

Toronto, CANADA

Jul 06-11, 2008

Available on Infoscience
November 30, 2010
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/60893
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés