Huffman Encoding of the Evolution of a Cellular Automaton

Run-length encoding breaks up data into runs of identical elements of varying lengths. Huffman encoding, in particular, breaks data—in this case, an array of 1's and 0's—into distinct blocks of three. This Demonstration shows the Huffman encoding of the elementary cellular automaton evolutions.