SI
SI
discoversearch

We've detected that you're using an ad content blocking browser plug-in or feature. Ads provide a critical source of revenue to the continued operation of Silicon Investor.  We ask that you disable ad blocking while on Silicon Investor in the best interests of our community.  If you are not using an ad blocker but are still receiving this message, make sure your browser's tracking protection is set to the 'standard' level.
Pastimes : Dream Machine ( Build your own PC ) -- Ignore unavailable to you. Want to Upgrade?


To: Spots who wrote (4105)12/10/1998 8:52:00 PM
From: Sean W. Smith  Read Replies (1) | Respond to of 14778
 
Spots,

Its a forward error correction code based on Reed-Solomon encoding aka "Galois field Multiplication" invloving prime polynomials. The encoding is on the whole double word and you only need 8 extra bits. Similar to CD's and Cable Modems, ADSL and lots of oher applications that use similar forward error correction algorithms.

Sean



To: Spots who wrote (4105)12/10/1998 11:44:00 PM
From: AreWeThereYet  Read Replies (1) | Respond to of 14778
 
Spots,
your message has a high entropy than me :o) I don't know what today's ECC use as there are many different schemes, but in order to store enough information for error-correction, I think approx. 3 bits is required for every 8 bits. Maybe newer technique able to reduce this in a larger chunk but this will give me a even harder time (correct a larger chunk is much more complex!).

Oh no, did you mentioned modulo arithemetic too, my brain is frozen now :oP

aC