Tag: Communication Theory

Parity check matrices
Professor Paul Rubin has pointed out an error in my earlier post on on parity check matrices contains a fairly big error (and I have since spotted a less serious one) – so it is in need to rewriting or serious editing. To make sure I got it right next time I bought a book […]

The difference between Hamming distance and arithmetic difference
I suppose this ought to be obvious, but I had not really thought about it before now… The Hamming distance between two bit streams is the number of bits that must be flipped to make one stream equal to the other. In error detection and error correction, the bigger the Hamming distance, the better the […]