Improvements to the Block Sorting Text Compression Algorithm

Show simple item record Fenwick, P. en 2009-04-08T04:03:02Z en 2009-04-08T04:03:02Z en 1995 en
dc.identifier.citation Computer Science Technical Reports 120 (1995) en
dc.identifier.issn 1173-3500 en
dc.identifier.uri en
dc.description.abstract This report presents some further work on the recently described “Block Sorting” lossless or text compression algorithm. It is already known that it is a context-based compressor of unbounded order, but those contexts are completely restructured by the sort phase of the compression. The report examines the effects of those context changes. It is shown that the requirements on the final compression stage are quite different from those in compressors of more conventional design. The report then presents several different approaches to improving the compression performance, eventually yielding a compressor which is among the best so far presented and is actually based on fundamental work by Shannon in 1950. It is shown that the block-sorting technique compares well with other compressors in terms of compression factor, compression speed and working memory. 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 en
dc.source.uri en
dc.title Improvements to the Block Sorting Text Compression Algorithm 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

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace