Please use this identifier to cite or link to this item:
https://dspace.upt.ro/xmlui/handle/123456789/3864| Title: | On the performances of symbol ranking text compression method [articol] |
| Authors: | Rădescu, Radu Popa, Răzvan-Marius |
| Subjects: | Symbol ranking Context Number of tries |
| Issue Date: | 2004 |
| Publisher: | Timişoara : Editura Politehnica |
| Citation: | Rădescu, Radu. On the performances of symbol ranking text compression method. Timişoara: Editura Politehnica, 2004 |
| Series/Report no.: | Buletinul ştiinţific al Universităţii „Politehnica” din Timişoara, România. Seria electronică şi telecomunicaţii, Tom 49(63), fasc. 2 (2004), p. 25-27 |
| Abstract: | This paper presents an implementation of a method for text compression, first described by Shannon in 1951 and later, in 1997, by Fenwick. Unlike other compressors, which exploit symbol frequencies in order to assign shorter codes to more frequent symbols, this technique prepares a list of probable symbols to follow the current one, ordered from most likely to least likely. Tests were conducted on various input sources and the results are shown here. The implementation supports further optimizations, as it will be explained. |
| URI: | http://localhost:8080/xmlui/handle/123456789/3864 |
| Appears in Collections: | Articole științifice/Scientific articles |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| BUPT_ART_Radescu_f.pdf | 394.66 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.