| 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.

C-ORM: docs, API.

Last 100 entries

Bicycle Wheels, Inertia, and Energy; Another Tax Fraud; Google's Borg; A Verion That Redirects To Local HTTP Server; Spanish Accents For Idiots; Aluminium Cans; Advice on Spray Painting; Female View of Online Chat From a Male; UX Reading List; S4 Subgroups - Geometric Interpretation; Fucking Email; The SQM Affair For Idiots; Using Kolmogorov Complexity; Oblique Strategies in bash; Curses Tools; Markov Chain Monte Carlo Without all the Bullshit; Email Para Matias Godoy Mercado; The Penta Affair For Idiots; Example Code To Create numpy Array in C; Good Article on Bias in Graphic Design (NYTimes); Do You Backup github?; Data Mining Books; SimpleDateFormat should be synchronized; British Words; Chinese Govt Intercepts External Web To DDOS github; Numbering Permutations; Teenage Engineering - Low Price Synths; GCHQ Can Do Whatever It Wants; Dublinesque; A Cryptographic SAT Solver; Security Challenges; Word Lists for Crosswords; 3D Printing and Speaker Design; Searchable Snowden Archive; XCode Backdoored; Derived Apps Have Malware (CIA); Rowhammer - Hacking Software Via Hardware (DRAM) Bugs; Immutable SQL Database (Kinda); Tor GPS Tracker; That PyCon Dongle Mess...; ASCII Fluid Dynamics; Brandalism; Table of Shifter, Cassette and Derailleur Compatability; Lenovo Demonstrates How Bad HTTPS Is; Telegraph Owned by HSBC; Smaptop - Sunrise (Music); Equation Group (NSA); UK Torture in NI; And - A Natural Extension To Regexps; This Is The Future Of Religion; The Shazam (Music Matching) Algorithm; Tributes To Lesbian Community From AIDS Survivors; Nice Rust Summary; List of Good Fiction Books; Constructing JSON From Postgres (Part 2); Constructing JSON From Postgres (Part 1); Postgres in Docker; Why Poor Places Are More Diverse; Smart Writing on Graceland; Satire in France; Free Speech in France; MTB Cornering - Where Should We Point Our Thrusters?; Secure Secure Shell; Java Generics over Primitives; 2014 (Charlie Brooker); How I am 7; Neural Nets Applied to Go; Programming, Business, Social Contracts; Distributed Systems for Fun and Profit; XML and Scheme; Internet Radio Stations (Curated List); Solid Data About Placebos; Half of Americans Think Climate Change Is a Sign of the Apocalypse; Saturday Surf Sessions With Juvenile Delinquents; Ssh, tty, stdout and stderr; Feathers falling in a vacuum; Santiago 30m Bike Route; Mapa de Ciclovias en Santiago; How Unreliable is UDP?; SE Santiago 20m Bike Route; Cameron's Rap; Configuring libxml with Eclipse; Reducing Combinatorial Complexity With Occam - AI; Sentidos Comunes (Chilean Online Magazine); Hilary Mantel: The Assassination of Margaret Thatcher - August 6th 1983; NSA Interceptng Gmail During Delivery; General IIR Filters; What's happening with Scala?; Interesting (But Largely Illegible) Typeface; Retiring Essentialism; Poorest in UK, Poorest in N Europe; I Want To Be A Redneck!; Reverse Racism; The Lost Art Of Nomography; IBM Data Center (Photo); Interesting Account Of Gamma Hack; The Most Interesting Audiophile In The World; How did the first world war actually end?; Ky - Restaurant Santiago; The Black Dork Lives!; The UN Requires Unaninmous Decisions; LPIR - Steganography in Practice

© 2006-2015 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