> Remember, you don't have to duplicate all the information unless you're
> worried about losing *all* (and only one copy of) the information. To
> recover from one bit lost out of m, you need something like log2(m) extra
> check bits. As the number of errors you want to be safe from approaches
> infinity (it could be > m) the checkbits per loseable bit goes down toward
> one. RAID experts correct me if I'm wrong.
Do you have any more information or references on this? I'm just
trying to finish may Jupiter Brain paper, and if this holds I'll have
to adjust some of my equations. Unfortunately I slept through error
correcting codes in combinatorics, I liked generating series too
much.
> Me I would have my information scattered in secret--or very public--
> places. On my enemies' computers, for one example.
Sounds almost like my idea of becoming an open standard. "There is no
way we can wipe out that darn Anders, he is *inside* our browsers!"
I like the idea of mutual information, it makes a lot of sense.
-----------------------------------------------------------------------
Anders Sandberg Towards Ascension!
nv91-asa@nada.kth.se http://www.nada.kth.se/~nv91-asa/main.html
GCS/M/S/O d++ -p+ c++++ !l u+ e++ m++ s+/+ n--- h+/* f+ g+ w++ t+ r+ !y