Snake frequencies

© F. Ruiz 2020

This little app computes the letter distribution frequencies resulting from combining several pieces of uncorrelated text using a Tabula Recta, as in the TripleText and Snake ciphers. It calculates the limit for a very large text length, based on English "etaoin" letter frequencies found in Wikipedia. Two scenarios are considered: (1) all the letters are added, as in TripleText, (2) the letters alternatively add and subtract, as in Snake. The highest number of letters added in one operation is 6 (plaintext plus five extra pieces of text). The frequency for uniformly distributed random letters is

all add