Symbol Ranking Text Compression

ResearchSpace/Manakin Repository

Show simple item record

dc.contributor.author Fenwick, P. en
dc.date.accessioned 2009-04-08T04:03:05Z en
dc.date.available 2009-04-08T04:03:05Z en
dc.date.issued 1996-06 en
dc.identifier.citation Computer Science Technical Reports 132 (1996) en
dc.identifier.issn 1173-3500 en
dc.identifier.uri http://hdl.handle.net/2292/3481 en
dc.description.abstract 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 3rd most likely in the present context’. This report describes an implementation of his method and shows that it forms the basis of a good text compressor.1 The recent “acb” compressor of Buynovsky is shown to belong to the general class of symbol ranking compressors. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries Computer Science Technical Reports en
dc.rights.uri https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm en
dc.source.uri http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/csTRcgi.pl?serial en
dc.title Symbol Ranking Text Compression en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en


Full text options

This item appears in the following Collection(s)

Show simple item record

Share

Search ResearchSpace


Advanced Search

Browse