Symbol Ranking Text Compression with Shannon Recodings
| dc.creator | Fenwick,Peter | |
| dc.date | 1997 | |
| dc.date.accessioned | 2024-02-06T12:48:43Z | |
| dc.date.available | 2024-02-06T12:48:43Z | |
| dc.description | In his work on the information content of English text in 1951, Shannon described a method of recoding the input text, a technique which has apparently lain dormant for the ensuing 45 years. Whereas traditional compressors exploit symbol frequencies and symbol contexts, Shannon's method adds the concept of "symbol ranking", as in `the next symbol is the one third most likely in the present context'. While some other recent compressors can be explained in terms of symbol ranking, few make explicit reference to the concept. This report describes an implementation of Shannon's method and shows that it forms the basis of a good text compressor. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-003-02-0070 | |
| dc.identifier | https://lib.jucs.org/article/27331/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/7112 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 3(2): 70-85 | |
| dc.subject | text compression | |
| dc.subject | Shannon | |
| dc.subject | symbol ranking | |
| dc.title | Symbol Ranking Text Compression with Shannon Recodings | |
| dc.type | Research Article |