Huffman Encoding of the Evolution of a Cellular Automaton

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

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.

Contributed by: Abigail Nussey (March 2011)
Based on a program by: Oyvind Tafjord
Open content licensed under CC BY-NC-SA



For more information on how the Huffman encoding works, see Stephen Wolfram's A New Kind of Science pp. 563–564 (NKS|Online).

Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.