New(?) encryption algorithm

[Carl Ellison]

In article <100295 at linus.UUCP> hal at gateway.mitre.org (Hal Feinstein) writes:
>Of all the subjects to get hung up on, someone in the class
>asked if in counting 2-grams (bigrams) you shoud count every pair
>of letters or to tally each pair by sliding a pointer down one
>character at a time and taking the character pointed to and the one
>to its immediate right as a pair. [...]
>
>Now, I put it to you in networld: which is the "correct" way to
>count bigrams? 
> 


The answer is:  BOTH

If the resulting statistics are not identical (by standard statistical
tests), then you've discovered that your source text is naot stationary
-- a very interesting result which should be investigated.

--Carl