Lower bounds to error probability for coding on discrete memoryless channels. I

DOI10.1016/S0019-9958(67)90052-6zbMATH Open0245.94007OpenAlexW3190595840WikidataQ57310937 ScholiaQ57310937MaRDI QIDQ5657992FDOQ5657992

Robert G. Gallager, Claude Shannon, Elwyn R. Berlekamp

Publication date: 1967

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(67)90052-6

Recommendations

• A simple derivation of the coding theorem and some applications
• Lower bound for error probability in a discrete memoryless channel with feedback
• Error estimates for low rate codes
• [[:Publication:5530194|Title not available (Why is that?)]]
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Cited In (57)

• The sphere packing bound for memoryless channels
• Noiseless coding of error detection information (Corresp.)
• Entropy inequalities for discrete channels
• Title not available (Why is that?)
• Title not available (Why is that?)
• Entanglement can increase asymptotic rates of zero-error classical communication over classical channels
• Coding theorems for the nonsynchronized channel
• The strong converse theorem in the decoding scheme of list size $L$
• Obituary: Claude Elwood Shannon 1916-2001
• On the reliability function for a BSC with noisy feedback
• Title not available (Why is that?)
• List decodability at small radii
• Notes on the asymptotic behavior of the information rate of block codes (Corresp.)
• Decentralized detection by a large number of sensors
• Code spectrum and the reliability function: Gaussian channel
• Chernoff bounds for discriminating between two markov processes
• The exponent of error probability in various modulation and coding systems
• Error exponents for two-hop Gaussian multiple source-destination relay channels
• Constructive codes for arbitrary discrete memoryless channels
• A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
• A simple derivation of the lower bound to<tex>R_{mbox{comp}}</tex>for discrete memoryless channels (Corresp.)
• Lower bound for ensemble-average error probability for a discrete memoryless channel
• Lower bounds for the cardinality of error-correcting codes in channels with multiple access
• Capacity and a lower bound to<tex>R_{mbox{comp}}</tex>for a channel with symbol fission
• On the BSC reliability function: expanding the region where it is known exactly
• A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
• Title not available (Why is that?)
• Code spectrum and the reliability function: binary symmetric channel
• Random coding bounds for discrete memoryless channels
• Reed-Muller Codes
• A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels
• Error estimates for low rate codes
• Erratum to: ``Bounds on the rate of disjunctive codes
• On the converse to the coding theorem for discrete memoryless channels (Corresp.)
• Source and channel rate allocation for channel codes satisfying the Gilbert-Varshamov or Tsfasman-Vlăduţ-Zink bounds
• The Minimum Average Code for Finite Memoryless Monotone Sources
• Second-order converses via reverse hypercontractivity
• On the capacity of channels with block memory
• Rate optimal Chernoff bound and application to community detection in the stochastic block models
• Bounds on the achievable rates of block coding for a memoryless multiple-access channel
• Lower bound for error probability in a discrete memoryless channel with feedback
• Very noisy channels, reliability functions, and exponentially optimum codes
• Diagnostische Vorgabeexperimente mit stochastischen Automaten. (Diagnosing preset experiments with stochastic automata)
• Random-coding bounds for some broadcast channels
• Title not available (Why is that?)
• Coding in a channel with generalized defects and random errors
• A new lower bound for the a-mean error of parameter transmission over the white Gaussian channel
• Title not available (Why is that?)
• Reliability function of a discrete memoryless channel at rates above capacity (Corresp.)
• Quantum \(f\)-divergences via Nussbaum-Szkoła distributions and applications to \(f\)-divergence inequalities
• Title not available (Why is that?)
• Title not available (Why is that?)
• Properties of noncommutative Rényi and Augustin information
• An upper bound on the cutoff rate of sequential decoding
• Title not available (Why is that?)
• Optimal sampling of independent increment processes
• Sharpening of an upper bound for the reliability function of a binary symmetric channel

This page was built for publication: Lower bounds to error probability for coding on discrete memoryless channels. I

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5657992)