Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!samsung!olivea!mintaka!geech.gnu.ai.mit.edu!rjc
From: rjc@geech.gnu.ai.mit.edu (Ray Cromwell)
Newsgroups: comp.theory
Subject: Re: Hamming codes 101
Message-ID: <1991Mar25.205332.18221@mintaka.lcs.mit.edu>
Date: 25 Mar 91 20:53:32 GMT
References: <25MAR91.01330289@uc780.umd.edu> <1991Mar25.123457.24645@mailer.cc.fsu.edu>
Sender: daemon@mintaka.lcs.mit.edu (Lucifer Maleficius)
Organization: The Internet
Lines: 17


   I don't want to offend the poster in any way, but the first explanation
of hamming codes was easier for me to understand. It was short and simple
and used example diagrams. The second explanation was valuable, but I got
lost in the int(log()) stuff and had to re-read it a few times
before I caught on. This hamming code discussion is very educational 
for me since I always wondered how they worked, so if anyone else
adds to this thread (correction of 2 bit errors) try to use examples 
of bit streams.



--
/~\_______________________________________________________________________/~\
|n|   rjc@albert.ai.mit.edu   Amiga, the computer for the creative mind.  |n|
|~|                                .-. .-.                                |~|
|_|________________________________| |_| |________________________________|_|