Universal Lossless Compression With Unknown Alphabets—The Average Case

DOI10.1109/TIT.2006.883609zbMath1320.94042arXivcs/0603068OpenAlexW2105570447MaRDI QIDQ3547949

Gil I. Shamir

Publication date: 21 December 2008

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

Full work available at URL: https://arxiv.org/abs/cs/0603068

Mathematics Subject Classification ID

Combinatorial probability (60C05) Coding theorems (Shannon theory) (94A24)

Related Items (2)

A lower-bound for the maximin redundancy in pattern coding ⋮ A lower bound on compression of unknown alphabets

This page was built for publication: Universal Lossless Compression With Unknown Alphabets—The Average Case