A simple derivation of the coding theorem and some applications
From MaRDI portal
Publication:5510063
DOI10.1109/TIT.1965.1053730zbMath0137.13502DBLPjournals/tit/Gallager65WikidataQ99527324 ScholiaQ99527324MaRDI QIDQ5510063
Publication date: 1965
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
upper boundsblock codeserror probabilitybinary symmetric channeladditive Gaussian noise channelamplitude-continuous channelsamplitude-discrete channelstime-discrete memoryless channels
Bounds on codes (94B65) Error probability in coding theory (94B70) Channel models (including quantum) in information and communication theory (94A40) Coding theorems (Shannon theory) (94A24)
Related Items (37)
Unnamed Item ⋮ An upper bound on error probability in communication systems with single-user reception based on order statistics ⋮ Optimum decoding based smoothing algorithm for dynamic systems with interference ⋮ A stack sequential decoding based smoothing algorithm for dynamic systems ⋮ STATE ESTIMATION WITH STACKS AND INTERPOLATING FUNCTIONS FOR DYNAMIC SYSTEMS WITH MISSING OBSERVATIONS AND NONLINEAR INTERFERENCE* ⋮ The role of duality in optimization problems involving entropy functionals with applications to information theory ⋮ A stack sequential decoding-based smoothing algorithm for dynamic systems with interference ⋮ On the BSC reliability function: expanding the region where it is known exactly ⋮ A suboptimum decoding-based smoothing algorithm for dynamic systems with or without interference ⋮ ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC ⋮ Error estimates for low rate codes ⋮ The strong converse theorem in the decoding scheme of list size $L$ ⋮ STATE ESTIMATION FOR GENERAL DYNAMIC SYSTEMS WITH NONLINEAR INTERFERENCE AND MISSING OBSERVATIONS∗ ⋮ A coding theorem for multiple access channels using a maximum likelihood list decoding scheme ⋮ The Augustin capacity and center ⋮ On the reliability function for a BSC with noisy feedback ⋮ Coding theorem for partial received information ⋮ Exponential error bounds for an erasure scheme for partial received information ⋮ Multidimensional state estimation with blocks and Viterbi decoding algorithms ⋮ Sharpening of an upper bound for the reliability function of a binary symmetric channel ⋮ Multidimensional state estimation using stacks for dynamic systems with interference ⋮ State estimation for nonlinear discrete dynamic systems with missing observations ⋮ The sphere packing bound for memoryless channels ⋮ Finite state machines in state estimation for dynamic systems with and \(n\)th order memory and nonlinear interference ⋮ State estimation via limited capacity noisy communication channels ⋮ Fast state estimation scheme for multidimensional dynamic systems ⋮ Non-linear smoothing algorithm for multi-dimensional dynamic systems ⋮ A note on random coding bounds for classical-quantum channels ⋮ On the complexity of suboptimal decoding for list and decision feedback schemes ⋮ Variations on the Gallager bounds with some applications ⋮ Non-linear state smoothing for discrete dynamic systems with past histories ⋮ A simple derivation of the refined sphere packing bound under certain symmetry hypotheses ⋮ Multi-dimensional state smoothing in the presence of non-linear interference ⋮ Reed-Muller Codes ⋮ Properties of noncommutative Rényi and Augustin information ⋮ Second-order asymptotics for the classical capacity of image-additive quantum channels ⋮ Optimum decoding-based smoothing algorithm for dynamic systems
This page was built for publication: A simple derivation of the coding theorem and some applications
