Hammingn.

/ˈhamiŋ/

Etymology: < the name of Richard Hamming (1915–98), U.S. computer scientist.

Used attributively, esp. in Hamming code n. [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 n. a measure of the difference between two words of equal length, defined as the number of positions where they differ.

ΘΚΠ

society > computing and information technology > programming language > program or code > [noun] > bit level codes > Hamming code

Hamming code1954

society > computing and information technology > data > database > data entry > [noun] > error check

summation check1926

checksum1940

parity check1950

Hamming distance1954

redundancy check1955

sum check1956

validity check1957

1954 IRE Trans. Information Theory 4 30 The single-error-correction check digits of the Hamming code give the location of any single error within the block of N₁ digits.

1958 Communications Assoc. Computing Machinery 1 4 Would it be possible..to design around Hamming codes an auto-diagnostic machine?

1962 Gloss. Terms Automatic Data Processing (B.S.I.) 21 Hamming distance.

1970 O. 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.

1985 Sci. 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.

1986 R. L. Brewster Telecommunications Technol. v. 87 It is surprising how many redundant bits are required to obtain a Hamming distance of any significance.

This entry has not yet been fully updated (first published 1993; most recently modified version published online September 2018).

ˈhamming n. and adj.

ΘΚΠ

society > leisure > the arts > performance arts > drama > acting > [noun] > over-acting

overplaying1927

hamming1946

society > leisure > the arts > performance arts > drama > acting > [adjective] > over-acting

hammy1929

ham1935

hamming1946

1946 Daily Tel. 18 Nov. 6/6 Thomas Mitchell, after a deal of recent hamming, is a convincing detective.

1957 Observer 10 Nov. 19/2 The temptation of second-feature hamming.

1960 S. H. Courtier Gently dust Corpse iii. 38 Hamming it now, thought Birch, and it's time they were brought to their senses.

单词	hamming
释义	Hammingn. /ˈhamiŋ/ Etymology: < the name of Richard Hamming (1915–98), U.S. computer scientist. Used attributively, esp. in Hamming code n. [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 n. a measure of the difference between two words of equal length, defined as the number of positions where they differ. ΘΚΠ society > computing and information technology > programming language > program or code > [noun] > bit level codes > Hamming code Hamming code1954 society > computing and information technology > data > database > data entry > [noun] > error check summation check1926 checksum1940 parity check1950 Hamming distance1954 redundancy check1955 sum check1956 validity check1957 1954 IRE Trans. Information Theory 4 30 The single-error-correction check digits of the Hamming code give the location of any single error within the block of N₁ digits. 1958 Communications Assoc. Computing Machinery 1 4 Would it be possible..to design around Hamming codes an auto-diagnostic machine? 1962 Gloss. Terms Automatic Data Processing (B.S.I.) 21 Hamming distance. 1970 O. 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. 1985 Sci. 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. 1986 R. L. Brewster Telecommunications Technol. v. 87 It is surprising how many redundant bits are required to obtain a Hamming distance of any significance. This entry has not yet been fully updated (first published 1993; most recently modified version published online September 2018). > as lemmas ˈhamming ˈhamming n. and adj. ΘΚΠ society > leisure > the arts > performance arts > drama > acting > [noun] > over-acting overplaying1927 hamming1946 society > leisure > the arts > performance arts > drama > acting > [adjective] > over-acting hammy1929 ham1935 hamming1946 1946 Daily Tel. 18 Nov. 6/6 Thomas Mitchell, after a deal of recent hamming, is a convincing detective. 1957 Observer 10 Nov. 19/2 The temptation of second-feature hamming. 1960 S. H. Courtier Gently dust Corpse iii. 38 Hamming it now, thought Birch, and it's time they were brought to their senses. extracted from hamv.² < n.1954 as lemmas
随便看	ament amenta amentaceous amental amentia amentias amentiferous amentiform aments amentum amenty ameos amer amer picon amer- amerasian amerce amerced amercement amercements amerces amerciable amerciament amerciament of green wax amerciaments

Hammingn.

> as lemmas