A simple derivation of the coding theorem and some applications
From MaRDI portal
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
Cited in
(54)- On some upper bounds for the probability of error
- The role of duality in optimization problems involving entropy functionals with applications to information theory
- A coding theorem for multiple access channels using a maximum likelihood list decoding scheme
- Coding theorem for partial received information
- Exponential error bounds for an erasure scheme for partial received information
- A simpler proof of Jensen's coding theorem
- A note on random coding bounds for classical-quantum channels
- An isoperimetric theorem for sequences generated by feedback and feedback-codes for unequal error protection
- Properties of noncommutative Rényi and Augustin information
- The Augustin capacity and center
- The sphere packing bound for memoryless channels
- Second-order asymptotics for the classical capacity of image-additive quantum channels
- Sharpening of an upper bound for the reliability function of a binary symmetric channel
- On the complexity of suboptimal decoding for list and decision feedback schemes
- Coding Theory: A General Framework and Two Inverse Problems
- STATE ESTIMATION FOR GENERAL DYNAMIC SYSTEMS WITH NONLINEAR INTERFERENCE AND MISSING OBSERVATIONS∗
- On the BSC reliability function: expanding the region where it is known exactly
- Error Exponents for Variable-Length Block Codes With Feedback and Cost Constraints
- Optimum decoding-based smoothing algorithm for dynamic systems
- Optimum decoding based smoothing algorithm for dynamic systems with interference
- scientific article; zbMATH DE number 3937097 (Why is no real title available?)
- A stack sequential decoding based smoothing algorithm for dynamic systems
- A stack sequential decoding-based smoothing algorithm for dynamic systems with interference
- A suboptimum decoding-based smoothing algorithm for dynamic systems with or without interference
- ON SOME INEQUALITIES AND GENERALIZED ENTROPIES: A UNIFIED APPROAC
- Multidimensional state estimation with blocks and Viterbi decoding algorithms
- Fast state estimation scheme for multidimensional dynamic systems
- Non-linear smoothing algorithm for multi-dimensional dynamic systems
- scientific article; zbMATH DE number 3685390 (Why is no real title available?)
- STATE ESTIMATION WITH STACKS AND INTERPOLATING FUNCTIONS FOR DYNAMIC SYSTEMS WITH MISSING OBSERVATIONS AND NONLINEAR INTERFERENCE*
- scientific article; zbMATH DE number 3525027 (Why is no real title available?)
- A simple derivation of the lower bound to<tex>R_{mbox{comp}}</tex>for discrete memoryless channels (Corresp.)
- On the reliability function for a BSC with noisy feedback
- On Future-Dependent Block Coding for Input-Restricted Channels
- Multi-dimensional state smoothing in the presence of non-linear interference
- scientific article; zbMATH DE number 4121928 (Why is no real title available?)
- A simple derivation of the refined sphere packing bound under certain symmetry hypotheses
- Non-linear state smoothing for discrete dynamic systems with past histories
- An application of rate-distortion theory to a converse to the coding theorem
- Coding theorems for the nonsynchronized channel
- Error estimates for low rate codes
- The strong converse theorem in the decoding scheme of list size L
- Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.)
- Block codes for a class of constrained noiseless channels
- Lower bounds to error probability for coding on discrete memoryless channels. I
- Reed-Muller Codes
- Variations on the Gallager bounds with some applications
- Unsourced random access
- A toolbox for refined information-theoretic analyses
- An upper bound on error probability in communication systems with single-user reception based on order statistics
- Multidimensional state estimation using stacks for dynamic systems with interference
- State estimation for nonlinear discrete dynamic systems with missing observations
- 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
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)
