Hamming codes are a family of binary, linear error-correcting codes that are used to detect and correct data transmission errors. Hamming codes are able detect up to two simultaneous bit errors and capable of correcting single-bit errors.

learn more… | top users | synonyms

0
votes
0answers
27 views

Linear Code - Hamming - Finding nearest vector

I am studying for my finals and I have a review problem I can't solve. For purpose of doing this problem by myself, I'll leave out certain details. So this is concerning Hamming distance I suppose. ...
-1
votes
1answer
38 views

HMAC ipad and opad choice

It is written in the HMAC paper that the $ipad=0x36$ and $opad=0x5c$ were chosen such that it maximize the Hamming-Distance of the part of the key used in the inner and outer part of the HMAC process. ...
3
votes
1answer
219 views

Hamming Distance vs. Index of Coincidence

When analyzing a repeating-key xor cipher to find the key length, I've read about two key methods (assuming there aren't just repeating chunks of ciphertext for Kasiski's method), for some assumed key ...