Hamming code


Also found in: Wikipedia.

Hamming code

[′ham·iŋ ‚kōd]
(communications)
An error-correcting code used in data transmission.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.

Hamming code

(algorithm)
Extra, redundant bits added to stored or transmitted data for the purposes of error detection and correction.

Named after the mathematician Richard Hamming, Hamming codes greatly improve the reliability of data, e.g. from distant space probes, where it is impractical, because of the long transmission delay, to correct errors by requesting retransmission.

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)

Hamming code

An error correction method that intersperses three check bits at the end of each four data bits. At the receiving station, the check bits are used to detect and correct one-bit errors automatically.
Copyright © 1981-2019 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.
References in periodicals archive ?
In this regard, the data bits are encoded by the proposed QMEC Cipher with the help of Manchester-based RSE-IDE extended Hamming code (39, 32).
It is similar to a Hamming code being able to determine and flip an incorrect bit if it is reading off the template strand but also shares the same problem in that a 'burst error' along the strand would not be able to be corrected by the DNA polymerase.
[12] proposed a different fragile watermarking algorithm for 3D polygonal models based on a Hamming code. The proposed algorithm normalizes each vertex coordinate into a floating value between 0 and 1.
Hamming code is a special type of BCH Code whose error correcting ability is 1.For any type of positive pairs of integer v and t; there will be binary(n,k) BCH code with given parameters.
When C is a linear completely regular code with the arithmetic property and C has minimum distance at least three and covering radius at most two, we show that C is closely related to some Hamming code. These results are summarized in Theorem 3.16, which gives a full classification of possible codes and quotients in the linear case (always assuming the arithmetic and completely regular properties) and Corollary 3.17 which characterizes Hamming quotients of Hamming graphs.
The cores have Error correction (ECC) option for Hamming Code or BCH Code with up to 64-bit error correction.
AIP (Asynchronous Information Protection): AIP provides an enhanced error detection method for the COMMAND, MESSAGE, and STATUS asynchronous transfer phases by transferring error detection information (a BCH Hamming code) on the upper eight data bits of the data bus simultaneous with the information transfer.
According to an error-correcting scheme known as the Hamming code, the addition of a carefully defined sequence of three digits to each of these blocks makes it possible to detect and correct errors that corrupt a transmitted message.
Suppose the [n, k] Hamming code over [Z.sub.4], suppose e of the code denotes the maximum number of error correction, and which is also denoted as cover radius [rho] of [q.sup.k] codewords {[C.sub.j] | 0 [less than or equal to] j [less than or equal to] [q.sup.k] - 1, q = 4 }.