Universal Entropy Estimation Via Block Sorting

DOI10.1109/TIT.2004.830771zbMath1284.94035MaRDI QIDQ3546634

Sanjeev R. Kulkarni, Haixiao Cai, Sergio Verdú

Publication date: 21 December 2008

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

zbMATH Keywords

entropy estimationBlock sortingBurrows-Wheeler transform (BWT)piecewise stationary memoryless sourcetree source

Mathematics Subject Classification ID

Measures of information, entropy (94A17) Coding theorems (Shannon theory) (94A24)

Related Items (6)

Sublinear algorithms for approximating string compressibility ⋮ BIAS REDUCTION OF THE NEAREST NEIGHBOR ENTROPY ESTIMATOR ⋮ The Burrows-Wheeler Transform between Data Compression and Combinatorics on Words ⋮ Bounds from a card trick ⋮ Relative entropy via non-sequential recursive pair substitution ⋮ Unnamed Item

This page was built for publication: Universal Entropy Estimation Via Block Sorting