[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: State machine hypothesis...
On 18 Aug 2001, at 11:34, Nick Pelling wrote:
> For example: build a set of tables for English that, given the last
> character, predicts what the next character is (including space). Sort each
> table by generally observed frequency count. For your plaintext, use the
> index into these tables as the output stream (ie, emit the "rank" of the
> This is polyalphabetic (we have 27 substitutions), state driven (we have 27
> states), yet the output has a low entropy. No contradiction!
Does such a mechanism output a code which shares any other
similarities to the vms text? (other than the alleged low entropy?).
Can you give an example?