Asymptotic average redundancy of Huffman (and other) block codes

DOI10.1109/18.887856zbMath1003.94023OpenAlexW2109635309MaRDI QIDQ2705977

Wojciech Szpankowski

Publication date: 19 March 2001

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

Full work available at URL: https://doi.org/10.1109/18.887856

zbMATH Keywords

Fourier seriesredundancyHuffman codedistribution of sequences modulo 1Golomb codememoryless binary sourceShannon block codevariable-length source coding

Mathematics Subject Classification ID

Numerical methods for discrete and fast Fourier transforms (65T50) General theory of distribution modulo (1) (11K06) Prefix, length-variable, comma-free codes (94A45) Coding theorems (Shannon theory) (94A24) Source coding (94A29)

Related Items (1)

Unnamed Item

This page was built for publication: Asymptotic average redundancy of Huffman (and other) block codes