FIND ME ON

GitHub

LinkedIn

Max Redundancy on KT

🌱

Theorem
InfoTheory

Corollary

Let P\mathcal{P} denote the class of iid sources on X\mathcal{X}. If Cn\mathcal{C}_{n} is the arithmetic code for KT distribution on Xn\mathcal{X}^{n}, then its redundancy satisfies: max⁔p∈PR(Cn,p)≤māˆ’1log⁔n2n+O(1n)\max_{p\in\mathcal{P}}R(\mathcal{C}_{n},p)\le \frac{m-1\log n}{2n}+O\left( \frac{1}{n} \right)This implies that KT coding distribution is minimax optimal.