> Grab a book on Computer Networks to see how/what you can do. To *detect* r > error bits, you need to encode the data such that the hamming distance is > >= r+1. Put simply, you need to ensure that each codeword (data+redundant > stuff) differs from every other valid codeword in at least r+1 bits. > Putting it the other way around, you have 2 extra bits, so the error > detection you can do is pretty minimal. Of course, using parity you can > get lucky and detect more errors *provided they are odd in number*. To do > a good job you need many more bits. Information theory is a wonderful > thing, it's a pity my Computer Networks class find it difficult! I guess they prefer beafing over hamming. ******************************************************************** Olin Lathrop, embedded systems consultant in Littleton Massachusetts (978) 742-9014, olin@embedinc.com, http://www.embedinc.com -- http://www.piclist.com hint: PICList Posts must start with ONE topic: [PIC]:,[SX]:,[AVR]: ->uP ONLY! [EE]:,[OT]: ->Other [BUY]:,[AD]: ->Ads