\epsilon-Capacity of Binary Symmetric Averaged Channels

DOI10.1109/TIT.2006.887087MaRDI QIDQ3548827zbMATHFDO

Authors John C. Kieffer

Publication date 21 December 2008

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

Mathematics Subject Classification ID

Coding theorems (Shannon theory) (94A24) Channel models (including quantum) in information and communication theory (94A40)

Recommendations

• Asymptotics of input-constrained binary symmetric channel capacity
• The weak capacity of averaged channels
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet
• Asymptotics of Input-Constrained Erasure Channel Capacity
• A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels
• Bounds on E-capacity of a channel with a random parameter
• Channel capacities via \( p\)-summing norms
• Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels
• scientific article; zbMATH DE number 4057435
• scientific article; zbMATH DE number 3453478

Cited in

(2)

• Asymptotics of input-constrained binary symmetric channel capacity
• Symmetric Shannon capacity is the independence number minus 1

This page was built for publication: $\epsilon$-Capacity of Binary Symmetric Averaged Channels

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