Lower bounding the optimal LZ78-parsing
Nenhuma Miniatura disponível
Data
2001-01-01
Título da Revista
ISSN da Revista
Título de Volume
Editor
Resumo
A simple sequential algorithm that can compute a lower bound to the number of phrases produced by the optimal parsing procedure was developed and tested. Results were compared to the number of phrases produced by two versions of the LZ78: LZW and the algorithm ll-LZ78. Results show that the lower bound is close to the number of phrases of those versions.
Descrição
Palavras-chave
Como citar
Data Compression Conference Proceedings, p. 513-.