• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A block-sorting lossless data compression algorithm (1994)

Cached

  • Download as a PDF

Download Links

  • [www.cs.jhu.edu]
  • [www.oocities.org]
  • [www.ic.tu-berlin.de]
  • [www.mathcs.emory.edu]
  • [www.hpl.hp.com]
  • [www.iro.umontreal.ca]
  • [www6.in.tum.de]
  • [www.mit.edu]
  • [www.cs.ucdavis.edu]
  • [www.cl.cam.ac.uk]
  • [www.cl.cam.ac.uk]
  • [www.hpl.hp.com]
  • [www.eecs.harvard.edu]
  • [apotheca.hpl.hp.com]
  • [gatekeeper.dec.com]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by M Burrows , D J Wheeler
Citations:809 - 5 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@MISC{Burrows94ablock-sorting,
    author = {M Burrows and D J Wheeler},
    title = {A block-sorting lossless data compression algorithm },
    year = {1994}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We describe a block-sorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. The algorithm works by applying a reversible transformation to a block of input text. The transformation does not itself compress the data, but reorders it to make it easy to compress with simple algorithms such as move-to-front coding. Our algorithm achieves speed comparable to algorithms based on the techniques of Lempel and Ziv, but obtains compression close to the best statistical modelling techniques. The size of the input block must be large (a few kilobytes) to achieve good compression.

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University