Pages that link to "Item:Q1168948"
From MaRDI portal
The following pages link to Random coding bounds for discrete memoryless channels (Q1168948):
Displaying 13 items.
- Random-coding bounds for some broadcast channels (Q1057834) (← links)
- The Augustin capacity and center (Q2190923) (← links)
- The sphere packing bound for memoryless channels (Q2211175) (← links)
- Bounds on the rate of disjunctive codes (Q2262991) (← links)
- Random coding bound for \(E\)-capacity of DMC with stochastic encoding (Q2907832) (← links)
- The Minimum Average Code for Finite Memoryless Monotone Sources (Q3548216) (← links)
- A direct proof of the coding theorem for discrete sources with memory (Q4066984) (← links)
- On the method of random coding (Q4522827) (← links)
- Transmission of a Bit Over a Discrete Poisson Channel With Memory (Q5001821) (← links)
- A Tight Upper Bound for the Third-Order Asymptotics for Most Discrete Memoryless Channels (Q5346239) (← links)
- On the capacity of a cascade of identical discrete memoryless nonsingular channels (Corresp.) (Q5578204) (← links)
- On the coding theorem and its converse for finite-memory channels (Q5895783) (← links)
- Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources (Q6139507) (← links)