channel-capacity — Claude Code skill: information theory
A skill for solving information-theory problems: calculating channel capacity, mutual information, and applying the Blahut-Arimoto algorithm. Use it when working with information theory, coding, or communication channels.
MIT ★ 3,951 updated 2026-01-26
npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a claude-codeWhat channel-capacity does
The skill provides a structured approach to channel-capacity problems. It includes formulas for mutual information I(X;Y), the definition of channel capacity as maximization over input distribution, and ready formulas for standard channels: binary symmetric (BSC), binary erasure (BEC), and AWGN.
Three tools are included: Scipy_Mutual_Info computes entropy via scipy, Sympy_Bsc_Capacity simplifies BSC expressions using SymPy, and Z3_Capacity_Bound proves upper bounds with an SMT solver. The Blahut-Arimoto algorithm iteratively finds the distribution that achieves channel capacity.
Requires Python, scipy, sympy, and z3; tools run through uv run in your project.
What it helps with
- compute mutual information between channel input and output
- find channel capacity for a given transition matrix
- calculate capacity of a binary symmetric or erasure channel
- apply the Blahut-Arimoto algorithm to a specific channel
- prove upper bounds on channel capacity
Example prompts for the agent
- Calculate mutual information for inputs [0.5, 0.5] and outputs [0.6, 0.4]
- Find capacity of a binary symmetric channel with error probability 0.1
- Run Blahut-Arimoto on the transition matrix and report the capacity
How to install channel-capacity
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a claude-code2Manually: put the files in place
~/.claude/skills/channel-capacity/SKILL.mdCopy the whole skill folder; for one project use .claude/skills/channel-capacity/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a codex2Manually: put the files in place
.agents/skills/channel-capacity/SKILL.mdFor all projects use ~/.agents/skills/
1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a cursor2Manually: put the files in place
.cursor/skills/channel-capacity/SKILL.mdCursor also reads .agents/skills/ and .claude/skills/
1GitHub CLI
gh skill install parcadei/Continuous-Claude-v3 .claude/skills/math/information-theory/channel-capacity2Manually: put the files in place
.github/skills/channel-capacity/SKILL.md1Skills CLI (Vercel)
npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a gemini-cli2Platform CLI
gemini skills install https://github.com/parcadei/Continuous-Claude-v3 --path .claude/skills/math/information-theory/channel-capacityManually: put the files in place
.devin/skills/channel-capacity/SKILL.mdThe legacy .windsurf/skills/ path still works
Claude.ai
Zip the folder and upload it in Settings → Capabilities → Skills
Step by step, with commands for each platform: How to install skills in Claude Code: five ways
Questions about channel-capacity
How do I install channel-capacity in Claude Code?
Run npx skills add parcadei/Continuous-Claude-v3 --skill channel-capacity -a claude-code, then load the documentation from ~/.claude/skills/channel-capacity/SKILL.md.
What does the channel-capacity skill do?
It provides methods for calculating channel capacity: formulas for mutual information, closed-form results for standard channels (BSC, BEC, AWGN), and Python tools for numerical computation and formal proofs.
What dependencies are required?
Python with scipy, sympy, and z3; tools are invoked via uv run.
Source text
SKILL.md · MIT
---
name: channel-capacity
description: "Problem-solving strategies for channel capacity in information theory"
allowed-tools: [Bash, Read]
---
# Channel Capacity
## When to Use
Use this skill when working on channel-capacity problems in information theory.
## Decision Tree
1. **Mutual Information**
- I(X;Y) = H(X) + H(Y) - H(X,Y)
- I(X;Y) = H(X) - H(X|Y) = H(Y) - H(Y|X)
- Symmetric: I(X;Y) = I(Y;X)
- `scipy.stats.entropy(p) + scipy.stats.entropy(q) - joint_entropy`
2. **Channel Model**
- Input X, output Y, channel P(Y|X)
- Channel matrix: rows = inputs, columns = outputs
- Element (i,j) = P(Y=j | X=i)
3. **Channel Capacity**
- C = max_{p(x)} I(X;Y)
- Maximize over input distribution
- Achieved by capacity-achieving distribution
4. **Common Channels**
| Channel | Capacity |
|---------|----------|
| Binary Symmetric (BSC) | 1 - H(p) where p = crossover prob |
| Binary Erasure (BEC) | 1 - epsilon where epsilon = erasure prob |
| AWGN | 0.5 * log2(1 + SNR) |
5. **Blahut-Arimoto Algorithm**
- Iterative algorithm to compute capacity
- Alternates between optimizing p(x) and p(y|x)
- Converges to capacity
- `z3_solve.py prove "capacity_upper_bound"`
## Tool Commands
### Scipy_Mutual_Info
```bash
uv run python -c "from scipy.stats import entropy; p = [0.5, 0.5]; q = [0.6, 0.4]; H_X = entropy(p, base=2); H_Y = entropy(q, base=2); print('H(X)=', H_X, 'H(Y)=', H_Y)"
```
### Sympy_Bsc_Capacity
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "1 + p*log(p, 2) + (1-p)*log(1-p, 2)"
```
### Z3_Capacity_Bound
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "I(X;Y) <= H(X)"
```
## Key Techniques
*From indexed textbooks:*
- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover & Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. Using a randomly generated code, Shannon showed that one can send information at any rate below the capacity *C* of the channel with an arbitrarily low probability of error. The idea of a randomly generated code is very unusual.
## Cognitive Tools Reference
See `.claude/skills/math-mode/SKILL.md` for full tool documentation.
© parcadei · MIT · parcadei/Continuous-Claude-v3