Improvement of Gallager upper bound and its variations for discrete channels

Authors:
Kostis Xenoulis;Nicholas Kalouptsidis
Affiliations:
Department of Informatics and Telecommunications, University of Athens, Athens, Greece;Department of Informatics and Telecommunications, University of Athens, Athens, Greece
Venue:
IEEE Transactions on Information Theory
Year:
2009

Citing 5
Cited 0

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)

Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial

Communications and Information Theory
Voronoi regions for binary linear block codes

IEEE Transactions on Information Theory
Lower bounds on the error probability of block codes based on improvements on de Caen's inequality

IEEE Transactions on Information Theory
Minimal Trellis Modules and Equivalent Convolutional Codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	754.84

Visualization

Abstract

A new tight upper bound on the maximum-likelihood (ML) word and bit-error decoding probabilities for specific codes over discrete channels is presented. It constitutes an enhanced version of the Gallager upper bound and its variations resulting from the Duman-Salehi second bounding technique. An efficient technique is developed that, in the case of symmetric channels, overcomes the difficulties associated with the direct computation of the proposed bound. Surprisingly, apart from the distance and input-output weight enumerating functions (IOWEFs), the bound depends also on the coset weight distribution of the code.