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.


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


For more information on how the Huffman encoding works, see Stephen Wolfram's A New Kind of Science pp. 563–564.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.