dc.contributor.author |
Rădescu, Radu |
|
dc.contributor.author |
Popa, Răzvan-Marius |
|
dc.date.accessioned |
2021-09-20T07:24:43Z |
|
dc.date.available |
2021-09-20T07:24:43Z |
|
dc.date.issued |
2004 |
|
dc.identifier.citation |
Rădescu, Radu. On the performances of symbol ranking text compression method. Timişoara: Editura Politehnica, 2004 |
en_US |
dc.identifier.uri |
http://localhost:8080/xmlui/handle/123456789/3864 |
|
dc.description.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. |
en_US |
dc.language.iso |
en |
en_US |
dc.publisher |
Timişoara : Editura Politehnica |
en_US |
dc.relation.ispartofseries |
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 |
|
dc.subject |
Symbol ranking |
en_US |
dc.subject |
Context |
en_US |
dc.subject |
Number of tries |
en_US |
dc.title |
On the performances of symbol ranking text compression method [articol] |
en_US |
dc.type |
Article |
en_US |