| 释义 |
Hamming, n.|ˈhæmiŋ|
The name of Richard Hamming (b. 1915), US computer scientist, used attrib., esp. in Hamming code [described by him in Bell Syst. Techn. Jrnl. (1950) XXIX. 147–60], any code in which multiple parity bits are used in order to detect (and correct) errors, esp. one in which the Hamming distance (see below) between two codewords is never less than some specified number; Hamming distance, a measure of the difference between two words of equal length, defined as the number of positions where they differ.
1954IRE Trans. Information Theory IV. 30 The single-error-correction check digits of the Hamming code give the location of any single error within the block of N1 digits. 1958Communications Assoc. Computing Machinery Jan. 4 Would it be possible..to design around Hamming codes an auto-diagnostic machine? 1962Gloss. Terms Automatic Data Processing (B.S.I.) 21 Hamming distance. 1970O. Dopping Computers & Data Processing ii. 39 In a Gray code, only one bit position changes its value between two adjacent numbers. In other words, the so-called Hamming distance between two adjacent numbers is always equal to 1. 1985Sci. Amer. Jan. 70/3 The scheme in which seven-bit codewords each protect four bits of data is the (7,4) Hamming code; the scheme that requires a further bit is the (8,4) Hamming code. 1986R. L. Brewster Telecommunications Technol. v. 87 It is surprising how many redundant bits are required to obtain a Hamming distance of any significance. |