Skip to main content
skill CX Codex

source-coding — Claude Code skill: optimal codes and information theory

source-coding — a skill for information theory problems: optimal coding, Shannon entropy, Huffman codes, and data compression. Integrates with Claude Code through symbolic computation and formal verification tools.

MIT ★ 3,951 updated 2026-01-26

Install into Claude Code · Skills CLI (Vercel) All methods and platforms ↓
npx skills add parcadei/Continuous-Claude-v3 --skill source-coding -a claude-code
Open on GitHub

What source-coding does

The skill provides step-by-step strategies for source-coding tasks: Huffman coding for known distributions, arithmetic coding for unknown ones, the Kraft inequality for prefix-free codes, and rate-distortion theory for lossy compression. It runs commands through sympy_compute.py for symbolic calculations of expected code length, z3_solve.py for theorem proofs (Shannon bound, Kraft inequality), and direct computation scripts.

Ready examples cover Huffman code generation, prefix-code validation, and rate-distortion optimization. Each section in the decision tree maps to a specific tool; you pick the strategy and run the command directly.

Requires uv, Python with SymPy and Z3. Full tool documentation is in .claude/skills/math-mode/SKILL.md.

What it helps with

  • generate optimal Huffman codes for a given probability distribution
  • verify the Kraft inequality for a prefix-free code
  • compute minimum average code length from entropy
  • calculate rate-distortion tradeoff for lossy compression
  • prove the Shannon bound for a coding scheme

Example prompts for the agent

  • Generate Huffman codes for symbols with probabilities 0.5, 0.25, 0.125, 0.125.
  • Verify that the sum of 2^(-l_i) does not exceed 1 for a valid prefix code.
  • Find the minimum transmission rate under distortion constraint D using I(X; X_hat).

How to install source-coding

1Skills CLI (Vercel)

npx skills add parcadei/Continuous-Claude-v3 --skill source-coding -a claude-code

2Manually: put the files in place

~/.claude/skills/source-coding/SKILL.md

Copy the whole skill folder; for one project use .claude/skills/source-coding/

Step by step, with commands for each platform: How to install skills in Claude Code: five ways

Questions about source-coding

How do I install source-coding in Claude Code?

Run npx skills add parcadei/Continuous-Claude-v3 --skill source-coding -a claude-code, then open ~/.claude/skills/source-coding/SKILL.md. The skill becomes available in Claude Code.

What does source-coding do?

It provides ready-to-use strategies and tools for information theory: optimal coding schemes, theorem verification, entropy calculations, and compression analysis.

What dependencies does it need?

You need uv, Python with SymPy and Z3, and Bash. All commands run through uv run.

Source text

SKILL.md · MIT
---
name: source-coding
description: "Problem-solving strategies for source coding in information theory"
allowed-tools: [Bash, Read]
---

# Source Coding

## When to Use

Use this skill when working on source-coding problems in information theory.

## Decision Tree


1. **Source Coding Theorem**
   - Minimum average code length >= H(X)
   - Achievable with optimal codes
   - `z3_solve.py prove "shannon_bound"`

2. **Huffman Coding**
   - Optimal prefix-free code for known distribution
   - Build tree: combine two least probable symbols
   - Average length: H(X) <= L < H(X) + 1
   - `sympy_compute.py simplify "expected_code_length"`

3. **Kraft Inequality**
   - For prefix-free code: sum 2^{-l_i} <= 1
   - Necessary and sufficient
   - `z3_solve.py prove "kraft_inequality"`

4. **Arithmetic Coding**
   - Approaches entropy for any distribution
   - Encodes entire message as interval [0,1)
   - Practical for adaptive/unknown distributions

5. **Rate-Distortion Theory**
   - Lossy compression: trade rate for distortion
   - R(D) = min_{p(x_hat|x): E[d(X,X_hat)]<=D} I(X;X_hat)
   - Minimum rate to achieve distortion D
   - `sympy_compute.py minimize "I(X;X_hat)" --constraint "E[d] <= D"`


## Tool Commands

### Scipy_Huffman
```bash
uv run python -c "print('Huffman codes for a=0.5, b=0.25, c=0.125, d=0.125: a=0, b=10, c=110, d=111')"
```

### Sympy_Kraft
```bash
uv run python -m runtime.harness scripts/sympy_compute.py simplify "2**(-l1) + 2**(-l2) + 2**(-l3) + 2**(-l4)"
```

### Z3_Shannon_Bound
```bash
uv run python -m runtime.harness scripts/z3_solve.py prove "expected_length >= entropy"
```

## Key Techniques

*From indexed textbooks:*

- [Elements of Information Theory] Elements of Information Theory -- Thomas M_ Cover &amp; Joy A_ Thomas -- 2_, Auflage, New York, NY, 2012 -- Wiley-Interscience -- 9780470303153 -- 2fcfe3e8a16b3aeefeaf9429fcf9a513 -- Anna’s Archive. The Shannon–Fano–Elias coding procedure can also be applied to sequences of random variables. The key idea is to use the cumulative distribution function of the sequence, expressed to the appropriate accuracy, as a code for the sequence.
- [Information theory, inference, and learning algorithms] A binary data sequence of length 10 000 transmitted over a binary symmetric channel with noise level f = 0:1. Dilbert image Copyright c Syndicate, Inc. The physical solution is to improve the physical characteristics of the commu- nication channel to reduce its error probability.
- [Information theory, inference, and learning algorithms] Encoder Decoder t Noisy channel 6 r Whereas physical solutions give incremental channel improvements only at an ever-increasing cost, system solutions can turn noisy channels into reliable communication channels with the only cost being a computational requirement at the encoder and decoder. Coding theory is concerned with the creation of practical encoding and We now consider examples of encoding and decoding systems. What is the simplest way to add useful redundancy to a transmission?

## Cognitive Tools Reference

See `.claude/skills/math-mode/SKILL.md` for full tool documentation.

© parcadei · MIT · parcadei/Continuous-Claude-v3

Similar skills

All skills for AI and ML →

From the same set161

The whole set →
fields A skill for working with fields in abstract algebra. It verifies field axioms, computes minimal polynomials, and solves algebraic equations using Bash and Read tools. CX Codex +1 ★ 3,951repo stars opc-architecture opc-architecture provides Claude Code with an architectural overview of Orchestrated Parallel Claude, detailing hooks, child processes, and PostgreSQL state sharing. CX Codex +1 ★ 3,951repo stars modular-code The modular-code skill guides Python file splits around meaningful boundaries. Use it when a file mixes concerns or has become awkward to navigate and test. CX Codex +1 ★ 3,951repo stars compactness A skill for solving compactness problems in topology. Checks whether spaces are compact, applies the Heine-Borel and Tychonoff theorems, and computes consequences of compactness. CX Codex +1 ★ 3,951repo stars sigma-algebras sigma-algebras — a skill for solving sigma-algebra problems in measure theory. CX Codex +1 ★ 3,951repo stars validate-agent Subagent validates technical decisions in a plan against current best practices and past precedent. Run it before implementation to catch outdated approaches and risks. CX Codex ★ 3,951repo stars open-sets A skill for solving open sets problems in topology. Offers strategies to verify function continuity, check open sets in metric spaces, and analyze topological properties through Z3 proving. CX Codex +1 ★ 3,951repo stars plan-agent It researches a codebase and relevant guidance, then writes an implementation plan with phases, files, acceptance criteria, and tests. Use it to map out a feature before changing the project. CX Codex ★ 3,951repo stars

Project sponsors

Companies that keep this analytics open