| Andrew Cooke | Contents | Latest | RSS | Twitter | Previous | Next

C[omp]ute

Welcome to my blog, which was once a mailing list of the same name and is still generated by mail. Please reply via the "comment" links.

Always interested in offers/projects/new ideas. Eclectic experience in fields like: numerical computing; Python web; Java enterprise; functional languages; GPGPU; SQL databases; etc. Based in Santiago, Chile; telecommute worldwide. CV; email.

Personal Projects

Lepl parser for Python.

Colorless Green.

Photography around Santiago.

SVG experiment.

Professional Portfolio

Calibration of seismometers.

Data access via web services.

Cache rewrite.

Extending OpenSSH.

Last 100 entries

Headphone Test Recordings; Causal Consistency; The Quest for Randomness; Chat Wars; Real-life Financial Co Without ACID Database...; Flexible Muscle-Based Locomotion for Bipedal Creatures; SQL Performance Explained; The Little Manual of API Design; Multiple Word Sizes; CRC - Next Steps; FizzBuzz; Update on CRCs; Decent Links / Discussion Community; Automated Reasoning About LLVM Optimizations and Undefined Behavior; A Painless Guide To CRC Error Detection Algorithms; Tests in Julia; Dave Eggers: what's so funny about peace, love and Starship?; Cello - High Level C Programming; autoreconf needs tar; Will Self Goes To Heathrow; Top 5 BioInformatics Papers; Vasovagal Response; Good Food in Vina; Chilean Drug Criminals Use Subsitution Cipher; Adrenaline; Stiglitz on the Impact of Technology; Why Not; How I Am 5; Lenovo X240 OpenSuse 13.1; NSA and GCHQ - Psychological Trolls; Finite Fields in Julia (Defining Your Own Number Type); Julian Assange; Starting Qemu on OpenSuse; Noisy GAs/TMs; Venezuela; Reinstalling GRUB with EFI; Instructions For Disabling KDE Indexing; Evolving Speakers; Changing Salt Size in Simple Crypt 3.0.0; Logarithmic Map (Moved); More Info; Words Found in Voynich Manuscript; An Inventory Of 3D Space-Filling Curves; Foxes Using Magnetic Fields To Hunt; 5 Rounds RC5 No Rotation; JP Morgan and Madoff; Ori - Secure, Distributed File System; Physical Unclonable Functions (PUFs); Prejudice on Reddit; Recursion OK; Optimizing Julia Code; Cash Handouts in Brazil; Couple Nice Music Videos; It Also Works!; Adaptive Plaintext; It Works!; RC5 Without Rotation (2); 8 Years...; Attack Against Encrypted Linux Disks; Pushing Back On NSA At IETF; Summary of Experimental Ethics; Very Good Talk On Security, Snowden; Locusts are Grasshoppers!; Vagrant (OpenSuse and IDEs); Interesting Take On Mandela's Context; Haskell Cabal O(n^2) / O(n) Fix; How I Am 4; Chilean Charity Supporting Women; Doing SSH right; Festival of Urban Intervention; Neat Idea - Wormholes Provide Entanglement; And a Link....; Simple Encryption for Python 2.7; OpenSuse 13.1 Is Better!; Little Gain...; More Details on Technofull Damage; Palmrest Cracked Too....; Tecnofull (Lenovo Support) Is Fucking Useless; The Neuroscientist Who Discovered He Was a Psychopath; Interpolating Polynomials; Bottlehead Crack as Pre-amp; Ooops K702!; Bottlehead Crack, AKG K701; Breaking RC5 Without Rotation; Great post thank you; Big Balls of Mud; Phabricator - Tools for working together; Amazing Julia RC5 Code Parameterized By Word Size; Chi-Square Can Be Two-Sided; Why Do Brits Accept Surveillance?; Statistics Done Wrong; Mesas Trape from Bravo; European Report on Crypto Primitives and Protocols; Interesting Omissions; Oryx And Crake (Margaret Atwood); Music and Theory; My Arduino Programs; Elliptic Curve Crypto; Re: Licensing Interpreted Code; Licensing Interpreted Code; ASUS 1015E-DS03 OpenSuse 12.3 SSD

© 2006-2013 Andrew Cooke (site) / post authors (content).

Burrows-Wheeler Transform

From: "andrew cooke" <andrew@...>

Date: Fri, 17 Feb 2006 09:26:10 -0300 (CLST)

This is very neat.  A reversible transform that makes data trivial to
compress.

The Transform:

Take the text, of length n, and generate n different texts from the
rotations available.  Note that the last character of each line is the
prefix to the first.  Then sort and note the index of the "correct"
(unrotated) line.

The transform is the index and the final characters of the sorted list.

The Inverse:

The transform characters have all the charcters in the text.  So the
leading character column can be constructed by sorting.  This gives the
first and last character of each rotated string.  Which is a sequence of
(character, next character pairs).  Which can be chained together to give
the original text (except for an arbitrary rotation, which is corrected by
the index).

The compression:

The first characters of each line are sorted.  The transform characters
are their prefixes.  So the transform will be strongly ordered if
character pairs are strongly correlated.


Wikipedia explanation -
http://en.wikipedia.org/wiki/Burrows-Wheeler_transform

Article - http://dogma.net/markn/articles/bwt/bwt.htm

Paper - http://citeseer.ist.psu.edu/76182.html

(This is the bzip/bzip2 compression method; note that it requires the
whole input - or at least a large block size - and that decompression is
faster than compression).

From http://pmd.sourceforge.net/cpd.html
From someone on pragprog (sorry, lost reference)

Andrew

Second Order Correlations?

From: "andrew cooke" <andrew@...>

Date: Fri, 17 Feb 2006 13:20:36 -0300 (CLST)

Seems to me that the sort on the input is arbitrary.  In the different
descriptions I've read it's lexical.  But why?  It seems to me that you
could fine-tune the algorithm by using a different ordering - one, for
example, that keeps letters that occur together as close as possible.

This would increase compression because it reduces "churn" as the lead
character changes (and, to a lesser extent, for subsequent characters).

Since the sorting is necessary for the inverse there's an additional
problem - the sorting order has to be one of:
- universal
- encoded in the file (extra length)
- inferred from the transform itself

The third option is attractive because the ordering seems to reflect
similar information to the (character, prefix) pair information in the
transform.  But off the top of my head I don't see how it helps.

On the other hand, how much would this help?  As a first approximation
perhaps it is only significant when the first character changes.  That
occurs, proportionally, less and less often in large texts (since the
alphabet is fixed).

Still, it's tempting to play around...

Comment on this post