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.

Saved in:
Bibliographic Details
Published in:Proceedings DCC '95 Data Compression Conference pp. 292 - 301
Main Authors: Chia-Yuan Teng, Neuhoff, D.L.
Format: Conference Proceeding
Language:English
Published: IEEE 1995
Subjects:
Compression algorithms
Dictionaries
Encoding
Hydrogen
ISBN:0818670126, 9780818670121
ISSN:1068-0314
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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