$\epsilon$-Capacity of Binary Symmetric Averaged Channels

DOI10.1109/TIT.2006.887087zbMATH Open1310.94067MaRDI QIDQ3548827

John Cronan Kieffer

Publication date: 21 December 2008

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

Mathematics Subject Classification ID

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

Related Items (2)

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

Recommendations

• Channel capacities via \( p\)-summing norms 👍 👎
• Bounds on E-capacity of a channel with a random parameter 👍 👎
• Asymptotics of input-constrained binary symmetric channel capacity 👍 👎
• Asymptotics of Input-Constrained Erasure Channel Capacity 👍 👎
• A Lower Bound on the Essential Interactive Capacity of Binary Memoryless Symmetric Channels 👍 👎
• Capacity Bounds for Additive Symmetric $\alpha $ -Stable Noise Channels 👍 👎
• The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet 👍 👎
• The weak capacity of averaged channels 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

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)