Channel Capacity and the Coding Theorem
0/99 solved1 / 99
Each question is graded on a single answer: a check that this chapter's methods work, not a test of the reasoning behind them.
A noiseless channel copies its input exactly and has input alphabet size . What is its capacity in bits per channel use?
Your answer
info-channel-capacity-9All Information Theory chaptersAbout these 99 questions
How much a noisy channel can carry, the proof that the rate is achievable, and why feedback does not raise it. This set covers the chapter Channel Capacity and the Coding Theorem in Information Theory: 30 easy, 44 medium and 25 hard questions, each graded instantly with a hint and a full step-by-step solution. Progress is saved in this browser only.
- Discrete Memoryless Channels and Capacity — 11 questions
- The Binary Symmetric Channel — 11 questions
- Gaussian Channels and the Shannon Limit — 11 questions
- The Coding Theorem: Statement and Consequences — 11 questions
- Achievability: Random Coding and Joint Typicality — 11 questions
- The Converse and Fano's Inequality — 11 questions
- Feedback Does Not Increase Capacity — 11 questions
- Automatic Repeat Request — 11 questions
- Variable-Length Coding with Feedback — 11 questions