New channel coding achievability bounds

Yury Polyanskiy, H. Vincent Poor, Sergio Verdu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Scopus citations

Abstract

Three essentially different approaches to the constructive part of the channel coding theorem have been proposed by Shannon, Feinstein and Gallager, respectively, leading to upper bounds on the minimal error probability achievable with a given rate and blocklength. Here, new upper bounds are given on both average and maximal error probability, which are tighter than existing bounds for many ranges of blocklength and channel parameters of interest. Along with converse bounds, the new achievability bounds allow to approximate tightly the maximum rate achievable for a given blocklength and error probability for blocklengths as short as n = 200 for both the BSC and the BEC.

Original languageEnglish (US)
Title of host publicationProceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages1763-1767
Number of pages5
DOIs
StatePublished - Sep 29 2008
Event2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada
Duration: Jul 6 2008Jul 11 2008

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
ISSN (Print)2157-8101

Other

Other2008 IEEE International Symposium on Information Theory, ISIT 2008
CountryCanada
CityToronto, ON
Period7/6/087/11/08

All Science Journal Classification (ASJC) codes

  • Applied Mathematics
  • Modeling and Simulation
  • Theoretical Computer Science
  • Information Systems

Fingerprint Dive into the research topics of 'New channel coding achievability bounds'. Together they form a unique fingerprint.

Cite this