Imagine a table of 8 rows and N columns.
The Rows are numbered 7 to 0, descending.
The Bottom Row consists of cells containing, individually, some numbers
which range from 0 -> 255.
These numbers are the character codes of some text.
The Row immediately above row 0, or specifically row 1, is built with the following algorithym: (The Cells are considered to be of the form Cell (Row, Col)
C(1,n) = [{C(0,n) - C(0,n-1)} + 256] Mod 256
In the case where n = 0, then n-1 is the index of the last, most rightmost, column.
In other words, consider the table to loop continuously, in the horizontal direction.
Row 2 is calculated similarly as follows:
C(2,n) = [{C(1,n) - C(1,n-1)} + 256] Mod 256
And so on, for rows 3 thru 7.
More generically:
C(x,y) = [{C(x-1,y) - C(x-1,y-1)} + 256] Mod 256
And, attached you will find a fully fleshed out table, displaying
what happens if you perform this process with the text
Reply With Quote