Compression of small text files
Advanced Engineering Informatics
Improving evolved alphabet using tabu set
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part I
| Hi-index | 0.00 |
Burrows-Wheeler Transform (BWT) is a compression method, which reorders an input string into the the form, which is preferable to another compression. Usually, Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [1] from 1994 was designed for alphabet compression. In 2001, a new version working with word alphabet was introduced [2]. The newest version copes with syllable alphabet [3].