Universal Entropy Estimation Via Block Sorting

DOI10.1109/TIT.2004.830771MaRDI QIDQ3546634zbMATH OpenFDO

Authors Haixiao Cai, Sanjeev R. Kulkarni, Sergio Verdú

Publication date 21 December 2008

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

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

zbMATH Keywords

Block sortingBurrows-Wheeler transform (BWT)entropy estimationpiecewise stationary memoryless sourcetree source

Mathematics Subject Classification ID

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

Recommendations

• Universal lossless source coding with the Burrows Wheeler transform
• Universal Divergence Estimation for Finite-Alphabet Sources
• scientific article; zbMATH DE number 1305460
• On the performance of recency-rank and block-sorting universal lossless data compression algorithms
• An analysis of the Burrows-Wheeler transform

Cited in

(8)

• Sublinear algorithms for approximating string compressibility
• Relative entropy via non-sequential recursive pair substitution
• Universal Divergence Estimation for Finite-Alphabet Sources
• Bounds from a card trick
• Estimating the directed information to infer causal relationships in ensemble neural spike train recordings
• BIAS REDUCTION OF THE NEAREST NEIGHBOR ENTROPY ESTIMATOR
• The Burrows-Wheeler transform between data compression and combinatorics on words
• Posterior representations for Bayesian context trees: sampling, estimation and convergence

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3546634)