An approximation to the weight distribution of binary linear codes
IEEE Transactions on Information Theory
On the weight enumerator of product codes
Discrete Mathematics - A collection of contributions in honour of Jack van Lint
A lower bound on the probability of a union
Discrete Mathematics
A lower bound on the probability of a finite union of events
Discrete Mathematics
Multiuser Detection
Principles of Digital Communication and Coding
Principles of Digital Communication and Coding
Information Theory and Reliable Communication
Information Theory and Reliable Communication
Information Theory: Coding Theorems for Discrete Memoryless Systems
Information Theory: Coding Theorems for Discrete Memoryless Systems
Turbo codes and turbo coded modulation systems: analysis and performance bounds
Turbo codes and turbo coded modulation systems: analysis and performance bounds
On the capacity of finite state channels and the analysis of convolutional accumulate-m codes
On the capacity of finite state channels and the analysis of convolutional accumulate-m codes
Performance analysis of binary coded systems over Rician block fading channels
MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
On the performance of efficient coding techniques over fading channels
IEEE Transactions on Wireless Communications
Voronoi regions for binary linear block codes
IEEE Transactions on Information Theory
Unveiling turbo codes: some results on parallel concatenated coding schemes
IEEE Transactions on Information Theory
The weight distribution of the third-order Reed-Muller code of length 512
IEEE Transactions on Information Theory
The weight distributions of extended binary primitive BCH codes of length 128
IEEE Transactions on Information Theory
Serial concatenation of interleaved codes: performance analysis, design, and iterative decoding
IEEE Transactions on Information Theory
Bit-interleaved coded modulation
IEEE Transactions on Information Theory
Minimal vectors in linear codes
IEEE Transactions on Information Theory
Modulation and coding for linear Gaussian channels
IEEE Transactions on Information Theory
Fading channels: information-theoretic and communications aspects
IEEE Transactions on Information Theory
A comparison of known codes, random codes, and the best codes
IEEE Transactions on Information Theory
On the Voronoi neighbor ratio for binary linear block codes
IEEE Transactions on Information Theory
A lower bound on the error probability for signals in white Gaussian noise
IEEE Transactions on Information Theory
Multilevel codes: theoretical concepts and practical design rules
IEEE Transactions on Information Theory
Evaluating the performance of convolutional codes over block fading channels
IEEE Transactions on Information Theory
On the weight distribution of terminated convolutional codes
IEEE Transactions on Information Theory
Random coding techniques for nonrandom codes
IEEE Transactions on Information Theory
Which codes have cycle-free Tanner graphs?
IEEE Transactions on Information Theory
On interleaved, differentially encoded convolutional codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On coding for block fading channels
IEEE Transactions on Information Theory
Mismatched decoding revisited: general alphabets, channels with memory, and the wide-band limit
IEEE Transactions on Information Theory
The capacity of low-density parity-check codes under message-passing decoding
IEEE Transactions on Information Theory
Design of capacity-approaching irregular low-density parity-check codes
IEEE Transactions on Information Theory
Performance bounds for high rate linear codes over partial-response channels
IEEE Transactions on Information Theory
Tighter bounds on the error probability of fixed convolutional codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Bounds on the maximum-likelihood decoding error probability of low-density parity-check codes
IEEE Transactions on Information Theory
On ensembles of low-density parity-check codes: asymptotic distance distributions
IEEE Transactions on Information Theory
Fading channels: how perfect need "perfect side information" be?
IEEE Transactions on Information Theory
An average weight-distance enumerator for binary expansions of Reed-Solomon codes
IEEE Transactions on Information Theory
Coding theorems for turbo code ensembles
IEEE Transactions on Information Theory
Variance of the turbo code performance bound over the interleavers
IEEE Transactions on Information Theory
Upper bounds on the rate of LDPC codes
IEEE Transactions on Information Theory
More results on the weight enumerator of product codes
IEEE Transactions on Information Theory
Variations on the Gallager bounds, connections, and applications
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The serial concatenation of rate-1 codes through uniform random interleavers
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
On performance limits of space-time codes: a sphere-packing bound approach
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
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
On the application of LDPC codes to arbitrary discrete-memoryless channels
IEEE Transactions on Information Theory
Box and match techniques applied to soft-decision decoding
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Performance analysis of turbo-SPC codes
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Sphere-packing bounds revisited for moderate block lengths
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
The ML decoding performance of LDPC ensembles over Zq
IEEE Transactions on Information Theory
Capacity-achieving ensembles for the binary erasure channel with bounded complexity
IEEE Transactions on Information Theory
Tight bounds for LDPC and LDGM codes under MAP decoding
IEEE Transactions on Information Theory
Coded modulation in the block-fading channel: coding theorems and code construction
IEEE Transactions on Information Theory
Reliable channel regions for good binary codes transmitted over parallel channels
IEEE Transactions on Information Theory
Iterative Soft-Input Soft-Output Decoding of Reed–Solomon Codes by Adapting the Parity-Check Matrix
IEEE Transactions on Information Theory
Weight Distribution of Low-Density Parity-Check Codes
IEEE Transactions on Information Theory
On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
IEEE Transactions on Information Theory
New Gallager Bounds in Block-Fading Channels
IEEE Transactions on Information Theory
On the Error Exponents of Improved Tangential Sphere Bounds
IEEE Transactions on Information Theory
Tightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes
IEEE Transactions on Information Theory
Coding for Parallel Channels: Gallager Bounds and Applications to Turbo-Like Codes
IEEE Transactions on Information Theory
Maxwell Construction: The Hidden Bridge Between Iterative and Maximum a Posteriori Decoding
IEEE Transactions on Information Theory
A lower bound on the error probability for signals in white Gaussian noise
IEEE Transactions on Information Theory
Design and analysis of turbo codes on Rayleigh fading channels
IEEE Journal on Selected Areas in Communications
Performance evaluation of superorthogonal turbo codes in AWGN and flat Rayleigh fading channels
IEEE Journal on Selected Areas in Communications
Analysis, design, and iterative decoding of double serially concatenated codes with interleavers
IEEE Journal on Selected Areas in Communications
Improved tangential sphere bound on the bit-error probability of concatenated codes
IEEE Journal on Selected Areas in Communications
On the theory and performance of trellis termination methods for turbo codes
IEEE Journal on Selected Areas in Communications
Bit-Interleaved Coded Modulation
Foundations and Trends in Communications and Information Theory
Analysis and design of punctured rate-1/2 turbo codes exhibiting low error floors
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
A channel representation method for the study of hybrid retransmission-based error control
IEEE Transactions on Communications
On universal properties of capacity-approaching LDPC code ensembles
IEEE Transactions on Information Theory
Improvement of Gallager upper bound and its variations for discrete channels
IEEE Transactions on Information Theory
Lower bounds on the graphical complexity of finite-length LDPC codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 1
Performance of sphere decoding of block codes
IEEE Transactions on Communications
Performance bounds for nonbinary linear block codes over memoryless symmetric channels
IEEE Transactions on Information Theory
Robust detection of random variables using sparse measurements
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
IEEE Transactions on Information Theory
Performance bounds for erasure, list and decision feedback schemes with linear block codes
IEEE Transactions on Information Theory
Hi-index | 0.30 |
This article is focused on the performance evaluation of linear codes under optimal maximum-likelihood (ML) decoding. Though the ML decoding algorithm is prohibitively complex for most practical codes, their performance analysis under ML decoding allows to predict their performance without resorting to computer simulations. It also provides a benchmark for testing the sub-optimality of iterative (or other practical) decoding algorithms. This analysis also establishes the goodness of linear codes (or ensembles), determined by the gap between their achievable rates under optimal ML decoding and information theoretical limits. In this article, upper and lower bounds on the error probability of linear codes under ML decoding are surveyed and applied to codes and ensembles of codes on graphs. For upper bounds, we discuss various bounds where focus is put on Gallager bounding techniques and their relation to a variety of other reported bounds. Within the class of lower bounds, we address de Caen's based bounds and their improvements, and also consider sphere-packing bounds with their recent improvements targeting codes of moderate block lengths.