| Claudio Grondi 2005-11-15, 3:55 am |
|
Knowledge about the existance of a 263 bit long sequence has whetted my
appetite for more and now I am wondering if it is possible to get it down to
a 256 bit long sequence when allowing the bit 'window' to go around i.e. to
close the chain of bits into a bit circle in which the 'window' runs its
lap.
I have to admit, that studying pseudo random number generators has put me
even into a deeper confusion as I was before, so I have still no any
slightest idea how John_H was knowing what to take and how to adjust it to
the 263 bit long sequence he found not mentioning the idea how to get
another significant different ones (if existing).
The only approach for the search for such a 256 bit long sequence(s) coming
to
my mind is by brute force, but this seems to exceed the computation power of
any available computer...
Claudio
"John_H" <johnhandwork@mail.com> schrieb im Newsbeitrag
news:e44ef.4$As2.88@news-west.eli.net...
> One example is
>
1011000111101000011111111001000010100111
110101010111000001100010101100110010
1111110111100110111011100101010010100010
010110100011001110011110001101100001
0001011101011110110111110000110100110101
101101010000010011101100100100110000
0011101001000111000100000000,1011000[col
or=darkred]
>
> where I included the comma to show where the first 7 bits of the sequence
> are appended to the end.
>
>
>
> The google phrase is "maximal length sequence" with the additional info[/color]
that
> the sequence for 8 bits would only give 255 unique values where the 8-bit
> all-0 or all-1 sequence is missing. I just added an extra zero to the
7-bit
> 0 sequence to make it all 256.
>
>
>
> Not that this information will help you.
>
>
>
>
>
> "Claudio Grondi" <claudio.grondi@freenet.de> wrote in message
> news:3trke5Fu42t0U1@individual.net...
This[color=darkred]
is[color=darkred]
values[color=darkred]
87%[color=darkred]
>
>
|