Performance analysis of linear codes under maximum likelihood decoding at low rates

Hideki Yagi; H. Vincent Poor

doi:10.1109/ISIT.2010.5513669

Performance analysis of linear codes under maximum likelihood decoding at low rates

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

Abstract

Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.

Original language	English (US)
Title of host publication	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings
Pages	1168-1172
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2010.5513669
State	Published - Aug 23 2010
Event	2010 IEEE International Symposium on Information Theory, ISIT 2010 - Austin, TX, United States Duration: Jun 13 2010 → Jun 18 2010

Publication series

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

Other

Other	2010 IEEE International Symposium on Information Theory, ISIT 2010
Country/Territory	United States
City	Austin, TX
Period	6/13/10 → 6/18/10

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2010.5513669

Cite this

@inproceedings{18656f9592664eefafd2b33c9d7a71ec,

title = "Performance analysis of linear codes under maximum likelihood decoding at low rates",

abstract = "Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.",

author = "Hideki Yagi and Poor, {H. Vincent}",

year = "2010",

month = aug,

day = "23",

doi = "10.1109/ISIT.2010.5513669",

language = "English (US)",

isbn = "9781424469604",

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

pages = "1168--1172",

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

note = "2010 IEEE International Symposium on Information Theory, ISIT 2010 ; Conference date: 13-06-2010 Through 18-06-2010",

}

Yagi, H & Poor, HV 2010, Performance analysis of linear codes under maximum likelihood decoding at low rates. in 2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings., 5513669, IEEE International Symposium on Information Theory - Proceedings, pp. 1168-1172, 2010 IEEE International Symposium on Information Theory, ISIT 2010, Austin, TX, United States, 6/13/10. https://doi.org/10.1109/ISIT.2010.5513669

Performance analysis of linear codes under maximum likelihood decoding at low rates. / Yagi, Hideki; Poor, H. Vincent.

2010 IEEE International Symposium on Information Theory, ISIT 2010 - Proceedings. 2010. p. 1168-1172 5513669 (IEEE International Symposium on Information Theory - Proceedings).

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

TY - GEN

T1 - Performance analysis of linear codes under maximum likelihood decoding at low rates

AU - Yagi, Hideki

AU - Poor, H. Vincent

PY - 2010/8/23

Y1 - 2010/8/23

N2 - Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.

AB - Or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. or a given linear code, a lower bound on the error exponent under maximum likelihood decoding is investigated at low rates. F In the analysis of the decoding error probability, it is important to characterize the error exponent, since it indicates how fast the probability of decoding error converges to zero asymptotically. Over a symmetric memoryless channel, an error exponent is derived for a given linear code. A sufficient condition for achieving the expurgated exponent, which is the best among known error exponents at low rates, is given. Over a general discrete memoryless channel, the same analysis shows the expected error exponent of an ensemble of coset codes generated by a given linear code.

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

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

U2 - 10.1109/ISIT.2010.5513669

DO - 10.1109/ISIT.2010.5513669

M3 - Conference contribution

AN - SCOPUS:77955676686

SN - 9781424469604

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1168

EP - 1172

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

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

Y2 - 13 June 2010 through 18 June 2010

ER -

Performance analysis of linear codes under maximum likelihood decoding at low rates

Abstract

Publication series

Other

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this