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. Journal articles
  4. Capacity-achieving ensembles for the binary erasure channel with bounded complexity
 
research article

Capacity-achieving ensembles for the binary erasure channel with bounded complexity

Pfister, H. D.
•
Sason, I.  
•
Urbanke, R.  
2005
IEEE Transactions on Information Theory
  • Details
  • Metrics
Type
research article
DOI
10.1109/TIT.2005.850079
Web of Science ID

WOS:000230151700007

Author(s)
Pfister, H. D.
Sason, I.  
Urbanke, R.  
Date Issued

2005

Published in
IEEE Transactions on Information Theory
Volume

51

Issue

7

Start page

2352

End page

2379

Editorial or Peer reviewed

REVIEWED

Written at

EPFL

EPFL units
LTHC  
Available on Infoscience
November 22, 2006
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/235903
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