SHARING INITIAL DICTIONARIES AND HUFFMAN TREES BETWEEN MULTIPLE COMPRESSED BLOCKS IN LZ-BASED COMPRESSION ALGORITHMS

SHARING INITIAL DICTIONARIES AND HUFFMAN TREES BETWEEN MULTIPLE COMPRESSED BLOCKS IN LZ-BASED COMPRESSION ALGORITHMS

A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: SURESHCHANDRAN SWAMINATHAN, VENKATACHALAM JAYARAMAN VENKATA RAMANAN, SENIOR RICHARD, ZIMMER MICHAEL
Format: Patent
Sprache:eng
Schlagworte:
CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A string of data is partitioned into a set of blocks. Each block is compressed based on a set of initial dictionaries and a set of Huffman trees. Each block is associated by a pointer with an initial dictionary in the set of initial dictionaries and a Huffman tree in the set of Huffman trees used to compress that block. A compressed string of data includes the set of initial dictionaries, the set of Huffman trees, and the compressed blocks and associated pointers.