3 Mar
2004
3 Mar
'04
9:08 a.m.
NJAS wrote:
I have a 1Mbit file; I'm willing to add 100K additional bits for error correction. What should I do?
If we have length 2^20 = 1048576 and 100000 check bits, we have rate .09536. So by the Gilbert-Varshamov bound there is a binary linear code with minimum distance 12792, which will correct any error patterm with up to 6396 errors.
Is it effectively computable? (Revealing how little I know about coding theory...) --Michael Kleber kleber@brandeis.edu