Burrows–Wheeler Transform Based Lossless Text Compression Using Keys and Huffman Coding

Text compression is one of the most significant research fields, and various algorithms for text compression have already been developed. This is a significant issue, as the use of internet bandwidth is considerably increasing. This article proposes a Burrows–Wheeler transform and pattern matching-b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Symmetry Jg. 12; H. 10; S. 1654
Hauptverfasser: Rahman, Md. Atiqur, Hamada, Mohamed
Format: Journal Article
Sprache:Englisch
Japanisch
Veröffentlicht: Basel MDPI AG 10.10.2020
Schlagworte:
Algorithms
Burrows-Wheeler transform
Coding
Compression ratio
compression ratio; Huffman; LZW; Deflate; Gzip; PAQ8n; bzip2; LZMA; Brotli
Data compression
Deflate
Dictionaries
Gzip
Huffman
Huffman codes
LZW
Mathematics
PAQ8n
Pattern matching
QA1-939
Statistical analysis
ISSN:2073-8994, 2073-8994
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Text compression is one of the most significant research fields, and various algorithms for text compression have already been developed. This is a significant issue, as the use of internet bandwidth is considerably increasing. This article proposes a Burrows–Wheeler transform and pattern matching-based lossless text compression algorithm that uses Huffman coding in order to achieve an excellent compression ratio. In this article, we introduce an algorithm with two keys that are used in order to reduce more frequently repeated characters after the Burrows–Wheeler transform. We then find patterns of a certain length from the reduced text and apply Huffman encoding. We compare our proposed technique with state-of-the-art text compression algorithms. Finally, we conclude that the proposed technique demonstrates a gain in compression ratio when compared to other compression techniques. A small problem with our proposed method is that it does not work very well for symmetric communications like Brotli.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym12101654