On the coding theorem and its converse for finite-memory channels
From MaRDI portal
Recommendations
- On the converse to the coding theorem for discrete memoryless channels (Corresp.)
- Coding Theorem and Converse for Abstract Channels With Time Structure and Memory
- scientific article; zbMATH DE number 3175621
- A direct proof of the coding theorem for discrete sources with memory
- scientific article; zbMATH DE number 910966
- A converse coding theorem for mismatched decoding at the output of binary-input memoryless channels
- Random coding bounds for discrete memoryless channels
- Random coding theorems for the general discrete memoryless broadcast channel
- A note on coding theorems of information theory
- scientific article; zbMATH DE number 4039791
Cited in
(14)- Simultaneous channels
- Representations and extremal properties of averaging operators and their applications to information shannels
- scientific article; zbMATH DE number 3143971 (Why is no real title available?)
- The Minimum Average Code for Finite Memoryless Monotone Sources
- A direct proof of the coding theorem for discrete sources with memory
- scientific article; zbMATH DE number 3557671 (Why is no real title available?)
- Converse Theorems for the DMC With Mismatched Decoding
- A functional method for stationary channels
- An application of rate-distortion theory to a converse to the coding theorem
- scientific article; zbMATH DE number 3321830 (Why is no real title available?)
- The weak capacity of averaged channels
- Coding theorem and its converse for continuous incrementally stationary channels with finite incremental memory (Corresp.)
- Die Kapazit�t der periodischen Kan�le
- Markov capacity for factor codes with an unambiguous symbol
This page was built for publication: On the coding theorem and its converse for finite-memory channels
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5895783)
