Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!udel!haven!ni.umd.edu!uc780.umd.edu!cs450a03
From: cs450a03@uc780.umd.edu
Newsgroups: comp.theory
Subject: RE: Hamming codes 101
Message-ID: <26MAR91.06565026@uc780.umd.edu>
Date: 26 Mar 91 06:56:50 GMT
References: <25MAR91.01330289@uc780.umd.edu> <1991Mar25.123457.24645@mailer.cc.fsu.edu> <26MAR91.00093317@uc780.umd.edu>
Sender: usenet@ni.umd.edu (USENET News System)
Organization: The University of Maryland University College
Lines: 12
Nntp-Posting-Host: uc780.umd.edu

Please note, in my gauche analogy of Grey code to Hamming, that parity
has a bit distance of 2, Hamming has a bit distance of 3 (and is not
distributed linearly), and "2 bit error correcting" ought to have a
bit distance of at least 5 (4 ought to function, but leave no error
detection ability).

*sigh*

Also note that coming up with a distribution is not sufficient.  There
must also exist a method to correct the errors that can occur.

Raul Rockwell