Sistema adaptativo para compressão de dados

An interesting property is proven for Huffman's tree. Any two elements with weights ai and bi sons of a same father have the following property: if bi ≥ ai then Wm ≤ ai or Wm ≥ bi where Wm is the weight of any node of the tree. Based on this property, an algorithm is developed to dynamically update Huffman's tree as weights of terminal nodes change. Using this algorithm, a model of an adaptive system for data compression is developed. Simulation using many types of data led to interesting results.

Grantor dc:publisher

Universidade Federal do Rio de Janeiro

Year dc:date.issued

1973

Author dc:creator

• Faller, Newton

Advisor dc:contributor.advisor

• Silva Filho, Ysmar Vianna e

• Algoritmos
• Reconhecimento de padrões
• Compressão (computabilidade e complexidade)

Statement dc:rights

• Acesso Aberto

Language dc:language

por

Handle dc:identifier.uri

http://hdl.handle.net/11422/3780

OAI identifier oai:identifier

oai:pantheon.ufrj.br:11422/3780