An improved hierarchical lossless text compression algorithm

Several improvements to the Bugajski-Russo N-gram algorithm are proposed. When applied to English text these result in an algorithm with comparable complexity and approximately 10 to 30% less rate than the commonly used COMPRESS algorithm.

Uloženo v:
Podrobná bibliografie
Vydáno v:Proceedings DCC '95 Data Compression Conference s. 292 - 301
Hlavní autoři: Chia-Yuan Teng, Neuhoff, D.L.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 1995
Témata:
Compression algorithms
Dictionaries
Encoding
Hydrogen
ISBN:0818670126, 9780818670121
ISSN:1068-0314
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Several improvements to the Bugajski-Russo N-gram algorithm are proposed. When applied to English text these result in an algorithm with comparable complexity and approximately 10 to 30% less rate than the commonly used COMPRESS algorithm.
ISBN:0818670126
9780818670121
ISSN:1068-0314
DOI:10.1109/DCC.1995.515519