Hamming Code (original) (raw)

TOPICS

Search Close

Search

Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics Foundations of Mathematics Geometry History and Terminology Number Theory Probability and Statistics Recreational Mathematics Topology

Alphabetical Index New in MathWorld


A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of lengthr, each used once (MacWilliams and Sloane 1977). H_r is an (n=2^r-1,k=2^r-1-r,d=3) code. Hamming codes are perfect single error-correcting codes.


See also

Error-Correcting Code, Hamming Distance, Hamming Graph, Perfect Code

Explore with Wolfram|Alpha

WolframAlpha

More things to try:

References

MacWilliams, F. J. and Sloane, N. J. A. The Theory of Error-Correcting Codes. Amsterdam, Netherlands: North-Holland, 1977.

Referenced on Wolfram|Alpha

Hamming Code

Cite this as:

Weisstein, Eric W. "Hamming Code." FromMathWorld--A Wolfram Resource. https://mathworld.wolfram.com/HammingCode.html

Subject classifications