DocumentCode :
2085582
Title :
The modification of the lexicographic data-string sorting algorithm
Author :
Holota, V.I. ; Kohyt, I.T. ; Golota, T.I.
Author_Institution :
Radiophisics Dept., Precarpathian Univ., Ivano, Ukraine
fYear :
2001
fDate :
12-17 Feb. 2001
Firstpage :
218
Lastpage :
219
Abstract :
A modified version of the algorithm known as the Burrows-Wheeler Transformation based on the standard lexicographic data string sorting and determination of the sequence of the strings without the sorting of the strings themselves is proposed. Proposed version of the algorithm allows the compression of data at faster rates than the original ones without any loss of compression ratio.
Keywords :
algorithm theory; data compression; sorting; Burrows-Wheeler Transformation; compression ratio; data compression; lexicographic data-string sorting algorithm; modified algorithm; string sequence; Arithmetic; Data compression; Sorting; Statistical analysis; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
CAD Systems in Microelectronics, 2001. CADSM 2001. Proceedings of the 6th International Conference. The Experience of Designing and Application of
Conference_Location :
Lviv-Slavsko, Ukraine
Print_ISBN :
966-553-079-8
Type :
conf
DOI :
10.1109/CADSM.2001.975815
Filename :
975815
Link To Document :
بازگشت