posted on Mar, 22 2012 @ 01:16 AM
Hmm, not a source? I'd like to read more on this without having to winnow through all the chaff inevitably in the way.
But I will say one thing about the topic title, the concept of error correction was around long before the internet and browsers. Parity bits were
first added in about 1950 to magnetic tape to ensure coherent data transfer.
But as I say, you cannot go on this video alone, it has to have a verifiable source, at least for me.
--
perhaps these references from the youtube video description can help others also.
scovery? Your guess is as good as mine.
References
1.) Recent NPR interview with Professor Gates:
being.publicradio.org...
2.) Gates original paper:
arxiv.org...
3.) A potential explanation, Bostrom's Simulation Hypothesis:
www.simulation-argument.com...
-- 2
Ahh from his PDF document...
Proof: It follows from the proofs of Theorem 7 and Lemma 7 of Ref. [13], that every binary, doubly-
even [N; k]-code, with k < {(N), may be completed to a binary, doubly-even [N; {(N)]-code by
adding ({(N) k) linearly independent generators and the generated code-words; see Ref. [12]. X
However, this may be dicult to discern from any preferred choice of generator sets.
So simple, it all makes perfect sense now!!! And on that note, I'm going to go have a nice lie down.