A simple derivation of the coding theorem and some applications

DOI10.1109/TIT.1965.1053730zbMATH Open0137.13502DBLPjournals/tit/Gallager65WikidataQ99527324 ScholiaQ99527324MaRDI QIDQ5510063FDOQ5510063

Authors: Robert G. Gallager 

Publication date: 1965

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3240100
• Simple methods for deriving lower bounds the theory of codes
• A Coding-Theoretic Application of Baranyai’s Theorem
• A note on coding theorems of information theory
• scientific article; zbMATH DE number 4193602
• A simpler proof of Jensen's coding theorem
• scientific article; zbMATH DE number 4216751
• Some Applications of Coding Theory in Computational Complexity
• scientific article; zbMATH DE number 1803256
• An application of rate-distortion theory to a converse to the coding theorem

zbMATH Keywords

error probabilityupper boundsbinary symmetric channelblock codesadditive Gaussian noise channelamplitude-continuous channelsamplitude-discrete channelstime-discrete memoryless channels

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Bounds on codes (94B65) Channel models (including quantum) in information and communication theory (94A40) Error probability in coding theory (94B70)

Cited In (52)

• The sphere packing bound for memoryless channels
• Title not available (Why is that?)
• An upper bound on error probability in communication systems with single-user reception based on order statistics
• ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC
• Coding theorems for the nonsynchronized channel
• The strong converse theorem in the decoding scheme of list size $L$
• The Augustin capacity and center
• A note on random coding bounds for classical-quantum channels
• On the reliability function for a BSC with noisy feedback
• A suboptimum decoding-based smoothing algorithm for dynamic systems with or without interference
• STATE ESTIMATION FOR GENERAL DYNAMIC SYSTEMS WITH NONLINEAR INTERFERENCE AND MISSING OBSERVATIONS∗
• Title not available (Why is that?)
• Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.)
• Optimum decoding-based smoothing algorithm for dynamic systems
• A stack sequential decoding-based smoothing algorithm for dynamic systems with interference
• Fast state estimation scheme for multidimensional dynamic systems
• Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints
• STATE ESTIMATION WITH STACKS AND INTERPOLATING FUNCTIONS FOR DYNAMIC SYSTEMS WITH MISSING OBSERVATIONS AND NONLINEAR INTERFERENCE*
• A stack sequential decoding based smoothing algorithm for dynamic systems
• Optimum decoding based smoothing algorithm for dynamic systems with interference
• Coding theorem for partial received information
• 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.)
• Multi-dimensional state smoothing in the presence of non-linear interference
• Exponential error bounds for an erasure scheme for partial received information
• The role of duality in optimization problems involving entropy functionals with applications to information theory
• Variations on the Gallager bounds with some applications
• On the complexity of suboptimal decoding for list and decision feedback schemes
• 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
• Block codes for a class of constrained noiseless channels
• Lower bounds to error probability for coding on discrete memoryless channels. I
• Reed-Muller Codes
• Title not available (Why is that?)
• Error estimates for low rate codes
• State estimation via limited capacity noisy communication channels
• Multidimensional state estimation using stacks for dynamic systems with interference
• State estimation for nonlinear discrete dynamic systems with missing observations
• Multidimensional state estimation with blocks and Viterbi decoding algorithms
• A simpler proof of Jensen's coding theorem
• Coding Theory: A General Framework and Two Inverse Problems
• On some upper bounds for the probability of error
• On Future-Dependent Block Coding for Input-Restricted Channels
• An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection
• Finite state machines in state estimation for dynamic systems with and \(n\)th order memory and nonlinear interference
• Second-order asymptotics for the classical capacity of image-additive quantum channels
• An application of rate-distortion theory to a converse to the coding theorem
• Non-linear state smoothing for discrete dynamic systems with past histories
• Non-linear smoothing algorithm for multi-dimensional dynamic systems
• Title not available (Why is that?)
• Properties of noncommutative Rényi and Augustin information
• Sharpening of an upper bound for the reliability function of a binary symmetric channel

This page was built for publication: A simple derivation of the coding theorem and some applications

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