Table 1 Frequencies and estimated a priori probabilities for some small n-grams for the string 1010101001. When there is a large variation between the frequencies for each n-gram, the original string can be compressed using Huffman coding

From: Creating and detecting specious randomness