research-article

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes

Authors:

M. Twitto,

I. Sason,

S. ShamaiAuthors Info & Claims

IEEE Transactions on Information Theory, Volume 53, Issue 4

Pages 1495 - 1510

https://doi.org/10.1109/TIT.2007.892807

Published: 01 April 2007 Publication History

Abstract

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and output-symmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes over the additive white Gaussian noise (AWGN) channel. An expurgation of the distance spectrum of binary linear block codes further tightens the resulting upper bounds

Cited By

View all

Sason I(2015)On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding TheoremIEEE Transactions on Information Theory10.1109/TIT.2015.250410062:1(23-34)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2504100
Domb YFeder M(2015)Non-Random Coding Error Bounds for LatticesIEEE Transactions on Information Theory10.1109/TIT.2015.249635262:1(108-120)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2496352
En-Hui Yang Jin Meng (2015)New Nonasymptotic Channel Coding Theorems for Structured CodesIEEE Transactions on Information Theory10.1109/TIT.2015.244985261:9(4534-4553)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2449852
Show More Cited By

Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
1. Mathematics of computing
  1. Information theory
2. Security and privacy
  1. Cryptography

Recommendations

Performance bounds for nonbinary linear block codes over memoryless symmetric channels

The performance of nonbinary linear block codes is studied in this paper via the derivation of new upper bounds on the block error probability under maximum-likelihood (ML) decoding. The transmission of these codes is assumed to take place over a ...
Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

The moderate complexity of low-density parity-check (LDPC) codes under iterative decoding is attributed to the sparseness of their parity-check matrices. It is therefore of interest to consider how sparse parity-check matrices of binary linear block ...
A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference

Performance evaluation of maximum-likelihood (ML) soft-decision-decoded binary block codes is usually carried out using bounding techniques. Many tight upper bounds on the error probability of binary codes are based on the so-called Gallager's first ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

IEEE Transactions on Information Theory Volume 53, Issue 4

April 2007

362 pages

ISSN:0018-9448

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 April 2007

Author Tags

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 18 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Sason I(2015)On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding TheoremIEEE Transactions on Information Theory10.1109/TIT.2015.250410062:1(23-34)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2504100
Domb YFeder M(2015)Non-Random Coding Error Bounds for LatticesIEEE Transactions on Information Theory10.1109/TIT.2015.249635262:1(108-120)Online publication date: 18-Dec-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2496352
En-Hui Yang Jin Meng (2015)New Nonasymptotic Channel Coding Theorems for Structured CodesIEEE Transactions on Information Theory10.1109/TIT.2015.244985261:9(4534-4553)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.1109/TIT.2015.2449852
Wang CKulkarni SPoor H(2009)Finding all small error-prone substructures in LDPC codesIEEE Transactions on Information Theory10.1109/TIT.2009.201599355:5(1976-1999)Online publication date: 1-May-2009
https://dl.acm.org/doi/10.1109/TIT.2009.2015993

Abstract

Cited By

Recommendations

Performance bounds for nonbinary linear block codes over memoryless symmetric channels

Parity-Check Density Versus Performance of Binary Linear Block Codes: New Bounds and Applications

A new upper bound on the ML decoding error probability of linear binary block codes in AWGN interference

Comments

Information

Published In

Publisher

Publication History

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Share

Share this Publication link

Share on social media

Affiliations