New channel coding achievability bounds

Yury Polyanskiy; H. Vincent Poor; Sergio Verdu

doi:10.1109/ISIT.2008.4595291

New channel coding achievability bounds

Yury Polyanskiy, H. Vincent Poor, Sergio Verdu

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

18 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 language	English (US)
Title of host publication	Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008
Pages	1763-1767
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2008.4595291
State	Published - 2008
Event	2008 IEEE International Symposium on Information Theory, ISIT 2008 - Toronto, ON, Canada Duration: Jul 6 2008 → Jul 11 2008

Publication series

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

Other

Other	2008 IEEE International Symposium on Information Theory, ISIT 2008
Country/Territory	Canada
City	Toronto, ON
Period	7/6/08 → 7/11/08

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2008.4595291

Cite this

@inproceedings{9694f52c615547e0854d6b584b398940,

title = "New channel coding achievability bounds",

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.",

author = "Yury Polyanskiy and Poor, {H. Vincent} and Sergio Verdu",

year = "2008",

doi = "10.1109/ISIT.2008.4595291",

language = "English (US)",

isbn = "9781424422579",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1763--1767",

booktitle = "Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008",

note = "2008 IEEE International Symposium on Information Theory, ISIT 2008 ; Conference date: 06-07-2008 Through 11-07-2008",

}

Polyanskiy, Y, Poor, HV & Verdu, S 2008, New channel coding achievability bounds. in Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008., 4595291, IEEE International Symposium on Information Theory - Proceedings, pp. 1763-1767, 2008 IEEE International Symposium on Information Theory, ISIT 2008, Toronto, ON, Canada, 7/6/08. https://doi.org/10.1109/ISIT.2008.4595291

TY - GEN

T1 - New channel coding achievability bounds

AU - Polyanskiy, Yury

AU - Poor, H. Vincent

AU - Verdu, Sergio

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=52349098959&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=52349098959&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2008.4595291

DO - 10.1109/ISIT.2008.4595291

M3 - Conference contribution

AN - SCOPUS:52349098959

SN - 9781424422579

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1763

EP - 1767

BT - Proceedings - 2008 IEEE International Symposium on Information Theory, ISIT 2008

T2 - 2008 IEEE International Symposium on Information Theory, ISIT 2008

Y2 - 6 July 2008 through 11 July 2008

ER -

New channel coding achievability bounds

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this