Universal estimation of entropy and divergence via block sorting

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 433-

  Cai, Haixiao ^a   Kulkarni, Sanjeev R ^a   Verdú, Sergio ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK SORTING;

DATA COMPRESSION; ENTROPY; ESTIMATION; MARKOV PROCESSES; PROBABILITY; SORTING;

ENCODING (SYMBOLS);

EID: 0036351999     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (3)

1. Universal loss-less source coding with the burrows wheeler transform
2. Asymptotically optimal low-complexity sequential loss-less coding for piecewise-stationary memoryless sources - Part I: The regular case
3. A measure of relative entropy between individual sequences with application to universal classification