On 11/1/07, M. Adam Davis wrote: > Alternately, the brute force version simply checks the parity. If it > doesn't match, then it goes through the data changing one bit at a > time and checks the parity each time. Correction: Alternately, the brute force version simply checks the parity. If it doesn't match, then it goes through the entire received word (data and parity bits)data changing one bit at a time and checks the parity each time. If it finds one correctly, then you've found the single bit error. If it goes through all the bits once and doesn't find it then you've determined that two bits have changed. -Adam -- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - Moving in southeast Michigan? Buy my house: http://ubasics.com/house/ Interested in electronics? Check out the projects at http://ubasics.com Building your own house? Check out http://ubasics.com/home/ -- http://www.piclist.com PIC/SX FAQ & list archive View/change your membership options at http://mailman.mit.edu/mailman/listinfo/piclist