On tries, suffix trees, and universal Variable-Length-to-Block codes

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2002, Pages 123-

  Reznik, Yuriy A ^a  

^a RealNetworks Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

VARIABLE-LENGTH-TO-BLOCK (VB) CODES;

ALGORITHMS; DATABASE SYSTEMS; ENCODING (SYMBOLS); ENTROPY; MARKOV PROCESSES; PROBABILITY; REDUNDANCY;

BLOCK CODES;

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

References (4)

1. Fixed data base version of the Lempel-Ziv Data compression algorithm
2. Analysis of digital tries with Markovian dependency
3. Improved redundancy of a version of the Lempel-Ziv algorithm