Elements of information theory
Elements of information theory
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
Performance analysis of linear codes under maximum-likelihood decoding: a tutorial
Communications and Information Theory
Performance bounds for nonbinary linear block codes over memoryless symmetric channels
IEEE Transactions on Information Theory
Composite scheme LR+Th for decoding with erasures and its effective equivalence to Forney's rule
IEEE Transactions on Information Theory
Random coding techniques for nonrandom codes
IEEE Transactions on Information Theory
Variations on the Gallager bounds, connections, and applications
IEEE Transactions on Information Theory
Asymptotic enumeration methods for analyzing LDPC codes
IEEE Transactions on Information Theory
Improved error bounds for the erasure/list scheme: the binary and spherical cases
IEEE Transactions on Information Theory
Improved Analysis of List Decoding and Its Application to Convolutional Codes and Turbo Codes
IEEE Transactions on Information Theory
On the Error Exponents of ARQ Channels With Deadlines
IEEE Transactions on Information Theory
An Improved Bound on the List Error Probability and List Distance Properties
IEEE Transactions on Information Theory
An Improved Sphere-Packing Bound for Finite-Length Codes Over Symmetric Memoryless Channels
IEEE Transactions on Information Theory
Error Exponents of Erasure/List Decoding Revisited Via Moments of Distance Enumerators
IEEE Transactions on Information Theory
| Hi-index | 754.84 |
A message independence property and some new performance upper bounds are derived in this work for erasure, list, and decision-feedback schemes with linear block codes transmitted over memoryless symmetric channels. Similar to the classical work of Forney, this work is focused on the derivation of some Gallager-type bounds on the achievable tradeoffs for these coding schemes, where the main novelty is the suitability of the bounds for both random and structured linear block codes (or code ensembles). The bounds are applicable to finite-length codes and to the asymptotic case of infinite block length, and they are applied to low-density parity-check code ensembles.