A Bibliography of Publications By, and About, Richard Wesley Hamming

A Bibliography of Publications by, and about, Richard Wesley Hamming

Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 30 January 2021 Version 1.11

Abstract -ary [LCL08]. -Borsuk [Zie01]. -bounded [SWH12]. -D [Sal13]. -designs [BBZ17]. This bibliography records publications of -Dimensional [Siv14]. -lifts [KY15]. Richard Wesley Hamming. -linear [Mun06]. -means [DG17]. -metric [WZYG17]. -nd [Chu91]. -sequences [Tak96]. Title word cross-reference 1983 [Gen83].

2002 [B+02]. 2nd [Blo84, Cun73, S.75]. (2, 2) [KSSY12]. 0/1 [Zie01]. 1 [AIR17, Sal13]. $11 [Jun62]. $12 [Ham68a]. 3 [Bul88]. 3-527-26463-9 [Bul88]. $12.50 [Ham68b]. $17.50 [Ham65a]. 2 3-dimensional [BBHS08]. [Chu91, vdHL10]. 64 [KY15]. cos X [Ham45b]. d [Siv14]. GF(2) [She95]. H(n, 2) N 81e [Ham85a]. 87 [Ham85a]. 8th [IS87]. [BBZ17]. k [DG17, SWH12]. m [Tak96]. Fp [Mun06]. Zk [Mun06]. Mat (Z ) [DS04]. p n,s k 9 [Bul88]. O(ndm/we) [GF08]. q [LCL08]. R3 [KY15]. t [BBZ17]. τ [WZYG17].

1 2

A. [Kar77]. Abstract [BKR01, Tre97]. band-edge [HK78]. Bandwidth Academic [Ham64, Ham68d]. access [AJM08, BBHS08, Har03]. Based [EQH00]. ACM [ACM11, Ash87]. Addition [Bal96, CTL07, KSSY12, LMWC17, MP10, [Rob87]. Aﬃne [Ser11]. Aids AB08, AGLP16, CCLL11, HY17, JP13, [Ham52, Ham50b]. Algebraic [ORSW12]. REF15, ZGZ+13]. Bases Algorithm [Hun93, Rah17]. Algorithms [B+02, Sta18, TZZ95, TZZ97]. BCH [MS02, SS02, Sti02]. Alphabets [Gil52]. [Chu91, Sol00]. be [AIR17]. become ambiguity [PW14]. AMBTC [KSSY12]. [ALW+88]. Behavior [PZ06]. behaviour Amer [Ham85a]. America [Dur88]. [Ale70]. beholder [Ham94]. Beightler American [ALW+88]. amplitude [HK78]. [Ham68b]. Between [Ano14, Kle13]. Analog [Ham65a, SH99]. analoger [SH99]. Beyond [DM97, ORSW12]. Binary Analysis [Chu91, HM65, OV04,¨ Sta18, Zie01, BBZ17, [Ham71d, Ham73c, Ham89c, Ham12a, SH90, HT90, KY15]. biological [Swe89]. Bit SH99, Ham65e, Ham65f, Ham66c, Ham74, [EQH00, GF08, Rah17]. Bit-parallel Mic85, Sca74, Bra73, Ham65b, Kar77]. [GF08]. Blum [Ham73c]. Blurring [Ano14]. Anniversary [Cer80, ALW+88]. annual Book [Bar62, Blo84, Bul88, Gut92a, Gut92b, [ACM97, ACM99]. anticodes [Ahl06]. Ham56a, Ham56b, Ham56c, Ham57a, Aperiodic [ZTYP12, HPL15]. APN Ham57b, Ham57c, Ham57d, Ham58a, [RSV15b]. application [JP13]. Ham58b, Ham58c, Ham58d, Ham59a, Applications [Liu09]. Applied Ham59b, Ham59c, Ham59d, Ham60, Ham64, [Bra73, Ham71d, Ham85b, Ham89c, Ham04, Ham65a, Ham65b, Ham68a, Ham68b, Ham12a, Jun62, Kar77, EQH00]. approach Ham68d, Ham73c, Ham90a, Jun62, S.75, [Ham74, Ham91a, RZ12]. Approximability Ter78, Ter84, Tho73]. Boolean [Tre00, Tre97]. Approximate [Ser11, SWH12]. Bootstrap [GHPS15]. [KK01, CCGL99, KK03]. arbitrary Borsuk [Zie01]. both [AIR17]. Bound [SWH12, VR06]. architecture [Chu01]. [CR12, CCGL99, CR11, Got96, SK10a]. Arithmetic Boundary [AE03, Ham42b, Ham42a]. [IS87, Swa90, Swa15a, Swa15b, Swa15c]. bounded [AGLP16, SWH12]. Bounds array [Jai07]. Art [AGSU15, MP10, HPL15, Jai07, WZYG17, [Gut92a, Gut92b, Ham63b, Ham91b, ZLD13]. Brains [Ham51a]. Ham95c, Ham97b, MZ02a]. ary [LCL08]. Buchbesprechung [Kno88]. Aspray [Ham92a]. Assignment [MP10]. Associated [MP10]. association [BBZ17]. CA [ACM11, Sal13]. Calculation [DM97]. associative [HT90]. Asymptotic [AJM08]. Calculus [Ham66d, Ham68c, Ham84, Atlanta [ACM99]. AtomicHeritage Ham85b, Ham88c, Ham04]. Campopiano [Kel18a]. Attacks [ORSW12, ZGZ+13]. [Jai07]. Campopiano-type [Jai07]. cannot attributed [Dij76]. August [B+02]. [AIR17]. Capsule [Ham79]. Care [Rob01]. autocorrelation [PW14]. Automatic Case [Kar77, GF08]. Castle [OLGP15]. [Ham68a]. avoiding [RSV12, RSV15a]. Cavity [RZ12]. CBI [Cer80]. celebrates Award [Ash87]. Awarded [Cer80]. [ALW+88]. century [Dur88, MHR80]. certain [OLGP15]. Chain [HS01]. change baby [Sti02]. baby-step [Sti02]. Bag [HK78]. Channel [ORSW12, ZGZ+13]. [WZNM14]. Bag-of-Visual [WZNM14]. Channels [Eli55, Eli56, Eli74, LA01]. chaos Ball [Ham89a]. Balls [LS14]. band [HK78]. [CCLL11]. chaos-and-Hamming [CCLL11]. 3

Character [Ham45b]. Characterization [Ham52, Ham73c, Ham50b, JP13, WK14, [CVB15, AA05, BvDK08, VR06]. Charles Ham68a, Ham68a]. Computer [Ham68b]. Checking [HRSC54, HRSC55]. [Ano14, Cer80, Ham57e, Ham63a, Ham66d, China [B+02]. Chislennye [Hem68, Khe72]. Ham68c, Ham69a, Ham73b, Ham79, Ham92b, Chooses [Cer80]. Class [Got96, HP66, IS87, Swa90, Swa15a, Swa15b, Swa15c, Bau09, Ham71b, SK10b, Ham71a, HY17, TSS04]. Ham61b, Ham75b, Ham87a, Mor02, Gen83]. Classical [Ham12b, MM12]. Classifying Computers [HRSC54, Ham62a, Ham71c, [Hun93, Ost02].¨ Classroom [Ham70b]. Ham72, HRSC55, Ham65d, Ham65a, Tho73]. Cliﬀs [Ham68a, Ham68b]. Closing [Gui04]. Computing [ACM97, ACM99, ACM11, Clustering [DG17]. cm [Ham64]. cm. DM97, Ham63b, HM65, MHR80, SWH12, [S.75]. Co [S.75]. Code JP13, MR05, PE86, Ham92a]. [KSSY12, KS17, Liu09, Sac16, Sta18, ZLD13, concatenated [Isa05]. cone [Avi81]. CCLL11, Gui04, HPR04, KY15, Rah17]. Conference [B+02, Ham88c, SM10]. Codes Conference/Workshop [Ham88c]. [Ash98, Bau07, Cer80, Chu91, DS04, EIZ91, confusions [Ham75b]. conjugates [Sha09]. EL93, Fen15, GO06,¨ Ham50a, Ham90b, connection [Kle13]. Connections [Hun93]. Ham95b, Ham12b, HH01, HLR01, HS01, Connectivity [FvdHH16]. Constant LA01, LWW10, Mit09, MZ02b, PZ06, PL95, [Fen15]. constraint [CR02]. constraints Rob87, SK10b, Sch91, Sch03, TZZ95, Zie01, [TSM14]. Construction [HPP+17]. VV94, AB08, CM95, Chu01, GP13, Got96, constructions [ZLD13]. content [TSM14]. Gro06, Gui04, Ham09, Ham15a, HY17, continuous [DG17]. Contrast [HH65]. HK09, Hou97b, Isa05, KY15, Kle13, LCL08, Contributors [Ham65c]. control [Ham70a]. Mun06, OLGP15, RSV12, RSV15a, RM16, controlled [Ham69b]. Controlling SK10a, TZZ97, TSM14, VR06, WZYG17, [Ham57e]. Convergent [Ham45a]. Bau07, Ham09, Man16, Sch91, Sch03]. Cornelius [Sca74]. Correcting Codierung [Ham87b, Kno88]. C´odigos [Bau07, Chu91, Ham50a, Ham90b, Ham95b, [PP18]. Coding [Eli55, Eli56, Eli74, Ham12b, Mit09, MZ02a, SK10b, AB08, Ham80c, Ham86a, Ham88b, Hou97a, IS86, Got96, HH51, Ham09, Ham15a]. Correction Khe83, MZ02a, Jai07, MC10, Ham87b]. [Rob87, Chu01, Ham59f, Rah17]. coincidences [Gro06]. Colleagues Corrections [Ham48]. corrector [Ham59e]. [PSvE+89]. Collection [MHR80, Cer80]. Correlation College [Ham88c]. Color [Rob01, TH49]. [ZTYP12, HPP+17, LPH14, RFZ14]. Coloring [Zie01]. combinatoire [CCM92]. correlations [HPL15]. Counter [EQH00]. combinatorial [CCM92]. Comments Course [Ham88b]. Creep [HH57, HH58]. [PSvE+89]. Communication Critical [Sta18]. Crossover [MS02]. [AGSU15, CR12, PE86, CR11, HSZZ06]. Crystals [BH53, MH59, MH63]. CS Como [IS87, PP18]. Comparing [CDIM02]. [Ano98a]. Cube Comparison [Gil52]. complement [DM95, Sam17, CCGL99, ZGZ+13]. [TSM14]. Completed [Cer80]. Curriculum [Ham88c]. curve [HK09]. Cut completeness [EKP85]. complex [Lev04]. [LCWY12]. cyclic [Chu01]. Complexity [AGSU15, CR12, CCGL99, CR11, HL02, HSZZ06, PE86]. Compliant D [Ham92b, Kar77, Sal13, vdHL10]. Daniel [Ano98a]. Compression [Kar77]. dans [CCM92]. Data [Ano14, [Sal13, SM10, AB08]. Computation B+02, CDIM02, DG17, Sal13, SM10, AB08]. 4

Databases [Bal96, Bal05]. DDC [SM10]. [Ham95c, Ham97b]. Dorn [Kar77]. Double Dear [Ham66b]. December [Gal09]. [Chu91]. Double-Error [Chu91]. Douglass Decoder [HH01, KKI+15]. decoding [Ham68b]. Dr. [Ano14]. Dragonfly [Sol00]. decomposition [AP12]. defined [CVB15]. Dual [Chu91, VV94, KY15]. [KKI+15]. Degenerate [SK10a]. Degree [Cer80]. Density [PZ06]. Depend [MS02]. ed [Blo84, Cun73, S.75]. Edge Derivation [TSS04]. Design [LMWC17]. [AJM08, HK78]. Edge-Bandwidth designs [BBZ17]. Detecting [AJM08]. edit [AALS18]. Edition [Ter84]. [Ham50a, Ham90b, HH51, Ham15a]. Editor [Ham65e]. Edward [Ham64]. Effect Detection [Rob87, Ham59f, Rah17]. [Sta18]. effectiveness [Ham80a, Ham85a]. Determination [AJM08]. Deterministic Effects [Ano14]. Efficient [AGSU15]. Develop [Ham88c]. diametric [REF15, SS02, ZGZ+13, KKI+15]. Effort [Ahl06]. Did [Ham80b]. Dies [Fis98]. [Ano98a]. Eighth [B+02]. Electron [HH65]. Differences [MS02]. Differential Electronic [Ham65a]. Elementary [Ham42b, Ham42a, Kar77, Ham51b, Ham59e]. [Ham70b, Ham70c]. Elements [Ham65b]. digit [AW91, AW93]. Digital Elias [Gal09]. Elliptic [SS02]. Embedding [BBB17, Fis98, HRSC54, Ham57e, Ham77, [DG17, WZNM14]. Embeddings HS79, HY80, Ham83b, Ham89b, Ham95a, [DM95, Mun06, RSV15b]. encoding [Sol00]. Ham98b, SH90, HRSC55, Cer80, SH99, encoding/decoding [Sol00]. energy Blo84, Ter78, Ter84]. Digitale [KKI+15]. energy-efficient [KKI+15]. [Ham87c, SH99, Bul88]. Dijkstra Engineer [Hou97a]. Engineering [PSvE+89]. Dimension [AE03]. [Ham62a, Ham95c, Ham97b, Ham96]. Dimension-Normalized [AE03]. Engineers [Ham62b, Ham73a, Ham86b, Dimensional [Siv14, AKN13, BBHS08]. Ham91b, Hem68, Khe72, S.75, Bar62, Cun73, Dimensions [Zie01]. Discovery [Ham93]. Dav63, Gut92a, Gut92b, Jun62]. Discrete [Ham84, PW14, Sti02]. Englewood [Ham68a, Ham68b]. English Discussion [Ham70b, Ham70c]. [CCM92]. environment [Iza09]. Epstein Discussions [Ham45b]. Dissimilarity [Ham68d]. Equations [AKKT16, Ham42b, [BKR01]. Distance Ham42a, Ham51b, Ham59e, TSS04, Kar77]. [AA05, AGSU15, BKR01, CR12, CTL07, Errata [MH63]. Erratum [RSV15a]. Error DS04, EQH00, GLM02, Ham93, Hun93, IS86, [Bau07, Chu91, Ham50a, HH51, Ham90b, KK01, LCWY12, MP10, PZ06, Sal13, Ser11, Ham95b, Ham09, Ham12b, Ham15a, Hou97a, Ale70, AIR17, AP12, AGLP16, AD11, CR11, LA01, Mit09, MZ02a, Rob87, SK10b, AB08, CR02, GF08, HPR04, HSZZ06, Iza09, JP13, Chu01, Got96, Ham59f, Rah17, RM16]. KK03, LY08, MR05, PE86, REF15, Sha09, Error-Correcting Swe89, TSM14, WK14]. Distances [Ham95b, Ham12b, Ham09, Got96]. [Bal96, LMWC17, AALS18, Gro06]. distant Error-detecting [HH51]. Error-Detection [Ham98a, Ham01]. Distinction [Ano14]. [Rob87]. error-reducing [RM16]. Distortion [DG17, Ham69b]. Distribution erweiterte [Sch91, Sch03]. Essays [Ham70d, Ser11, Ham15b]. Distributions [HR00, MHR80]. Estendidos [PP18]. [DS04]. Divergent [Ham47, Ham48]. dlya Estimating [MP10]. Euclid [Tre97, Tre00]. [Hem68, Khe72]. DM [Bul88, Kno88]. DNA Evaluation [HH65, HY17, KS17]. [TSS04, TSM14]. do [Ham75a]. document Evolutive [GLM02]. exercise [Dij76]. [JP13]. Does [MS02]. Doing Existence [OV04,¨ ZLD13]. Experience 5

[LL09]. extend [Iza09]. Extended Germany [Bul88]. Giant [Ham51a, Sti02]. [BKR01, Sch91, Sch03, KY15, Tre97]. giant-step [Sti02]. Glyph [LMWC17]. Extensions [Rob87]. Extremal Golay [Man16, MZ02b, Sol00]. [AE03, KY15]. eye [Ham94]. Golay-Codes [Man16]. Granino [Ham65a]. graph [FvdHH16, Har03, vdHL10]. graphes F [Bul88]. Fail [LMWC17]. Fail-Safe [CCM92]. graphics [KKI+15]. Graphs [LMWC17]. fast [KKI+15]. [AJM08, AE03, Zie01, AA05, AK94, Fehlerkorrigierende [Bau07, Ham09]. BBHS08, BvDK08, CCM92, GP13, IK97]. Fejer [Ham92b]. Field [Ham73b]. Grids [AJM08]. Group [EIZ91, Ahl06]. Fifteenth [Gen83]. fifth [ALW+88]. Fifty [DM97]. filter H [Kar77]. Halfspaces [LS14]. Hall [HK78, KH77, Ham87c, Bul88]. Filters [Ham68a, Ham68b, Ter78, Ter84]. Hammer [Ham77, HS79, HY80, Ham83b, Ham89b, [Sta18]. Hamming Ham95a, Ham98b, Blo84, Ter78, Ter84]. [Bau07, Bul88, IEE18, Jun62, Kno88, Finding [Cus13, Ham68b, KK01, KK03]. RSV15a, S.75, Ter78, Ter84, Ahl06, AA05, Finite [Ham68a, HS01]. First AK94, AJM08, AB08, Ale70, AKN13, [Ham88b, Swe89, ACM99, Ash87]. Fitness AGSU15, AIR17, AALS18, Ano98a, Ano98b, [MS02, TSS04]. five [ALW+88]. Fixed Ano04, Ano14, AP12, AGLP16, AW91, [PZ06]. Foreword [Ham90c, Ham96]. AW93, AKKT16, Ash98, AD11, Avi81, AE03, Formula [Ham71b]. Formulas Bal96, Bal05, BBHS08, BvDK08, BBZ17, [EH72, HP66, Ham71a]. FORTRAN Bar62, Bau07, Blo84, BBB17, BKR01, Bra73, [Kar77]. Forward [Mit09]. Foundations CVB15, CCM92, Cer80, CCGL99, CR11, [Ham92b, Ham68b]. Fourier [PW14]. CR12, CTL07, CCLL11, CM95, Chu91, fragile [CCLL11]. Frequency Chu01, CDIM02, CR02, Cun73, Cus13, [ZTYP12, Ham74, Ham91a, HPL15, DM95, Dav63, DG17, Dij76, DS04, EQH00, HPP+17, LPH14, RFZ14]. EIZ91, EL93, EKP85, FvdHH16, Fen15, Frequency-Hopping [ZTYP12, RFZ14]. Fis98, GP13, GM15, Got96, GF08, GHPS15, Full [OV04].¨ Full-Rank [OV04].¨ Function Gro06, GLM02, GO06,¨ Gut92a, Gut92b, [Ser11, HK78]. functionalities [JP13]. Ham90c, Ham93, Ham99, HPL15, HPP+17, Functions [Ham70b, Sam17, Ser11, Har03, HPR04, HY17, HH01, HK09, HLR01, ZTYP12, Ham70c, SWH12]. Future HL02, HS01, Hou97b, HT90, HSZZ06]. [Ham83a, Ham90d, HR00, Ham00]. Fuzzy Hamming [Hun93, IK97, Isa05, IS86, Iza09, [BKR01, Iza09]. Jai07, JP13, Kai09, KY15, Kar77, KSSY12, KKI+15, Kle13, KS17, KK01, KK03, LA01, G [Ham66a]. Galois [Ash98]. Gambling LL09, Lee98, LMWC17, Lev04, LY08, [Ham68d]. Gap [CR12, CR11]. LCL08, Liu09, LWW10, LCWY12, LPH14, Gap-Hamming-Distance [CR12, CR11]. LS14, LP02, MC10, Man18, MR05, Man16, Gauss [HY17]. GC [TSM14]. GC-content MS02, Maz03, Mit09, MP10, MZ02b, Mor98, [TSM14]. Generalized Mor02, Mun06, OR12, OLGP15, ORSW12, [Ash98, Chu91, GO06,¨ HS01, LWW10, VV94, Ost02,¨ OV04,¨ PP18, PE86, PZ06, Per93, HK09, LCL08, OLGP15, ZLD13]. Genetic PL95, PW14, Rah17, RZ12, RFZ14, RSV12, [HPR04, MS02]. Geometric [Tre00, Tre97]. RSV15b, REF15, Rob87, RM16, Sac16, SS02, Georgia [ACM99]. German [Bau07, Bau09, Sal13, Sam17, SK10a, SK10b, Sch91, Sch03, Ham87b, Ham09, Sch91, Sch03, SH99]. Ser11, Sha09, She95, Siv14, Sol00, Sta18, 6

Sti02, SWH12, Swe89, Tak96, TSS04, Tho73, [ACM11, B+02]. Intersection Tre97, Tre00, TZZ95, TZZ97, TSM14, VR06, [RSV12, RSV15a]. Interview WZNM14, WZYG17, WK14, ZGZ+13, [Kel18b, Kel18a]. intractability [MR05]. ZTYP12, ZLD13, Zie01, VV94, vdHL10]. Introduction [Ham64, Ham71d, Ham89c, Hamming- [Man16]. Ham95c, Ham12a, Kar77, Bra73]. Inverse Hamming-autocorrelation [PW14]. [LY08, LCWY12]. Investigation Hamming-Codes [Sch91, Sch03]. [Mit09, EQH00]. inzhenerov Hamming-Distance [AGSU15, Ale70]. [Hem68, Khe72]. Irrational [Sta18]. ISBN Handbook [Hou97a]. Harmful [Ano14]. [Bul88]. Isometric [Mun06]. Italy [IS87]. Hashing [Bal96, Bal05]. Heapsort [Kle13]. IV [Kar77]. ix [S.75]. Henrici [Ham65b]. Hermitian [HK09]. Hiding [CTL07, Ham00]. Hierarchical J [Ham68b]. John [Ham66b, Ham92a]. [KS17]. hierarchy [VR06]. High Joint [SS02]. Jose [ACM11]. June [Isa05, PZ06, She95]. High-rate [Isa05]. [ACM11]. Higher [Rob87]. Hill [Ham65a, Jun62, S.75]. Historical [Bau09]. Kendall [WZYG17]. Kernel [WZNM14]. Historische [Bau09]. History [MHR80]. Kernels [PL95]. Know [Ham80b, Ham75a]. hit [HPL15, HPP+17, LPH14]. Hong kodirovaniya [Khe83]. Kong [B+02]. [B+02]. honor [HR00]. Honorary [Cer80]. Konrad [Cer80]. Korn [Ham65a, Ham66a]. honour [Sca74]. Hopping [ZTYP12, HPL15, HPP+17, LPH14, RFZ14]. L [Ham64, Ham68a]. Lanczos [Sca74]. Horse [Sta18]. Houston [Gen83]. Huffman landscape [TSS04]. Large [B+02]. lattice [SK10b]. Human [Ano14]. Humanist [AK94]. Launches [Ano98a]. Leakage [Bra73]. Hybrid [Ham65a]. hyperbolic [ORSW12]. Lean [Ham88c]. Learn [Ham51b]. Hypermetric [Avi81]. [Ham95c, Ham97b]. Learning [Ham95c, Ham97b, Ale70]. Lectures identification [HL02]. Identifying [Ash87]. led [Ham91a]. Length [HLR01]. Illus [Fen15, SK10b, KY15]. lesion [TSS04]. [Ham65a, Jun62, Ham68a, Ham68b]. Image Letters [Ham65e]. Level [Ham88c]. lifts [CTL07, HH65]. Impact [Ham65d]. [KY15]. Limit [Ser11]. Linear Imperfect [TSS04]. Implications [AKKT16, Ash98, Ham42b, Ham42a, [CVB15, Ham63a, Ham61b]. Improvements LWW10, HY17, IK97, LCL08, Mun06, VR06]. [GO06].¨ Improving [HT90]. Indexing Lively [Ham88c]. local [REF15]. Location [WZNM14]. Indirect [Bal96]. Inequality [HM65]. logarithm [Sti02]. Logic [Sam17]. Infinite [Ham68a]. inflected [Ham68d]. looking [Cus13]. Loss [Ano14]. [HK78]. Informatik [Bau09]. Information lossless [AB08]. Low [DG17, LPH14, Zie01, [Ham80c, Ham86a, Ham87b, MM12, EQH00, AKN13, HPL15, HPP+17, Sti02]. Ham00, Khe83, Ham87b, Kno88]. low-dimensional [AKN13]. Low-hit-zone Informationstechnologie [Bul88]. [LPH14, HPP+17]. Lower Informative [WZNM14]. informatsii [AGSU15, CR12, CCGL99, CR11, HPL15]. [Khe83]. Input/Soft [HH01]. Integration [HP66, Ham71b, Ham71a]. Intellectual M [Ham65a]. Machine [Ano14, HM65]. [Ham61b, Ham63a]. Interface [Gen83]. Machines [Ham51a, Ham12b, Ham68a]. interleaving [HPP+17]. International macromolecules [Swe89]. magnetic 7

[MH59, MH63]. Magnetostriction [BH53]. Muller [MZ02b]. Multidimensional Man [Ham69a, Man18, Ham87a]. [AJM08]. Multiple [MC10, KH77]. Mandelberg [Kel18a, Kel18b]. Manhattan Multiplication [SS02]. Multisection [MP10]. March [Gen83, SM10]. Martin [HK78]. Museum [Cer80]. mutation [Kel18a, Kel18b]. Marvin [Ham68a]. [Swe89]. my [Ham75b]. matching [AD11, GF08]. Matchings [AK94]. Math [Ham85a]. Mathematical N.J [Ham68a, Ham68b]. Nature [Ham47, Ham48, Ham71b, Mic85, Ham92b]. [Ham70b, Ham70c]. nauchnykh Mathematician [Man18, Mor02]. [Hem68, Khe72]. nd [Chu91]. nearest Mathematicians [Rob01]. Mathematics [CCGL99]. nearest-neighbor [CCGL99]. [Giv62, Ham65e, Ham84, Ham85b, Ham98a, neighbor [CCGL99]. Neighbour [GP13]. Ham01, Ham04, Jun62, Dur88, Ham65f, nets [Ale70]. Network Ham80a, Ham85a, Ham88a, Ham64]. [Chu01, Hun93, Maz03]. Networks Matrices [MP10, HPR04]. Matrix [VR06]. [CVB15, DM95]. Neumann [Ham92a]. max [LY08]. Maximum [DS04]. May Neural [Maz03]. News [Cer80]. Next [ACM97, ACM99, IS87]. McCracken [DM97]. Nick [HR00]. ninth [ACM97]. no [Kar77]. McGraw [Ham65a, Jun62, S.75]. [Ham85a]. Node [Hun93]. noise [TH49]. McGraw-Hill [Ham65a, Jun62, S.75]. Noisy [Eli55, Eli56, Eli74]. Nominal mean [Swe89]. means [DG17]. Measure [DG17]. Nominal-continuous [DG17]. [BKR01]. Measurement [BH53, Ham73b]. Non [DS04, Jai07]. Non-Hamming Measurements [Ham66a]. measures [DS04, Jai07]. Noninterpolatory [EH72]. [AGLP16]. Measuring [TH49]. Nonlinear [PL95]. nonrecursive [KH77]. Mechanization [Ham61a]. Medal [IEE18]. Norm [ZTYP12]. Normalized [AE03]. Meets [Bra73, SK10b, Tre00, Tre97]. Melas Norms [CDIM02]. Note [VV94]. Memory [LA01, CM95, HT90]. [Fen15, HM65, HH58]. Notes [Ham45b, Mentor [Man18]. Methods Ham47, Ham48, Ham70b, Ham71b, Bau09]. [Bar62, Cun73, Dav63, Ham62b, Ham73a, Notices [Cer80]. Notizen [Bau09]. Novel Ham85b, Ham86b, Ham88c, Ham04, Jun62, [CTL07, AB08]. November [Gal09]. NP Kar77, S.75, EQH00, Ham51b, Ham59e, [EKP85]. NP-completeness [EKP85]. Hem68, Khe72, Kle13]. metody Nuclear [MH59, MH63]. Number [Hun93]. [Hem68, Khe72]. Metric Numbers [Ham70d, Ham15b]. Numeral [Bal05, DG17, DS04, AKN13, WZYG17]. [Sta18]. Numerical Metropolis [HR00]. Microcircuit [Ale70]. [Bra73, Ham62b, Ham64, Ham65b, Ham65e, min [LY08]. minimal [AW91, AW93]. Ham65f, Ham71d, Ham73a, Ham86b, Minimizing [AE03]. Minimum Ham89c, Ham12a, HH65, Kar77, Ham66c, [LCWY12, PZ06, AKN13]. Minsky Ham74, Sca74, Hem68, Khe72, S.75, Bar62, [Ham68a]. Mission [Sta18]. Cun73, Dav63, Ham73c, Jun62]. Mission-Critical [Sta18]. Model [ORSW12, Swe89, TSS04]. modeling Observations [Bal96]. Olmo [IS87]. One [REF15]. Modern [Ham70a, Ham92a]. [Ham69a, Ham87a]. Opening [Cer80]. moments [SWH12, Swe89]. Monotone Optima [Ham68b]. Optimal [Ham45a, Ham46, Ham47, Ham48]. [CR12, DM95, SK10b, Zie01, Ahl06, CR11, monotonicity [AA05]. Monthly [Ham85a]. HPP+17, LPH14, RFZ14]. Optimization MR0559142 [Ham85a]. MST [Tre97]. [Ham68b]. order [RSV15b, She95]. 8

Ordinary [Kar77, Ham59e]. Origins Proceedings [ACM97, ACM99, ACM11, [Ham92a]. Other [Ham50b, Ham52, Kle13]. IS87, B+02, Gen83, SM10]. Process Output [HH01]. [Ham66a]. processing [KKI+15, TSM14]. Programming [MP10]. Properties P [Ham92b, Ham64]. packing [RZ12]. Pairs [Bal05, LPH14]. pseudo [SWH12]. [Gro06]. Paper [HH58]. papers [Sca74]. pseudo-Boolean [SWH12]. parabolic [Ham51b]. Paradox pseudorandom [PW14]. Publications [Ham89a, Sta18]. Parallel [KS17, GF08]. [Dav63, Ham51a]. Pylyshyn [Ham79]. Parameterized [AKKT16]. Part [Ham95a]. partial [Ham51b, HPP+17, LPH14]. Paso Quadrance [DG17]. Quadratic [MP10]. [ACM97]. Passage [Ano98b]. Pattern Quadrature [EH72, Kar77]. Quantum [AD11]. peak [TSS04]. People [Ham12b]. [AGSU15, MM12, Got96, SK10a]. Quasi Percolation [Siv14, GHPS15]. perfect [LMWC17]. Quasi-Hamming [LMWC17]. [Gui04]. Perfeitos [PP18]. Performance quasiperiodic [AIR17]. quasispecies [EQH00]. Period [AALS18]. Permanent [TSS04]. [Cer80]. permutation [WZYG17]. permutations [RSV15b]. Perspectives R [Bar62, Blo84, Bra73, Bul88, Cun73, [Ham79]. Peter [Ham65b, Gal09]. Phase Dav63, Kno88, Ter84]. R. [Dij76, S.75]. [HH65, vdHL10]. philosophy [Ham75b]. rabotnikov [Hem68, Khe72]. radio Phylogenetic [AP12]. physical [Mic85]. [KKI+15]. radius [SWH12]. Radix [Rob87]. physics [Ham00]. Pioneer [Fis98]. planet Random [Ham98a, Ham01]. Point [HM65, HK09]. [IS86, Ser11, vdHL10, FvdHH16, Ham66a]. Polya [HPS98]. polynomial [SWH12]. Random-Process [Ham66a]. Rank [OV04].¨ Polynomials [She95, Lev04]. Pooling rate [Isa05]. reasons [ALW+88]. [Ano14]. post [TSM14]. post-processing Recognizing [IK97]. recovery [AALS18]. [TSM14]. pp [Bul88, Ham65a, Ham68a, Reduced [SS02]. Reduces [Hun93]. Ham68b, Jun62, S.75, Ter78, Ter84]. pp. reducing [Ham69b, RM16]. Redundancy [Ham68d]. Practice [Ham73c]. pre [HRSC54, HRSC55, Chu01]. Reed [TSM14]. pre-processing [TSM14]. [Mit09, MZ02b]. Relative Predicted [Ano14]. predictor [Ham59e]. [BBZ17, LWW10, LCL08, ZLD13]. Preis [Kno88]. prejudices [Ham75b]. Relaxation [HH57, HH58]. relevant Prentice [Ham68a, Ham68b, Ter78, Ter84]. [Ham75a]. Remote [Ham69b]. repair Prentice-Hall [TSS04]. Repeats [GLM02]. Repetitions [Ham68a, Ham68b, Ter78, Ter84]. [KK01, KK03]. replication [Swe89]. prescribed [Gro06]. PRESENT [ZGZ+13]. replication-mutation [Swe89]. Report Press [Ham64, Ham68d]. Price [Bul88]. [Ham88c]. Reports [Giv62]. Primitive [She95]. Privacy [Ano14]. Representation [SS02, REF15]. private [WK14]. Probability representations [AW91, AW93]. Research [Gut92a, Gut92b, Ham85b, Ham91b, Ham04, [Ham86c, Kai09]. Resolving [OV04].¨ LA01, MS02]. Problem resonance [MH59, MH63]. Respond [LCWY12, Zie01, AKN13, CCM92, EKP85, [PSvE+89]. response [KH77]. responses HL02, HSZZ06, LY08, Sti02]. probl`eme [HK78]. retrieval [EQH00]. reverse [CCM92]. Problems [AGSU15, EDD+96, [TSM14]. reverse-complement [TSM14]. Ham42b, Ham42a, HPS98, MP10, CR02]. Review [Bar62, Blo84, Bul88, Cun73, 9

Gut92a, Gut92b, Ham64, Ham65a, Ham65b, Sequential [IS86]. serially [Isa05]. Series Ham66a, Ham68a, Ham68b, Ham68d, [Ham45a, Ham47, Ham48, Ham68a, Ham46]. Ham73c, Ham90a, Ham92a, Ham92b, Jun62, Set [Ser11]. Sets S.75, Ter78, Ter84, Tho73, Bra73]. Reviews [AE03, HLR01, LPH14, RFZ14]. Seventy [Ham56a, Ham56b, Ham56c, Ham57a, [ALW+88]. seventy-fifth [ALW+88]. Ham57b, Ham57c, Ham57d, Ham58a, Seventy-five [ALW+88]. Sharing Ham58b, Ham58c, Ham58d, Ham59a, [KSSY12]. sharpen [HK78]. Sharpening Ham59b, Ham59c, Ham59d, Ham60, Ham79, [KH77]. Shortened [LA01]. should Ham88b, Ham88c, Kar77]. Revolution [Ham12b]. Side [ORSW12, ZGZ+13]. [Ham63a, Ham66d, Ham68c, Ham61b, Side-Channel [ORSW12, ZGZ+13]. Signal Ham79]. Richard [SH90, SH99]. Signale [SH99]. Signalling [Ano14, Gut92a, Gut92b, IEE18, Jun62, [Gil52]. Signed [AW91, AW93]. similarity Mor02, Ter78, Tho73, Ano98a, Ano98b, [AGLP16, JP13]. Simovici [Ham92b]. Ano04, Bau07, Fis98, Kai09, Kar77, Lee98, Simple [HH01]. Simulation LP02, Man18, Mor98, OR12, Per93, Sac16]. [Ham62a, Ham66a, Maz03, Ham75a]. Ring [Ash98]. Rings [HS01]. Role Simultaneous [SS02]. Single [Ham73b]. Routing [CVB15]. Row [Sta18]. [BH53, TSS04]. single-fitness [TSS04]. Site Russian [Hem68, Khe72, Khe83]. [Cer80, Siv14]. Slow [Ano14]. Small [HRSC54, TZZ95, TZZ97, HRSC55, RSV15b]. S [Ham68b, Kar77]. sa [CCM92]. Safe Snowbird [SM10]. Societies [LMWC17]. salesman [EKP85]. saliency [Giv62, Ham73b]. Society [REF15]. same [KH77]. San [ACM11]. [Ham71c, Ham72, Tho73]. Soft [HH01]. SAR [B+02]. satisfaction [CR02]. Soft-Input [HH01]. satisfying [TSM14]. saturating [Got96]. Soft-Input/Soft-Output [HH01]. Scalar [SS02]. Scalars [SS02]. Scheme Soft-Output [HH01]. Software [CTL07, HPS98, KSSY12, LMWC17, AB08, [Ham96, KKI+15]. software-defined BBZ17, CCLL11, GM15]. Science [KKI+15]. sojourn [Tak96]. Solomon [Ham61a, Ham69a, Ham94, Ham95c, Ham97b, [Mit09]. Solution [Kar77, CCM92, TSS04]. Bau09, Gen83, Ham75b, Ham87a, Ham92b]. Solutions [EDD+96, HPS98]. Solving Scientific [Ham63b]. scientist [AKKT16, Ham51b]. Some [ALW+88, Mor02, ALW+88]. Scientists [GO06,¨ Ham42b, Ham42a, Ham51b, Sti02]. [Bar62, Cun73, Dav63, Gut92a, Gut92b, Sources [MC10]. Space Ham62b, Ham73a, Ham86b, Ham91b, Jun62, [Bal05, DG17, EL93, IK97, Mun06, RZ12]. S.75, Hem68, Khe72]. Scratchpad [CCM92]. Spaces [EIZ91, HLR01, Ost02,¨ OV04,¨ searching [CCGL99]. Second Ahl06, Avi81, HL02, Lev04]. spanning [Ter84, HK09, OLGP15, Swe89]. Secret [LY08]. sparse [REF15]. Spectral [KSSY12]. Section [Giv62]. Sections [BvDK08]. Sphere [DG17, RZ12]. spheres [Giv62]. Secure [JP13, CCLL11]. Seiten [SWH12]. Splitting [Hun93]. Stable [Kno88]. Self [RSV15b, KY15]. self-dual [Ham59e]. Standards [Ano98a]. State [KY15]. Self-embeddings [RSV15b]. [Ham63b]. Statistical [Ham68d]. Statistics Semantic [WZNM14]. semiconservative [Bra73, Ham66c, Ham85b, Ham90d, Ham04, [TSS04]. Semidefinite [MP10]. Sequence Gen83]. Steiner [AKN13, RSV15b, Tre00]. [AGLP16, LPH14]. Sequences [ZTYP12, step [Sti02]. Stiefel [Ham64]. STOC’11 HPL15, HPP+17, PW14, RFZ14, Tak96]. [ACM11]. stochastic [HPR04, Swe89]. 10

Strachey [Cer80]. Streams [CDIM02]. truth [Cus13]. TSP [Tre97, Tre00]. turbo string [GF08]. strings [AIR17, AALS18]. [CM95, Gui04, Mit09]. Turing [Ash87]. Stroud [Kar77]. Studies [Sca74, Kar77]. Twentieth [MHR80]. Twenty Subcodes [B+02, ACM97, Ash87]. Twenty-Eighth [LWW10, LCL08, RSV12, RSV15a]. [B+02]. twenty-ninth [ACM97]. Two subgraphs [FvdHH16, vdHL10]. Subseries [AIR17, Eli56, Liu09, HK09]. two-point [Ham47, Ham48]. Subspaces [Ost02].¨ [HK09]. Type [LCWY12, Jai07, LY08]. Subtraction [Rob87]. Sum [LCWY12, LY08]. Sum-Type Undetected [LA01]. Uniform [DS04]. [LCWY12, LY08]. sums [HY17]. Unit [CM95]. Unit-memory [CM95]. supercritical [vdHL10]. Superimposed units [KKI+15]. unreasonable [EL93]. symmetric [KH77]. Symposium [Ham80a, Ham85a]. untitled [Ham90a]. [ACM97, ACM99, ACM11, Gen83, Ham59f, Update [Ano98a]. Urn [HPS98]. USA IS87]. System [ACM11]. Use [Sta18, HH51, Ham69b, Lev04]. Systems [Bal05, Rob87, Ham88a, KH77, REF15]. [Ham62a, Sta18, Mic85, RSV15b]. Systolic Using [CDIM02, GLM02, Iza09, HK78, [Maz03]. Isa05, KKI+15]. Utah [SM10]. tables [Cus13]. Tandem [GLM02]. Value [Ham42b, Ham42a]. Variable Teaching [Ham88c]. Technical [Ham73b]. [Fen15, SK10b]. Variable-Length techniques [HPP+17]. Technology [Fen15, SK10b]. VCH [Bul88, Kno88]. [Ano14, Fis98]. Tennis [Ham89a]. Teoriya Verarbeitung [SH99]. Verlagsgesellschaft [Khe83]. test [Tak96]. tests [AP12]. Texas [Bul88, Kno88]. versus [TSM14]. Vertical [ACM97, Gen83]. Their [EQH00]. Vertices [HLR01]. Very [B+02]. [Chu91, Rob01, LCL08, LWW10]. theorem via [AP12, Sol00]. Video [WZNM14]. View [Ahl06]. Theory [Ham69a, Ham87a]. Villa [IS87]. Visual [ACM97, ACM99, ACM11, Ham42b, [WZNM14, REF15]. Visualization Ham42a, Ham68d, Ham73c, Ham80c, [LMWC17]. VLDB [B+02]. Volume Ham86a, Ham87b, Ham70a, Khe83, Ham88b]. [Ham92b]. Vorwort [Ham99]. VQ [CTL07]. Theresa [Ham65a]. Thermodynamic vs [Ham65e, Ham65f]. [TSM14]. Think [Ham51a, Ham97a, Ham12b]. Thinking W [Ano98b, Ano14, Bar62, Blo84, Bra73, [Ano14]. thirty [ACM99]. thirty-ﬁrst Bul88, Cun73, Dav63, Dij76, Gut92a, [ACM99]. Thought [Ham80b]. threshold Gut92b, Ham79, Ham92a, IEE18, Jun62, [FvdHH16]. thresholds [AD11]. Tilings Kar77, Kno88, LP02, Per93, S.75, Ter78, [OV04].¨ time [GF08, IK97, SWH12, Tak96]. Ter84, Tho73]. was [Ham91a]. Topological [CVB15]. TOPSIS [Iza09]. watermarking [CCLL11]. Weight Torus [Siv14, GHPS15]. Trace [GO06].¨ [AKKT16, Chu91, LS14, ORSW12, SS02, Transcendental She95, TZZ95, AW91, AW93, HK09, LCL08, [Ham45b, Ham70b, Ham70c]. transform OLGP15, Sti02, Tak96, TZZ97, VR06, [PW14]. transitivity [GP13]. transmission ZGZ+13, ZLD13]. weight-based [ZGZ+13]. [Chu01]. Tree [Tre00, AKN13, LY08]. trees Weighted [LCWY12, LY08]. Weights [AP12]. Trends [Ham97a]. Tribute [Ash98, Fen15, GO06,¨ HS01, LWW10, VV94, [Ano98a]. triple [RSV15b]. Trojan [Sta18]. Cus13, HY17]. Weinheim [Bul88, Kno88]. REFERENCES 11

Wesley Al-Bahadili:2008:NLD [Lee98, Man18, Mor98, OR12, Mor02]. Wilde [Ham68b]. William [Kar77]. [AB08] Hussein Al-Bahadili. A novel loss- Window [BBB17]. without [Cus13]. less data compression scheme based Words [WZNM14]. work [Ham12b]. on the error correcting Hamming Workshop [Ham88c]. World [BBB17]. codes. Computers and Mathe- worst [GF08]. Would [Ham80b]. matics with Applications, 56(1): 143–150, July 2008. CODEN x [Ham64]. xiv [Ham68b]. xvi [Ham68d]. CMAPDK. ISSN 0898-1221 (print), xviii [Ham68a]. xxiv [Ham65a]. 1873-7668 (electronic). URL http://www.sciencedirect.com/ Y2K [Ano98a]. Y2K-Compliant [Ano98a]. science/article/pii/S0898122107008334. Years [DM97, Ash87]. York [Ham64, Ham65a, Ham68d, Jun62, S.75]. ACM:1997:PTN [ACM97] ACM, editor. Proceedings of the Z. [Ham79]. Zero [CDIM02]. zone [HPL15, twenty-ninth annual ACM Sympo- HPP+17, LPH14]. zur [Bau09]. Zuse sium on the Theory of Computing: [Cer80]. El Paso, Texas, May 4–6, 1997. ACM Press, New York, NY 10036, USA, 1997. ISBN 0-89791-888-6. References LCCN QA76.5 .A849 1997. ACM Aider:2005:DMN order no. 508970. ACM:1999:PTF [AA05] M´eziane A¨ıder and Mustapha Aouchiche. Distance monotonicity [ACM99] ACM, editor. Proceedings of the and a new characterization of Ham- thirty-ﬁrst annual ACM Symposium ming graphs. Information Process- on Theory of Computing: Atlanta, ing Letters, 96(6):207–213, Decem- Georgia, May 1–4, 1999.ACM ber 31, 2005. CODEN IFPLAT. Press, New York, NY 10036, USA, ISSN 0020-0190 (print), 1872-6119 1999. ISBN 1-58113-067-8. LCCN (electronic). QA75.5 .A14 1999. ACM order number 508990. Amir:2018:PRS ACM:2011:SPA [AALS18] Amihood Amir, Mika Amit, Gad M. Landau, and Dina Sokol. [ACM11] ACM, editor. STOC’11: Proceed- Period recovery of strings over the ings of the 2011 ACM International Hamming and edit distances. The- Symposium on Theory of Comput- oretical Computer Science, 710(??): ing: June 6–8, 2011, San Jose, 2–18, February 1, 2018. CODEN CA, USA. ACM Press, New York, TCSCDI. ISSN 0304-3975 (print), NY 10036, USA, 2011. ISBN 1- 1879-2294 (electronic). URL 4503-0691-8. LCCN ???? URL http://www.sciencedirect.com/ http://www.gbv.de/dms/tib-ub- science/article/pii/S0304397517307752. hannover/63314455x.. REFERENCES 12

Atallah:2011:PMH distance problems. ACM Transac- tions on Computation Theory, 7(3): [AD11] Mikhail J. Atallah and Timo- 10:1–10:??, July 2015. CODEN ???? thy W. Duket. Pattern match- ISSN 1942-3454 (print), 1942-3462 ing in the Hamming distance (electronic). with thresholds. Information Pro- cessing Letters, 111(14):674–677, Ahlswede:2006:ADT July 31, 2011. CODEN IF- [Ahl06] R. Ahlswede. Another diametric PLAT. ISSN 0020-0190 (print), theorem in Hamming spaces: op- 1872-6119 (electronic). URL timal group anticodes. In 2006 http://www.sciencedirect.com/ IEEE Information Theory Work- science/article/pii/S0020019011001049. shop. IEEE Computer Society Azizouglu:2003:ESM Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, USA, [AE03] M. Cemil Azizouglu and Omer¨ Eu- 2006. geciouglu. Extremal sets minimizing Amir:2017:TSH dimension-normalized boundary in Hamming graphs. SIAM Journal on [AIR17] Amihood Amir, Costas S. Iliopou- Discrete Mathematics, 17(2):219– los, and Jakub Radoszewski. Two 236, 2003. CODEN SJDMEC. ISSN strings at Hamming distance 1 can- 0895-4801 (print), 1095-7146 (elec- not be both quasiperiodic. Infor- tronic). URL http://epubs.siam. mation Processing Letters, 128(??): org/sam-bin/dbq/article/37505. 54–57, December 2017. CODEN IFPLAT. ISSN 0020-0190 (print), Apostolico:2016:SSM 1872-6119 (electronic). URL [AGLP16] Alberto Apostolico, Concettina http://www.sciencedirect.com/ Guerra, Gad M. Landau, and science/article/pii/S0020019017301473. Cinzia Pizzi. Sequence similar- Akhtar:2008:ADE ity measures based on bounded Hamming distance. Theoretical [AJM08] Reza Akhtar, Tao Jiang, and Zevi Computer Science, 638(??):76–90, Miller. Asymptotic determination July 25, 2016. CODEN TC- of edge-bandwidth of multidimen- SCDI. ISSN 0304-3975 (print), sional grids and Hamming graphs. 1879-2294 (electronic). URL SIAM Journal on Discrete Mathe- http://www.sciencedirect.com/ matics, 22(2):425–449, ???? 2008. science/article/pii/S0304397516000475. CODEN SJDMEC. ISSN 0895-4801 (print), 1095-7146 (electronic). Ambainis:2015:LBD Aigner:1994:MLG [AGSU15] Andris Ambainis, William Gasarch, Aravind Srinivasan, and Andrey [AK94] Martin Aigner and Regina Klim- Utis. Lower bounds on the de- mek. Matchings in lattice graphs terministic and quantum commu- and Hamming graphs. Combina- nication complexity of Hamming- torics, Probability and Computing, REFERENCES 13

3(2):157–166, June 1994. CODEN Samuel C. Florman, Jeremy Bern- CPCOFG. ISSN 0963-5483 (print), stein, George A. Miller, Robert M. 1469-2163 (electronic). May, G. Evelyn Hutchinson, Jerome Bruner, Priscilla C. Grew, William Arvind:2016:SLE Bevan, Elisabeth S. Vrba, Myrdene [AKKT16] V. Arvind, Johannes Köbler, Se- Anderson, Kevin Padian, Harry bastian Kuhnert, and Jacobo Torán. Shipman, Victor F. Weisskopf, Wal- Solving linear equations parame- ter A. Hill, Patricia D. Moehlman, terized by Hamming weight. Al- Melvin Kranzberg, Malak Kotb, gorithmica, 75(2):322–338, June Raymond Kurzweil, Marcia Mc- 2016. CODEN ALGOEJ. ISSN Nutt, Masakazu Konishi, Miriam 0178-4617 (print), 1432-0541 (elec- Rothschild, Edward Teller, Ali- tronic). URL http://link. son Jolly, H. Jane Brockmann, springer.com/article/10.1007/ Keith Stewart Thomson, Peter J. s00453-015-0098-3. Denning, Benoˆıt B. Mandelbrot, Abraham Pais, Paul MacCready, Althaus:2013:LDS Kip S. Thorne, Ruth Sager, Ger- [AKN13] Ernst Althaus, Joschka Kupilas, ald J. Wasserburg, Neal E. Miller, and Rouven Naujoks. On the low- Rita Levi-Montalcini, Stephen Jay dimensional Steiner minimum tree Gould, Edwin H. Land, Michel problem in Hamming metric. The- Boudart, Anne Kernan, Douglas R. oretical Computer Science, 505(??): Hofstadter, Rosalyn S. Yalow, 2–10, September 23, 2013. CODEN Bruce H. Tiffney, Mimi Koehl, Wal- TCSCDI. ISSN 0304-3975 (print), ter E. Massey, David P. Billing- 1879-2294 (electronic). URL ton, John A. W. Kirsch, Abner Shi- http://www.sciencedirect.com/ mony, J. Donald Fernie, Brian J. science/article/pii/S0304397513001205. Skinner, Lynn Margulis, Shel- don Lee Glashow, Michael LaBar- Aleksander:1970:MLN bera, J. Tuzo Wilson, E. R. Ward Neale, Rudolf Peierls, Roald Hoff- [Ale70] I. Aleksander. Microcircuit learn- mann, Mary L. Good, Donald R. ing nets: Hamming-distance be- Griffin, Vaclav Smil, Michael S. haviour. Electronics Letters, 6(5): Turner, Sarah Ann Woodin, Luis 134–??, 1970. CODEN ELLEAK. Alvarez, George A. Bartholomew, ISSN 0013-5194 (print), 1350-911X and George B. Schaller. Seventy- (electronic). five reasons to become a scientist: Arnheim:1988:SFR American Scientist celebrates its seventy-fifth anniversary. American [ALW+88] Rudolf Arnheim, Thomas E. Love- Scientist, 76(5):450–463, Septem- joy, David Gordon Wilson, Freeman ber 1988. CODEN AMSCAC. Dyson, Jane Goodall, Ian Shelton, ISSN 0003-0996 (print), 1545-2786 Kenneth H. Olsen, Irene C. Peden, (electronic). URL http://www. Richard W. Hamming, Thomas Eis- jstor.org/stable/27855384; ner, Preston Cloud, Matt Cartmill, http://www.jstor.org/stable/ REFERENCES 14

pdfplus/27855384.pdf. Loss of privacy, pooling of data and the slow blurring of the dis- Anonymous:1998:CUCa tinction between human and ma- [Ano98a] Anonymous. CS update: CS chine “thinking”. Web site., De- launches Y2K-compliant standards cember 13, 2014. URL http: effort; tribute to Richard Ham- //stuffnobodycaresabout.com/ ming. Computer, 31(3):85–87, 2014/12/13/harmful-effects-computer- March 1998. CODEN CPTRB4. technology-predicted-1961/. ISSN 0018-9162 (print), 1558-0814 Anselmo:2012:PTH (electronic). URL http://pdf. computer.org/co/books/co1998/ [AP12] Cézar A. F. Anselmo and Alu´ısio pdf/r3085.pdf. Pinheiro. Phylogenetic trees via Hamming distance decomposition Anonymous:1998:PRW tests. Journal of Statistical Compu- [Ano98b] Anonymous. Passage: Richard tation and Simulation, 82(9):1287– W. Hamming, 82. Wired,?? 1297, 2012. CODEN JSCSAJ. ISSN (??):??, January 8, 1998. CO- 0094-9655 (print), 1026-7778 (elec- DEN WREDEM. ISSN 1059- tronic), 1563-5163. 1028 (print), 1078-3148 (elec- Ashenhurst:1987:ATA tronic). URL https://www.wired. com/1998/01/passage-richard- [Ash87] Robert L. Ashenhurst, editor. ACM w-hamming-82/. Turing Award Lectures: the first twenty years, 1966–1985.ACM Anonymous:2004:RH Press anthology series. ACM Press [Ano04] Anonymous. Richard Hamming. and Addison-Wesley, New York, NY In Simon Read, editor, Biographies 10036, USA and Reading, MA, of Famous Computer Scientists, USA, 1987. ISBN 0-201-07794-9. page 24. Creative Commons, ????, xviii + 483 pp. LCCN QA76.24 .A33 2004. URL https://archive.org/ 1987. details/ost-computer-science- Ashikhmin:1998:GHW biographies_screen. From the introduction: “The biographies in [Ash98] Alexei Ashikhmin. On generalized this document have been researched Hamming weights for Galois ring and written by students as an as- linear codes. Designs, Codes, and signment in an Introduction to Cryptography, 14(2):107–126, May Computer Science course and then 1998. CODEN DCCREC. ISSN checked and edited by the editor of 0925-1022 (print), 1573-7586 (elec- this document”. tronic). URL http://www.wkap. nl/oasis.htm/156974. Anonymous:2014:DRW Avis:1981:HSH [Ano14] Anonymous. In 1961 Dr. Richard W. Hamming predicted the harm- [Avi81] David Avis. Hypermetric spaces and ful effects of computer technology: the Hamming cone. Canadian Jour- REFERENCES 15

nal of Mathematics = Journal cana- Balakirsky:2005:HDU dien de math´ematiques, 33(??):795– 802, ???? 1981. CODEN CJMAAB. [Bal05] Vladimir B. Balakirsky. Hash- ISSN 0008-414X (print), 1496-4279 ing of databases with the use (electronic). of metric properties of the Ham- ming space. The Computer Jour- Arno:1991:SDR nal, 48(1):4–16, January 2005. [AW91] Steven Arno and Ferrell S. Wheeler. CODEN CMPJA6. ISSN 0010- Signed digit representations of min- 4620 (print), 1460-2067 (electronic). imal Hamming weight. Technical URL http://www3.oup.co.uk/ report SRC-TR-91-046, Supercom- computer_journal/hdb/Volume_ puting Research Center: IDA, Lan- 48/Issue_01/bxh059.sgm.abs.html; ham, MD, USA, July 1991. 18 pp. http://www3.oup.co.uk/computer_ journal/hdb/Volume_48/Issue_ Arno:1993:SDR 01/pdf/bxh059.pdf. [AW93] S. Arno and F. S. Wheeler. Signed Barnett:1962:BRB digit representations of minimal Hamming weight. IEEE Transac- [Bar62] V. D. Barnett. Book review: Nu- tions on Computers, 42(8):1007– merical Methods for Scientists and 1010, August 1993. CODEN IT- Engineers, by R. W. Hamming. COB4. ISSN 0018-9340 (print), Journal of the Royal Statistical Soci- 1557-9956 (electronic). URL http: ety. Series A (General), 125(4):642– //ieeexplore.ieee.org/stamp/ 643, ???? 1962. CODEN JSSAEF. stamp.jsp?tp=&arnumber=238495. ISSN 0035-9238. URL http://www. Bernstein:2002:VPT jstor.org/stable/2982636. [B+02] Philip A. Bernstein et al., editors. Bauer:2007:RHF VLDB 2002: proceedings of the [Bau07] Friedrich L. Bauer. Richard Ham- Twenty-Eighth International Con- ming: Fehlerkorrigierende Codes. ference on Very Large Data Bases, (German) [Richard Hamming: Er- Hong Kong SAR, China, 20–23 Au- ror correcting codes]. Informatik gust 2002. Morgan Kaufmann Pub- Spektrum, 30(2):??, ???? 2007. CO- lishers, Los Altos, CA 94022, USA, DEN INSKDW. URL http:// 2002. ISBN 1-55860-869-9. LCCN link.springer.com/article/10. ???? 1007/s00287-006-0135-3. Balakirsky:1996:HDB Bauer:2009:RHF [Bal96] V. B. Balakirsky. Hashing of databases based on indirect observa- [Bau09] Friedrich L. Bauer. Historische tions of Hamming distances. IEEE Notizen zur Informatik. (German) Transactions on Information The- [Historical notes on computer sci- ory, 42(2):664–671, March 1, 1996. ence]. Springer-Verlag, Berlin, Ger- CODEN IETTAW. ISSN 0018-9448 many / Heidelberg, Germany / Lon- (print), 1557-9654 (electronic). don, UK / etc., 2009. ISBN 3- REFERENCES 16

540-85790-7. x + 454 pp. LCCN Bookstein:2001:FHD QA76.17 .B38 2009. [BKR01] Abraham Bookstein, Shmuel Tomi Bojkovic:2017:HWD Klein, and Timo Raita. Fuzzy Hamming distance: A new dis- [BBB17] Zoran S. Bojkovic, Bojan M. Bak- similarity measure (extended ab- maz, and Miodrag R. Bakmaz. stract). Lecture Notes in Com- Hamming window to the digi- puter Science, 2089:86–??, 2001. tal world. Proceedings of the CODEN LNCSD9. ISSN 0302- IEEE, 105(6):1184–1189, June 2017. 9743 (print), 1611-3349 (electronic). CODEN IEEPAD. ISSN 0018- URL http://link.springer-ny. 9219 (print), 1558-2256 (electronic). com/link/service/series/0558/ URL https://ieeexplore.ieee. bibs/2089/20890086.htm; http: org/stamp/stamp.jsp?arnumber= //link.springer-ny.com/link/ 7931733. service/series/0558/papers/2089/ 20890086.pdf. Balogh:2008:BDH Bloomfield:1984:BRD [BBHS08] J. Balogh, S. L. Bezrukov, L. H. [Blo84] Peter Bloomfield. Book review: Harper, and A. Seress. On the Digital Filters (2nd ed.) by R. bandwidth of 3-dimensional Ham- W. Hamming. Journal of the ming graphs. Theoretical Computer American Statistical Association, Science, 407(1–3):488–495, Novem- 79(387):736–737, September 1984. ber 6, 2008. CODEN TCSCDI. CODEN JSTNAL. ISSN 0162- ISSN 0304-3975 (print), 1879-2294 1459 (print), 1537-274X (elec- (electronic). tronic). URL http://www.jstor. . Bannai:2017:RDB org/stable/2288442 Brainerd:1973:HMS [BBZ17] Eiichi Bannai, Etsuko Bannai, and Yan Zhu. Relative t-designs in bi- [Bra73] Barron Brainerd. The humanist nary Hamming association scheme meets statistics: [review of Introduc- H(n, 2). Designs, Codes, and Cryp- tion to Applied Numerical Analysis tography, 84(1–2):23–53, July 2017. by R. W. Hamming]. Computers CODEN DCCREC. ISSN 0925-1022 and the Humanities, 7(6):445–446, (print), 1573-7586 (electronic). 1973. CODEN COHUAD. ISSN 0010-4817 (print), 1572-8412 (elec- Bozorth:1953:MMS tronic). URL http://www.jstor. org/stable/30199619. [BH53] R. M. Bozorth and R. W. Hamming. Bultheel:1988:BRD Measurement of magnetostriction in single crystals. Physical Review,89 [Bul88] A. Bultheel. Book review: Dig- (4):865–869, February 1953. CO- itale filter: Hamming R. W. In- DEN PHRVAO. ISSN 0031-899X formationstechnologie VCH Ver- (print), 1536-6065 (electronic). lagsgesellschaft, Weinheim, F. REFERENCES 17

R. Germany, 1987, 275 pp., ware, 84(9):1462–1470, Septem- Price: DM 64, ISBN 3-527-26463- ber 2011. CODEN JSSODM. 9. Journal of Computational ISSN 0164-1212 (print), 1873-1228 and Applied Mathematics, 24(3): (electronic). URL http://www. N3, December 1988. CODEN sciencedirect.com/science/article/ JCAMDI. ISSN 0377-0427 (print), pii/S0164121211000549. 1879-1778 (electronic). URL http://www.sciencedirect.com/ Camion:1992:PCG science/article/pii/0377042788903068[CCM92]. Paul Camion, Bernard Courteau, Bang:2008:SCH and Andre Montpetit. Un probl`eme combinatoire dans les graphes de [BvDK08] Sejeong Bang, Edwin R. van Hamming et sa solution en Scratch- Dam, and Jack H. Koolen. Spec- pad. (English: A combinatorial tral characterization of the Ham- problem in Hamming graphs and its ming graphs. Linear Algebra and solution in Scratchpad). Rapports Its Applications, 429(11–12):2678– de recherche 1586, Institut National 2686, December 1, 2008. CODEN de Recherche en Informatique et en LAAPAW. ISSN 0024-3795 (print), Automatique, Le Chesnay, France, 1873-1856 (electronic). January 1992. 12 pp.

Chakrabarti:1999:LBC Cormode:2002:CDS

[CCGL99] Amit Chakrabarti, Bernard Chazelle,[CDIM02] Graham Cormode, Mayur Datar, Benjamin Gum, and Alexey Lvov. Piotr Indyk, and S. Muthukrish- A lower bound on the complex- nan. Comparing data streams using ity of approximate nearest-neighbor Hamming norms (how to zero in). In searching on the Hamming cube. Bernstein et al. [B+02], pages 335– In ACM [ACM99], pages 305– 345. ISBN 1-55860-869-9. LCCN 311. ISBN 1-58113-067-8. LCCN ???? URL http://www.vldb.org/ QA75.5 .A14 1999. URL http: conf/2002/S10P02.pdf. //www.acm.org/pubs/articles/ Ceruzzi:1980:NNO proceedings/stoc/301250/p305- chakrabarti/p305-chakrabarti. [Cer80] Paul Ceruzzi. News and no- pdf; http://www.acm.org/pubs/ tices: Opening of Digital Com- citations/proceedings/stoc/301250/ puter Museum; Strachey Collec- p305-chakrabarti/. ACM order tion completed; anniversary of number 508990. Hamming codes; CBI chooses Chang:2011:SFW permanent site; honorary degree awarded to Konrad Zuse. An- [CCLL11] Chin-Chen Chang, Kuo-Nan Chen, nals of the History of Comput- Chin-Feng Lee, and Li-Jen Liu. A ing, 2(3):273–274, July/September secure fragile watermarking scheme 1980. CODEN AHCOE5. ISSN based on chaos-and-Hamming code. 0164-1239. URL http://dlib. The Journal of Systems and Soft- computer.org/an/books/an1980/ REFERENCES 18

pdf/a3273.pdf; http://www. Computer Science, 288(1):85–100, computer.org/annals/an1980/a3273abs. September 2002. CODEN TCSCDI. htm. ISSN 0304-3975 (print), 1879-2294 Chung:1991:NGH (electronic).

[Chu91] H. Chung. The 2-nd generalized Chakrabarti:2011:OLB Hamming weight of double-error correcting binary BCH codes and [CR11] Amit Chakrabarti and Oded Regev. their dual codes. Lecture Notes An optimal lower bound on the in Computer Science, 539:118–??, communication complexity of gap- 1991. CODEN LNCSD9. ISSN Hamming-distance. In ACM 0302-9743 (print), 1611-3349 (elec- [ACM11], pages 51–60. ISBN 1- tronic). 4503-0691-8. LCCN ???? URL http://www.gbv.de/dms/tib-ub- Chung:2001:NAH hannover/63314455x..

[Chu01] Sei-Jong Chung. Network ar- Chakrabarti:2012:OLB chitecture: Hamming codes and cyclic redundancy for transmis- [CR12] Amit Chakrabarti and Oded Regev. sion error correction. SIGCSE An optimal lower bound on the Bulletin (ACM Special Interest communication complexity of gap- Group on Computer Science Ed- Hamming-distance. SIAM Jour- ucation), 33(4):48–50, December nal on Computing, 41(5):1299–1317, 2001. CODEN SIGSD3. ISSN ???? 2012. CODEN SMJCAT. 0097-8418 (print), 2331-3927 (elec- ISSN 0097-5397 (print), 1095-7111 tronic). URL ftp://ftp.math. (electronic). utah.edu/pub/mirrors/ftp.ira. uka.de/bibliography/Misc/DBLP/ Chang:2007:NIH 2001.bib. [CTL07] Chin-Chen Chang, Wei-Liang Tai, Cheng:1995:UMH and Chia-Chen Lin. A novel image hiding scheme based on VQ and [CM95] Jung-Fu Cheng and R. J. McEliece. Hamming distance. Fundamenta Unit-memory Hamming turbo Informaticae, 77(3):217–228, July codes. In Proceedings of 1995 IEEE 2007. CODEN FUMAAJ. ISSN International Symposium on Infor- 0169-2968 (print), 1875-8681 (elec- mation Theory. IEEE Computer tronic). Society Press, 1109 Spring Street, Suite 300, Silver Spring, MD 20910, Cunningham:1973:RNM USA, 1995. Crescenzi:2002:HDC [Cun73] W. J. Cunningham. Review: Nu- merical Methods for Scientists and [CR02] P. Crescenzi and G. Rossi. On Engineers (2nd ed.) by R. W. Ham- the Hamming distance of constraint ming. American Scientist, 61(5): satisfaction problems. Theoretical 605, ???? 1973. REFERENCES 19

Cusick:2013:FHW CODEN FUMAAJ. ISSN 0169-2968 (print), 1875-8681 (electronic). [Cus13] Thomas W. Cusick. Finding Hamming weights without look- Dijkstra:1976:EARb ing at truth tables. Cryptogra- phy and Communications: Dis- [Dij76] Edsger W. Dijkstra. An exercise at- crete Structures, Boolean Func- tributed to R. W. Hamming, chap- tions and Sequences, 5(1):7–18, ter 17. Prentice-Hall, Upper Saddle March 2013. CODEN ???? River, NJ 07458, USA, 1976. ISSN 1936-2447 (print), 1936- 2455 (electronic). URL http:// Das:1995:OEH link.springer.com/accesspage/ article/10.1007/s12095-012-0072-[DM95] S. K. Das and A. Mao. Optimal em- 8. beddings in the Hamming cube networks. Lecture Notes in Computer Camarero:2015:TCH Science, 966:205–??, 1995. CODEN [CVB15] Cristóbal Camarero, Enrique Vallejo, LNCSD9. ISSN 0302-9743 (print), and Ramón Beivide. Topological 1611-3349 (electronic). characterization of Hamming and dragonfly networks and its impli- Denning:1997:BCN cations on routing. ACM Transac- tions on Architecture and Code Op- [DM97] Peter J. Denning and Robert M. timization, 11(4):39:1–39:??, Jan- Metcalfe, editors. Beyond Calcu- uary 2015. CODEN ???? ISSN lation: The Next Fifty Years of 1544-3566 (print), 1544-3973 (elec- Computing. Springer-Verlag, Berlin, tronic). Germany / Heidelberg, Germany / London, UK / etc., 1997. ISBN 0- Davis:1963:RPN 387-94932-1, 0-387-98588-3 (paperback), 1-4612-0685-5. xviii + 313 [Dav63] Philip J. Davis. Recent publica- pp. LCCN QA76 .D348 1997. tions: Numerical Methods for Sci- entists and Engineers,byR.W. Dougherty:2004:MDC Hamming. American Mathematical Monthly, 70(2):229, February 1963. [DS04] Steven T. Dougherty and Keisuke CODEN AMMYAE. ISSN 0002- Shiromoto. Maximum distance 9890 (print), 1930-0972 (electronic). codes in Matn,s(Zk) with a non- Denisiuk:2017:LDE Hamming metric and uniform distributions. Designs, Codes, and [DG17] Aleksander Denisiuk and Michal Cryptography, 33(1):45–61, August Grabowski. Low distortion embed- 2004. CODEN DCCREC. ISSN ding of the Hamming space into 0925-1022 (print), 1573-7586 (elec- a sphere with quadrance metric tronic). URL http://ipsapp008. and k-means clustering of nominal- kluweronline.com/IPS/content/ continuous data. Fundamenta Infor- ext/x/J/4630/I/63/A/4/abstract. maticae, 153(3):221–233, ???? 2017. htm. REFERENCES 20

Duren:1988:CMA completeness of the Hamming salesman problem. BIT (Nordisk tid- [Dur88] Peter Duren. A century of math- skrift for informationsbehandling), ematics in America, volume 1 of 25(1):289–292, March 1985. CO- History of mathematics. American DEN BITTEL, NBITAB. ISSN Mathematical Society, Providence, 0006-3835 (print), 1572-9125 (elec- RI, USA, 1988. ISBN 0-8218-0124- tronic). URL http://www. 4. viii + 477 pp. LCCN QA27.U5 springerlink.com/openurl.asp? C46 1988. genre=article&issn=0006-3835& Eggleton:1996:PSP volume=25&issue=1&spage=289. [EDD+96] Roger B. Eggleton, Emeric Deutsch, Ericson:1993:SCH Dragomir Z. Dokovic, Richard Ham- ming, Roger Pinkham, Fu-Chuen [EL93] T. Ericson and V. Levenshtein. Chang, David Callan, and Hauke Superimposed codes in Hamming Reddmann. Problems and solutions: space. In Proceedings. IEEE Inter- Problems: 10501–10507. Ameri- national Symposium on Information can Mathematical Monthly, 103(2): Theory, page ?? IEEE Computer 171–172, ???? 1996. CODEN AM- Society Press, 1109 Spring Street, MYAE. ISSN 0002-9890 (print), Suite 300, Silver Spring, MD 20910, 1930-0972 (electronic). USA, 1993. Epstein:1972:NQF Elias:1955:CNC [EH72] M. P. Epstein and R. W. Ham- [Eli55] Peter Elias. Coding for noisy ming. Noninterpolatory quadrature channels. IRE Convention Record, formulas. SIAM Journal on Numer- 3(4):37–46, ???? 1955. URL ical Analysis, 9(3):464–475, Septem- http://web.mit.edu/6.441/www/ ber 1972. CODEN SJNAAM. ISSN reading/hd2.pdf. 0036-1429 (print), 1095-7170 (elec- Elias:1956:CTN tronic). [Eli56] Peter Elias. Coding for two noisy Ericson:1991:GCH channels. In Information Theory: [EIZ91] T. Ericson, I. Ingemarsson, and Third London Symposium, pages V. Zinoviev. Group codes in 61–74. Butterworth Scientiﬁc, Lon- Hamming spaces. In Proceedings. don, UK, 1956. 1991 IEEE International Sympo- Elias:1974:CNC sium on Information Theory, page 351. IEEE Computer Society Press, [Eli74] Peter Elias. Coding for noisy chan- 1109 Spring Street, Suite 300, Silver nels. In Elwyn R. Berlekamp, editor, Spring, MD 20910, USA, 1991. Key Papers in the Development of Ernvall:1985:NCH Coding Theory, IEEE Press selected reprint series. IEEE Computer Soci- [EKP85] Jarmo Ernvall, Jyrki Katajainen, ety Press, 1109 Spring Street, Suite and Martti Penttonen. NP- 300, Silver Spring, MD 20910, USA, REFERENCES 21

1974. ISBN 0-87942-031-6, 0-87942- CODEN ???? ISSN 1083-589X. 032-4 (paperback). LCCN QA268 URL https://projecteuclid. .B47. org/euclid.ecp/1457978024. El-Qawasmeh:2000:PIH Gallager:2009:PEN [EQH00] Eyas El-Qawasmeh and Ismail Hmeidi. Performance investigation [Gal09] Robert G. Gallager. Peter Elias of Hamming Distance Bit Vertical (November 26, 1923–December 7, Counter applied to access methods 2001). Biographical memoirs — Na- in information retrieval. Journal tional Academy of Sciences of the of the American Society for Infor- United States of America, 91(??): mation Science, 51(5):427–431, ???? 108–122, 2009. URL https://www. 2000. CODEN AISJB6. ISSN 0002- nap.edu/read/12776/chapter/7. 8231 (print), 1097-4571 (electronic). Gentle:1983:CSS Fenwick:2015:NVL [Gen83] James E. Gentle, editor. Computer [Fen15] P. Fenwick. A note on variable- science and statistics: proceedings length codes with constant Ham- of the Fifteenth Symposium on the ming weights. J.UCS: Journal of Interface, Houston, Texas, March Universal Computer Science, 21(9): 1983. North-Holland, Amsterdam, 1136–??, ???? 2015. CODEN ???? The Netherlands, 1983. ISBN 0- ISSN 0948-695X (print), 0948-6968 444-86688-4 (paperback). LCCN (electronic). URL http://www. QA276.4 .S95 1983. jucs.org/jucs_21_9/a_note_on_ variable. Grabowski:2008:BPS Fisher:1998:RHD [GF08] Szymon Grabowski and Kimmo Fredriksson. Bit-parallel string [Fis98] Lawrence M. Fisher. Richard matching under Hamming distance Hamming, 82, dies; pioneer in in O(ndm/we) worst case time. In- digital technology. New York formation Processing Letters, 105 Times, ??(??):29, January 11, 1998. (5):182–187, February 29, 2008. CODEN NYTIAO. ISSN 0362- CODEN IFPLAT. ISSN 0020-0190 4331 (print), 1542-667X, 1553-8095. (print), 1872-6119 (electronic). URL https://search.proquest. com/hnpnewyorktimes/docview/ Gravner:2015:BPH 109909823/. Federico:2016:CTR [GHPS15] Janko Gravner, Christopher Hoff- man, James Pfeiffer, and David [FvdHH16] Lorenzo Federico, Remco van der Sivakoff. Bootstrap percolation Hofstad, and Tim Hulshof. Con- on the Hamming torus. An- nectivity threshold for random sub- nals of Applied Probability, 25(1): graphs of the Hamming graph. Elec- 287–323, February 2015. CO- tronic Communications in Probabil- DEN ???? ISSN 1050-5164 ity, 21(??):27:1–27:8, ???? 2016. (print), 2168-8737 (electronic). REFERENCES 22

URL http://projecteuclid.org/ Godsil:2015:HS euclid.aoap/1418740187. [GM15] Christopher Godsil and Karen Gilbert:1952:CSA Meagher. The Hamming scheme. In Erd˝os–Ko–Rado Theorems: Al- gebraic Approaches, pages 184–209. [Gil52] E. N. Gilbert. A comparison Cambridge University Press, Cam- of signalling alphabets. The bridge, UK, 2015. ISBN 1-107- Bell System Technical Journal,31 12844-7 (hardcover), 1-316-41495-7 (3):504–522, May 1952. CO- (e-book). LCCN QA164 .G63 2016. DEN BSTJAN. ISSN 0005-8580. URL http://bstj.bell-labs. Guneri:2006:IGH com/BSTJ/images/Vol31/bstj31- 3-504.pdf; http://www.alcatel-[GO06]¨ Cem G¨uneri and Ferruh Ozbudak.¨ lucent.com/bstj/vol31-1952/articles/ Improvements on generalized Ham- bstj31-3-504.pdf. ming weights of some trace codes. Designs, Codes, and Cryptogra- Givens:1962:RSS phy, 39(2):215–231, May 2006. CODEN DCCREC. ISSN 0925- [Giv62] Wallace Givens. Reports of sec- 1022 (print), 1573-7586 (elec- tions and societies: Mathemat- tronic). URL http://www. ics (section a). Science, 135 springerlink.com/openurl.asp? (3503):547–549, February 16, 1962. genre=article&issn=0925-1022& CODEN SCIEAS. ISSN 0036- volume=39&issue=2&spage=215. 8075 (print), 1095-9203 (elec- Gottesman:1996:CQE tronic). URL http://science. sciencemag.org/content/135/3503/[Got96] Daniel Gottesman. Class of quan- 547.full.pdf. tum error-correcting codes saturating the quantum Hamming bound. Groult:2002:ETR Physical Review A (Atomic, Molec- ular, and Optical Physics), 54:1862– [GLM02] Richard Groult, Martine L´eonard, 1868, September 1996. CODEN and Laurent Mouchard. Evolu- PLRAAN. ISSN 1050-2947 (print), tive tandem repeats using Hamming 1094-1622, 1538-4446, 1538-4519. distance. Lecture Notes in Com- URL https://link.aps.org/doi/ puter Science, 2420:292–??, 2002. 10.1103/PhysRevA.54.1862. CODEN LNCSD9. ISSN 0302- Gillespie:2013:NTC 9743 (print), 1611-3349 (electronic). URL http://link.springer.de/ [GP13] Neil I. Gillespie and Cheryl E. link/service/series/0558/bibs/ Praeger. Neighbour transitivity on 2420/24200292.htm; http:// codes in Hamming graphs. De- link.springer.de/link/service/ signs, Codes, and Cryptography,67 series/0558/papers/2420/24200292. (3):385–393, June 2013. CODEN pdf. DCCREC. ISSN 0925-1022 (print), REFERENCES 23

1573-7586 (electronic). URL http: (electronic). URL http://www. //link.springer.com/article/ jstor.org/stable/1269264. 10.1007/s10623-012-9614-5. Hamming:1942:SPBb Grolmusz:2006:PCP [Ham42a] Richard W. Hamming. Some Prob- [Gro06] Vince Grolmusz. Pairs of codes lems in the Boundary Value The- with prescribed Hamming distances ory of Linear Diﬀerential Equa- and coincidences. Designs, Codes, tions. PhD thesis, University and Cryptography, 41(1):87–99, Oc- of Illinois at Urbana-Champaign, tober 2006. CODEN DCCREC. Urbana-Champaign, IL, USA, 1942. ISSN 0925-1022 (print), 1573-7586 26 pp. URL http://gateway. (electronic). URL http://www. proquest.com/openurl?url_ver= springerlink.com/openurl.asp? Z39.88-2004. Thesis (Ph.D.)– genre=article&issn=0925-1022& University of Illinois at Urbana- volume=41&issue=1&spage=87. Champaign. Guizzo:2004:CPC Hamming:1942:SPBa [Gui04] Erico Guizzo. Closing in on [Ham42b] Richard Wesley Hamming. Some the perfect code [turbo codes]. problems in the boundary value the- IEEE Spectrum, 41(3):36–42, March ory of linear diﬀerential equations, 2004. CODEN IEESAM. ISSN 1942. Abstract of a thesis. 0018-9235 (print), 1939-9340 (electronic). URL https://spectrum. Hamming:1945:CMS ieee.org/computing/software/ closing-in-on-the-perfect-code. [Ham45a] R. W. Hamming. Convergent monotone series. American Math- Guttorp:1992:BRA ematical Monthly, 52(2):70–72, February 1945. CODEN AMMYAE. [Gut92a] Peter Guttorp. Book review: The ISSN 0002-9890 (print), 1930-0972 Art of Probability for Scientists and (electronic). Engineers by Richard W. Ham- ming. Technometrics, 34(2):242, Hamming:1945:DNT May 1992. CODEN TCMTA2. ISSN 0040-1706 (print), 1537-2723 [Ham45b] R. W. Hamming. Discussions and (electronic). URL http://www. notes: The transcendental character jstor.org/stable/1269264. of cos X. American Mathematical Monthly, 52(6):336–337, ???? 1945. Guttorp:1992:BRB CODEN AMMYAE. ISSN 0002- 9890 (print), 1930-0972 (electronic). [Gut92b] Peter Guttorp. Book review: The Art of Probability for Scientists and Hamming:1946:MS Engineers by Richard W. Ham- ming. Technometrics, 34(2):242, [Ham46] R. W. Hamming. Monotone series. May 1992. CODEN TCMTA2. American Journal of Mathematics, ISSN 0040-1706 (print), 1537-2723 68(??):133–136, ???? 1946. CODEN REFERENCES 24

AJMAAN. ISSN 0002-9327 (print), Hamming:1951:RPG 1080-6377 (electronic). [Ham51a] R. W. Hamming. Recent publi- Hamming:1947:MNS cations: Giant brains, or machines that think. American Mathematical [Ham47] R. W. Hamming. Mathematical Monthly, 58(4):276, ???? 1951. CO- notes: Subseries of a monotone di- DEN AMMYAE. ISSN 0002-9890 vergent series. American Mathemat- (print), 1930-0972 (electronic). ical Monthly, 54(8):462–463, Octo- ber 1947. CODEN AMMYAE. ISSN Hamming:1951:SMS 0002-9890 (print), 1930-0972 (elec- [Ham51b] Richard W. Hamming. Some tronic). See corrections [Ham48]. methods of solving hyperbolic and Hamming:1948:CSM parabolic partial diﬀerential equations. In Proceedings, Computation [Ham48] R. W. Hamming. Mathemat- Seminar, December 1949, pages 14– ical notes: Corrections: Sub- 23. International Business Machines series of monotone divergent se- Corporation, New York, NY, USA, ries. American Mathematical 1951. Monthly, 55(6):360, June 1948. CO- Hamming:1952:OAC DEN AMMYAE. ISSN 0002-9890 (print), 1930-0972 (electronic). See [Ham52] Richard W. Hamming. Other aids [Ham47]. to computation. Mathematics of Computation, 6(40):248, October Hamming:1950:EDE 1952. CODEN MCMPAF. ISSN 0025-5718 (print), 1088-6842 (elec- [Ham50a] R. W. Hamming. Error detect- tronic). ing and error correcting codes. The Bell System Technical Jour- Hamming:1956:BRa nal, 29(2):147–160, April 1950. [Ham56a] R. W. Hamming. Book reviews. CODEN BSTJAN. ISSN 0005- Journal of the ACM, 3(2):112–113, 8580 (print), 2376-7154 (electronic). April 1956. CODEN JACOAH. URL http://bstj.bell-labs. ISSN 0004-5411 (print), 1557-735X com/BSTJ/images/Vol29/bstj29- (electronic). 2-147.pdf; http://www.alcatel- lucent.com/bstj/vol29-1950/articles/ Hamming:1956:BRb bstj29-2-147.pdf. [Ham56b] R. W. Hamming. Book reviews. Hamming:1950:OAC Journal of the ACM, 3(3):239, July 1956. CODEN JACOAH. ISSN [Ham50b] R. W. Hamming. Other aids 0004-5411 (print), 1557-735X (elec- to computation. Mathematics of tronic). Computation, 4(32):239–244, 1950. Hamming:1956:BRc CODEN MCMPAF. ISSN 0025- 5718 (print), 1088-6842 (electronic). [Ham56c] R. W. Hamming. Book reviews. cited By 0. Journal of the ACM, 3(4):376–378, REFERENCES 25

October 1956. CODEN JACOAH. Hamming:1958:BRa ISSN 0004-5411 (print), 1557-735X (electronic). [Ham58a] R. W. Hamming. Book reviews. Journal of the ACM, 5(1):116, Jan- Hamming:1957:BRa uary 1958. CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X [Ham57a] R. W. Hamming. Book reviews. (electronic). Journal of the ACM, 4(1):93–94, January 1957. CODEN JACOAH. Hamming:1958:BRb ISSN 0004-5411 (print), 1557-735X [Ham58b] R. W. Hamming. Book reviews. (electronic). Journal of the ACM, 5(2):197–203, Hamming:1957:BRb April 1958. CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X [Ham57b] R. W. Hamming. Book reviews. (electronic). Journal of the ACM, 4(2):219–220, Hamming:1958:BRc April 1957. CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X [Ham58c] R. W. Hamming. Book reviews. (electronic). Journal of the ACM, 5(3):298–308, July 1958. CODEN JACOAH. ISSN Hamming:1957:BRc 0004-5411 (print), 1557-735X (electronic). [Ham57c] R. W. Hamming. Book reviews. Journal of the ACM, 4(3):362–366, Hamming:1958:BRd July 1957. CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X (elec- [Ham58d] R. W. Hamming. Book reviews. tronic). Journal of the ACM, 5(4):389–396, October 1958. CODEN JACOAH. Hamming:1957:BRd ISSN 0004-5411 (print), 1557-735X (electronic). [Ham57d] R. W. Hamming. Book reviews. Journal of the ACM, 4(4):530–533, Hamming:1959:BRa October 1957. CODEN JACOAH. [Ham59a] R. W. Hamming. Book reviews. ISSN 0004-5411 (print), 1557-735X Journal of the ACM, 6(1):115–120, (electronic). January 1959. CODEN JACOAH. ISSN 0004-5411 (print), 1557-735X Hamming:1957:CDC (electronic).

[Ham57e] R. W. Hamming. Controlling the Hamming:1959:BRb digital computer. The Scientiﬁc Monthly, 85(4):169–175, October [Ham59b] R. W. Hamming. Book reviews. 1957. CODEN SCMOAA. ISSN Journal of the ACM, 6(2):306–312, 0096-3771 (print), 2327-7513 (elec- April 1959. CODEN JACOAH. tronic). URL https://www.jstor. ISSN 0004-5411 (print), 1557-735X org/stable/21639. (electronic). REFERENCES 26

Hamming:1959:BRc Hamming:1961:MS

[Ham59c] R. W. Hamming. Book reviews. [Ham61a] R. Hamming. The mechaniza- Journal of the ACM, 6(3):443–458, tion of science. In Proceedings of July 1959. CODEN JACOAH. ISSN the 1961 16th ACM National Meet- 0004-5411 (print), 1557-735X (elec- ing, ACM ’61, pages 31.101–31.104. tronic). ACM Press, New York, NY 10036, USA, 1961. Hamming:1959:BRd Hamming:1961:IIC [Ham59d] R. W. Hamming. Book reviews. [Ham61b] R. W. Hamming. [intellectual im- Journal of the ACM, 6(4):548–556, plications of the computer revolu- October 1959. CODEN JACOAH. tion]. In ????, editor, [Man and ISSN 0004-5411 (print), 1557-735X the Computer: Proceedings of a (electronic). Symposium at the the annual meet- Hamming:1959:SPC ing of the American Association for the Advancement of Science held in [Ham59e] R. W. Hamming. Stable predictor– Denver, CO, 27–29 December 1961], corrector methods for ordinary dif- page ?? ????, ????, 1961. ferential equations. Journal of the Hamming:1962:CSS ACM, 6(1):37–47, January 1959. CODEN JACOAH. ISSN 0004-5411 [Ham62a] R. W. Hamming. Computers and (print), 1557-735X (electronic). simulation in systems engineering. IRE Transactions on Education,E- Hamming:1959:SED 5(2):76–78, June 1962. ISSN 0893- 7141. [Ham59f] Richard W. Hamming. Sympo- sium on error detection and cor- Hamming:1962:NMS rection. In Information Process- [Ham62b] R. W. (Richard Wesley) Hamming. ing, Proceedings of the Interna- Numerical Methods for Scientists tional Conference on Information and Engineers. International Series Processing, UNESCO, Paris 15– in Pure and Applied Mathematics. 20 June 1959, pages 487–491. UN- McGraw-Hill, New York, NY, USA, ESCO, Paris, France, 1959. URL 1962. xvii + 411 pp. LCCN QA297 https://dblp.uni-trier.de/db/ .H28. conf/ifip/ifip1959. Hamming:1963:IIC Hamming:1960:BR [Ham63a] R. W. Hamming. Intellectual im- [Ham60] R. W. Hamming. Book reviews. plications of the computer revo- Journal of the ACM, 7(1):80–86, lution. American Mathematical January 1960. CODEN JACOAH. Monthly, 70(1):4–11, ???? 1963. ISSN 0004-5411 (print), 1557-735X CODEN AMMYAE. ISSN 0002- (electronic). 9890 (print), 1930-0972 (electronic). REFERENCES 27

Hamming:1963:SAS Hamming:1965:C

[Ham63b] R. W. Hamming. State of the art [Ham65c] R. W. Hamming. Contributors. in scientiﬁc computing. In Proceed- IEEE Transactions on Electronic ings of the May 21–23, 1963, Spring Computers, EC-14(5):742, October Joint Computer Conference, AFIPS 1965. CODEN IEECA8. ISSN 0367- ’63 (Spring), pages 163–167. ACM 7508. URL http://ieeexplore. Press, New York, NY 10036, USA, ieee.org/stamp/stamp.jsp?tp=& 1963. URL http://doi.acm.org/ arnumber=4038569. 10.1145/1461551.1461573. Hamming:1965:IC Hamming:1964:BRE [Ham65d] R. W. Hamming. Impact of computers. American Mathematical [Ham64] R. W. Hamming. Book review: Ed- Monthly, 72(2, part II):1–7, ???? ward L. Stiefel, An Introduction to 1965. CODEN AMMYAE. ISSN Numerical Mathematics, Academic 0002-9890 (print), 1930-0972 (elec- Press, Inc., New York, 1963, x + tronic). 286 p., 24 cm. Mathematics of Computation, 18(88):684, October Hamming:1965:LEM 1964. CODEN MCMPAF. ISSN 0025-5718 (print), 1088-6842 (elec- [Ham65e] R. W. Hamming. Letters to the tronic). URL https://www.jstor. editor: Mathematics vs. numerical org/stable/2002969. analysis. Science, 149(3681):245, July 16, 1965. CODEN SCIEAS. Hamming:1965:BRE ISSN 0036-8075 (print), 1095-9203 (electronic). [Ham65a] R. W. Hamming. Book review: Electronic Analog and Hy- Hamming:1965:NAV brid Computers. Granino A. Korn [Ham65f] R. W. Hamming. Numerical and Theresa M. Korn. McGraw-Hill, analysis vs. mathematics. Sci- New York, 1964. xxiv + 584 pp. Il- ence, 148(3669):473–475, April 23, lus. $17.50. Science, 148(3668):356– 1965. CODEN SCIEAS. ISSN 361, April 16, 1965. CODEN SCI- 0036-8075 (print), 1095-9203 (elec- EAS. ISSN 0036-8075 (print), 1095- tronic). URL http://science. 9203 (electronic). sciencemag.org/content/148/3669/ Hamming:1965:ENA 473. Hamming:1966:RRP [Ham65b] R. W. Hamming. Book review: El- ements of Numerical Analysis,by [Ham66a] R. Hamming. Review of Random- Peter Henrici. Mathematics of Process Simulation and Measure- Computation, 19(91):516–517, July ments (Korn, G. A.; 1966). IEEE 1965. CODEN MCMPAF. ISSN Transactions on Information The- 0025-5718 (print), 1088-6842 (elec- ory, 12(4):489, October 1966. CO- tronic). URL https://www.jstor. DEN IETTAW. ISSN 0018-9448 org/stable/2003710. (print), 1557-9654 (electronic). REFERENCES 28

Hamming:1966:DJ Charles S. Beightler. Prentice-Hall, Englewood Cliffs, N.J., 1967. xiv + [Ham66b] R. W. Hamming. Dear John. 480 pp., illus. $12.50. Science, 159 Simulation, 6(6):vi, June 1966. (3821):1347, March 22, 1968. CO- CODEN SIMUA2. ISSN 0037- DEN SCIEAS. ISSN 0036-8075 5497 (print), 1741-3133 (elec- (print), 1095-9203 (electronic). tronic). URL http://journals. sagepub.com/doi/pdf/10.1177/ Hamming:1968:CCR 003754976600600613. [Ham68c] R. W. (Richard Wesley) Hamming. Hamming:1966:SNA Calculus and the Computer Revo- lution. Houghton Mifflin, Boston, [Ham66c] R. W. Hamming. Statistics in nu- 1968. x + 72 pp. LCCN QA76.5 merical analysis. Communications .H353 1968. of the ACM, 9(7):482, July 1966. Hamming:1968:BRT CODEN CACMA2. ISSN 0001-0782 (print), 1557-7317 (electronic). [Ham68d] Richard W. Hamming. Book review: The Theory of Gambling and Hamming:1966:CCR Statistical Logic, Richard A. Ep- [Ham66d] R. W. (Richard Wesley) Hamming. stein. Academic Press, New York, Calculus and the Computer Rev- 1967. xvi + 492 pp. Science, 161 olution. Committee on the Un- (3844):878, August 30, 1968. CO- dergraduate Program in Mathemat- DEN SCIEAS. ISSN 0036-8075 ics. CUPM monograph. Committee (print), 1095-9203 (electronic). on the Undergraduate Program in Hamming:1969:OMV Mathematics, Berkeley, CA, USA, 1966. 24 pp. LCCN QA76.5 .H353. [Ham69a] R. W. Hamming. One man’s view of computer science. Journal of Hamming:1968:BRC the ACM, 16(1):3–12, January 1969. CODEN JACOAH. ISSN 0004-5411 [Ham68a] R. W. Hamming. Book review: (print), 1557-735X (electronic). Computation: Finite and Infi- nite Machines. Marvin L. Minsky. Hamming:1969:RCS Prentice-Hall, Englewood Cliffs, [Ham69b] Richard W. Hamming. Remote N.J., 1967. xviii + 317 pp., illus. controlled system for reducing dis- $12. Prentice-Hall Series in Auto- tortion. US Patent 3,440,539A., matic Computation. Science, 159 April 22, 1969. Patent filed 16 De- (3818):966–967, March 1, 1968. CO- cember 1964. DEN SCIEAS. ISSN 0036-8075 (print), 1095-9203 (electronic). Hamming:1970:MCT Hamming:1968:BRF [Ham70a] R. Hamming. Modern control theory. IEEE Transactions on Au- [Ham68b] R. W. Hamming. Book review: tomatic Control, 15(2):245, April Finding optima. Foundations of Op- 1970. CODEN IETAA9. ISSN 0018- timization. Douglass J. Wilde and 9286 (print), 1558-2523 (electronic). REFERENCES 29

Hamming:1970:CNE Hamming:1971:MNC

[Ham70b] R. W. Hamming. Classroom notes: [Ham71b] R. W. Hamming. Mathemati- An elementary discussion of the cal notes: a class of integration transcendental nature of the ele- formula. American Mathematical mentary transcendental functions. Monthly, 78(5):518–522, May 1971. American Mathematical Monthly, CODEN AMMYAE. ISSN 0002- 77(3):294–297, March 1970. CO- 9890 (print), 1930-0972 (electronic). DEN AMMYAE. ISSN 0002-9890 (print), 1930-0972 (electronic). Hamming:1971:CS [Ham71c] R. W. (Richard Wesley) Hamming. Hamming:1970:EDT Computers and Society. McGraw- Hill computer science series. Mc- [Ham70c] R. W. Hamming. An elementary Graw-Hill, New York, NY, USA, discussion of the transcendental na- 1971. ISBN 0-07-028593-7. x + 284 ture of the elementary transcenden- pp. LCCN QA76.5 .H354. tal functions. American Mathemat- ical Monthly, 77(3):294–297, March Hamming:1971:IAN 1970. CODEN AMMYAE. ISSN 0002-9890 (print), 1930-0972 (elec- [Ham71d] R. W. (Richard Wesley) Hamming. tronic). Introduction to Applied Numerical Analysis. McGraw-Hill computer Hamming:1970:DN science series. McGraw-Hill, New York, NY, USA, 1971. ISBN 0-07- [Ham70d] R. W. Hamming. On the dis- 025889-9. x + 331 pp. LCCN QA297 tribution of numbers. The Bell .H275. System Technical Journal, 49(8): Hamming:1972:CS 1609–1625, October 1970. CO- DEN BSTJAN. ISSN 0005- [Ham72] Richard W. Hamming. Comput- 8580 (print), 2376-7154 (electronic). ers and Society. McGraw-Hill, New URL http://bstj.bell-labs. York, NY, USA, 1972. ISBN 0-07- com/BSTJ/images/Vol49/bstj49- 028593-7, 0-07-028593-4. x + 284 8-1609.pdf; http://www.alcatel- pp. LCCN QA76.5 .H354. McGraw- lucent.com/bstj/vol49-1970/articles/ Hill Computer Science Series. bstj49-8-1609.pdf. Hamming:1973:NMS Hamming:1971:CIF [Ham73a] R. W. Hamming. Numerical Meth- [Ham71a] R. W. Hamming. A class of integra- ods for Scientists and Engineers. tion formulas. American Mathemat- McGraw-Hill, New York, NY, USA, ical Monthly, 78(5):518–522, May second edition, 1973. ISBN 0-07- 1971. CODEN AMMYAE. ISSN 025887-2. ix + 721 pp. International 0002-9890 (print), 1930-0972 (elec- Series in Pure and Applied Mathe- tronic). matics. REFERENCES 30

Hamming:1973:RTS on Computer Science Education),7 (4):16–18, December 1975. CODEN [Ham73b] R. W. Hamming. Role of the SIGSD3. ISSN 0097-8418 (print), technical societies in the ﬁeld of 2331-3927 (electronic). computer measurement. Techni- cal Report Special Publication 424, Hamming:1977:DF U.S. National Bureau of Standards, Gaithersburg, MD, USA, 1973. 151– [Ham77] R. W. (Richard Wesley) Hamming. 153 pp. Digital Filters. Prentice-Hall signal processing series. Prentice-Hall, Up- Hamming:1973:BRN per Saddle River, NJ 07458, USA, 1977. ISBN 0-13-212571-4. xii + [Ham73c] Richard W. Hamming. Book re- 226 pp. LCCN QA297 .H26. view: Numerical Analysis and Com- putation: Theory and Practice (E. Hamming:1979:RZW K. Blum). SIAM Review, 15(4):807, ???? 1973. CODEN SIREAD. ISSN [Ham79] Richard W. Hamming. Re- 0036-1445 (print), 1095-7200 (elec- views: Z. W. Pylyshyn: Per- tronic). spectives on the Computer Rev- olution; capsule reviews. Annals Hamming:1974:FAN of the History of Computing,1 [Ham74] R. W. Hamming. The frequency (2):100, 208, October/December approach to numerical analysis. 1979. CODEN AHCOE5. ISSN In Scaife [Sca74], pages 151–175. 0164-1239. URL http://dlib. ISBN 0-12-621150-7. LCCN QA297 computer.org/an/books/an1979/ .S86. URL http://catalog. pdf/a2100.pdf; http://www. hathitrust.org/Record/000575557. computer.org/annals/an1979/a2100abs. Published for the Royal Irish htm. Academy. Hamming:1980:UEM

Hamming:1975:HDY [Ham80a] R. W. Hamming. The unreasonable eﬀectiveness of mathe- [Ham75a] R. W. Hamming. How do matics. American Mathemati- you know the simulation is rele- cal Monthly, 87(2):81–90, February vant? Simulation, 25(5):163–167, 1980. CODEN AMMYAE. ISSN 1975. CODEN SIMUA2. ISSN 0002-9890 (print), 1930-0972 (elec- 0037-5497 (print), 1741-3133 (electronic). URL https://www.jstor. tronic). URL http://journals. org/stable/2321982. sagepub.com/doi/pdf/10.1177/ 003754977502500505. Hamming:1980:WWK Hamming:1975:PCS [Ham80b] R. W. Hamming. We would know [Ham75b] R. W. Hamming. A philosophy what they thought when they did it. for computer science or my preju- In Metropolis et al. [MHR80], pages dices and confusions. SIGCSE Bul- 3–9. ISBN 0-12-491650-3, 1-4832- letin (ACM Special Interest Group 9668-7 (e-book). LCCN QA75.5 .I63 REFERENCES 31

1976. Original versions of these pa- Math. Monthly 87 (1980), no. 2, pers were presented at the Interna- 81–90; MR0559142 (81e:00015)]. In tional Research Conference on the Mickens [Mic85], pages 15–29. ISBN History of Computing, held at the 0-442-26077-6. LCCN QC20 .M36 Los Alamos Scientiﬁc Laboratory, 1985. 10–15 June 1976. Hamming:1985:MMA Hamming:1980:CIT [Ham85b] R. W. (Richard Wesley) Hamming. [Ham80c] Richard Wesley Hamming. Coding Methods of Mathematics Applied to and Information Theory. Prentice- Calculus, Probability, and Statis- Hall, Upper Saddle River, NJ 07458, tics. Prentice-Hall series in com- USA, 1980. ISBN 0-13-139139-9. xii putational mathematics. Prentice- + 239 pp. LCCN QA268 .H35 1980. Hall, Upper Saddle River, NJ 07458, US$19.95. USA, 1985. ISBN 0-13-578899-4. Hamming:1983:F xviii + 857 pp. LCCN QA37.2 .H26 1985. US$40.00. [Ham83a] R. W. Hamming. Future. In Gen- Hamming:1986:CIT tle [Gen83], pages 3–6. ISBN 0- 444-86688-4 (paperback). LCCN [Ham86a] R. W. (Richard Wesley) Ham- QA276.4 .S95 1983. ming. Coding and Information The- ory. Prentice-Hall, Upper Saddle Hamming:1983:DF River, NJ 07458, USA, second edi- [Ham83b] R. W. (Richard Wesley) Hamming. tion, 1986. ISBN 0-13-139072-4, 0- Digital Filters. Prentice-Hall signal 13-139139-9. xii + 259 pp. LCCN processing series. Prentice-Hall, Up- QA268 .H35 1986. US$36.95. per Saddle River, NJ 07458, USA, Hamming:1986:NMS second edition, 1983. ISBN 0-13- 212506-4. xiv + 257 pp. LCCN [Ham86b] R. W. (Richard Wesley) Hamming. QA297 .H26 1983. Numerical Methods for Scientists and Engineers. Dover, New York, Hamming:1984:CDM NY, USA, second edition, 1986. [Ham84] R. W. Hamming. Calculus and ISBN 0-486-65241-6 (paperback). ix discrete mathematics .... Col- + 721 pp. LCCN QA297 .H28 1986. lege Mathematics Journal, 15(5): US$14.95. URL http://www.loc. 388–389, November 1984. CO- gov/catdir/description/dover032/ DEN ???? ISSN 0746-8342 86016226.html. (print), 1931-1346 (electronic). Hamming:1986:YYR URL http://www.tandfonline. com/doi/abs/10.1080/00494925. [Ham86c] Richard W. Hamming. You and 1984.11972813. your research. Web transcript Hamming:1985:UEM and video of talk at Bellcore., March 7, 1986. URL http://www. [Ham85a] R. W. Hamming. The unreasonable maultech.com/chrislott/misc/ eﬀectiveness of mathematics [Amer. kaiser.html; http://www.paulgraham. REFERENCES 32

com/hamming.html; https:// AMMYAE. ISSN 0002-9890 (print), www.youtube.com/watch?v=8j3zEcusTuA. 1930-0972 (electronic). Hamming:1987:OMV Hamming:1988:RTL

[Ham87a] R. W. Hamming. One man’s view [Ham88c] Richard W. Hamming. Reviews: of computer science. In Ashenhurst Toward a lean and lively calculus: [Ash87], pages 3–12. ISBN 0-201- Report of the Conference/Workshop 07794-9. LCCN QA76.24 .A33 1987. to Develop Curriculum and Teach- ACM Turing Award lecture. ing Methods for Calculus at the Col- lege Level. American Mathematical Hamming:1987:ICG Monthly, 95(5):466–471, ???? 1988. CODEN AMMYAE. ISSN 0002- [Ham87b] R. W. (Richard Wesley) Ham- 9890 (print), 1930-0972 (electronic). ming. Information und Codierung. (German) [Coding and Information Hamming:1989:TBP Theory]. Informationstechnologie. VCH, Weinheim, Federal Republic [Ham89a] R. W. Hamming. The tennis ball of Germany, 1987. ISBN 3-527- paradox. Mathematics Magazine,62 26611-9. xii + 269 pp. LCCN (4):268–269, ???? 1989. CODEN QA268 H224. MAMGA8. ISSN 0025-570X. URL http://www.jstor.org/stable/ Hamming:1987:DF 2689769?origin=pubexport.

[Ham87c] Richard W. Hamming. Digi- Hamming:1989:DF tale Filter. Informationstechnolo- [Ham89b] R. W. (Richard Wesley) Hamming. gie. VCH Verlagsgesellschaft, Wein- Digital Filters. Prentice Hall signal heim, West Germany, 1987. ISBN processing series. Prentice-Hall, Up- 3-527-26463-9. xii + 277 pp. Ubers.¨ per Saddle River, NJ 07458, USA, aus dem Engl. von Bernhard H. third edition, 1989. ISBN 0-13- Steinebrunner und Joachim Dur- 212812-8, 0-13-212895-0. xiv + zok) (Digital ﬁlters). 284 pp. LCCN QA297 .H26 1989. Hamming:1988:UM US$35.25. Hamming:1989:IAN [Ham88a] R. W. Hamming. The use of mathematics. In A century of mathemat- [Ham89c] R. W. (Richard Wesley) Hamming. ics in America [Dur88], pages 429– Introduction to Applied Numerical 437. ISBN 0-8218-0124-4. LCCN Analysis. Hemisphere Pub. Corp., QA27.U5 C46 1988. New York, NY, USA, 1989. ISBN 0-89116-865-6. x + 331 pp. LCCN Hamming:1988:RFC QA297 .H275 1989. US$70.00 (est.). [Ham88b] Richard Hamming. Reviews: A Hamming:1990:BRU First Course in Coding Theory. American Mathematical Monthly, [Ham90a] R. W. Hamming. Book review: 95(8):786–787, ???? 1988. CODEN [untitled]. Journal of the American REFERENCES 33

Statistical Association, 85(410):592, ley, Reading, MA, USA, 1991. ISBN June 1990. CODEN JSTNAL. ISSN 0-201-40686-1, 0-201-51058-8. xvi + 0162-1459 (print), 1537-274X (elec- 344 pp. LCCN QA273 .H3544 1991. tronic). URL http://www.jstor. Hamming:1992:RJN org/stable/2289807. [Ham92a] R. W. Hamming. Review of John Hamming:1990:EDE von Neumann and the Origins of [Ham90b] R. W. Hamming. Error detecting Modern Computing (Aspray, W; and error correcting codes. In Com- 1990). Computer, 25(10):126–127, puter Arithmetic [Swa90], pages 16– October 1992. CODEN CPTRB4. 29. ISBN 0-8186-8945-5. LCCN ISSN 0018-9162 (print), 1558-0814 QA76.9 .C62C66 1990. Reprint of (electronic). [Ham50a]. Hamming:1992:RMF Hamming:1990:FH [Ham92b] R. W. Hamming. Review of Math- [Ham90c] R. W. Hamming. Foreword by ematical Foundations of Computer Hamming. In Digital Signal Anal- Science, Volume 1 (Fejer, P. A. and ysis [SH90], pages ??–? ISBN Simovici D. A; 1991). Computer,25 0-13-213117-X, 0-13-211772-X (pa- (1):134–135, January 1992. CODEN perback). LCCN TK5102.5 .S698 CPTRB4. ISSN 0018-9162 (print), 1990. 1558-0814 (electronic). Hamming:1990:FS Hamming:1993:HDD [Ham90d] Richard W. Hamming. The fu- [Ham93] R. W. Hamming. Hamming dis- ture of statistics. The American tance and its discovery. The UMAP Statistician, 44(2):133–135, May Journal: The Journal of Undergrad- 1990. CODEN ASTAAJ. ISSN uate Mathematics and its Applica- 0003-1305 (print), 1537-2731 (elec- tions, 14(4):??, ???? 1993. ISSN tronic). URL http://www.jstor. 0197-3622 (print), 1938-338X (elec- org/stable/2684152. tronic). URL http://www.comap. com/product/?idx=1252. Hamming:1991:HWL Hamming:1994:SEB [Ham91a] R. W. Hamming. How I was led to the frequency approach. Digi- [Ham94] R. W. Hamming. Science is in the tal Signal Processing, 1(3):180–184, eye of the beholder. Computers and July 1991. CODEN DSPREJ. ISSN Chemistry, 18(3):353–357, Septem- 1051-2004 (print), 1095-4333 (elec- ber 1994. CODEN COCHDK. ISSN tronic). 0097-8485 (print), 1879-0763 (electronic). Hamming:1991:APS Hamming:1995:DFP [Ham91b] R. W. (Richard Wesley) Hamming. The Art of Probability — for Scien- [Ham95a] R. W. Hamming. Digital ﬁlters, tists and Engineers. Addison-Wes- part 1. Web video of lecture., REFERENCES 34

April 27, 1995. URL https://www. http://www.tandfebooks.com/ youtube.com/watch?v=2wO8ZHnn3Q4. isbn/9781135301033. Hamming:1995:ECC Hamming:1998:MDP

[Ham95b] R. W. Hamming. Error-correcting [Ham98a] R. W. Hamming. Mathematics on codes. Web video of lecture., April a distant planet. American Math- 21, 1995. URL https://www. ematical Monthly, 105(7):640–650, youtube.com/watch?v=BZh07Ew32UA. August/September 1998. CODEN AMMYAE. ISSN 0002-9890 (print), Hamming:1995:IAD 1930-0972 (electronic). [Ham95c] R. W. Hamming. Introduction to Hamming:1998:DF the art of doing science and engineering: Learning to learn. Web [Ham98b] R. W. (Richard Wesley) Hamming. lecture video, March 28, 1995. Digital ﬁlters. Dover, New York, URL https://www.youtube.com/ NY, USA, third edition, 1998. ISBN watch?v=AD4b-52jtos. 0-486-65088-X (paperback). xiv + 284 pp. LCCN QA297 .H26 Hamming:1996:FSE 1998. URL http://www.loc.gov/ [Ham96] R. W. Hamming. Foreword: Soft- catdir/description/dover032/ ware engineering. Journal of Sys- 97051370.html; http://www. tems Integration, 6(1–2):5–7, March loc.gov/catdir/toc/dover031/ 1996. 97051370.html. Hamming:1997:HTA Hamming:1999:VH

[Ham97a] R. W. Hamming. How to think [Ham99] R. W. Hamming. Vorwort von Ham- about trends. In Denning and Met- ming. In Stearns and Hush [SH99], calfe [DM97], pages 65–74. ISBN 0- pages 13–14. 387-94932-1, 0-387-98588-3 (paper- Hamming:2000:FPI back), 1-4612-0685-5. LCCN QA76 .D348 1997. [Ham00] R. W. Hamming. The future of Hamming:1997:ADS physics: information hiding. In Hecker and Rota [HR00], pages 73– [Ham97b] R. W. (Richard Wesley) Ham- 81. ISBN 1-4612-0777-0 (e-book), 1- ming. The Art of Doing Sci- 4612-6898-2 (print), 0-8176-3856-3, ence and Engineering: Learning 3-7643-3856-3. LCCN Q160.2 .E77 to Learn. Gordon and Breach, 2000. Amsterdam, The Netherlands, Hamming:2001:MDP 1997. ISBN 90-5699-500-6, 90-5699- 501-4 (paperback), 0-203-45071-X [Ham01] R. W. Hamming. Mathematics on (e-book), 0-203-45913-X (Adobe a distant planet. Pokroky Matem- eReader). vii + 218 pp. LCCN atiky, Fyziky a Astronomie, 46(3): Q175 .H263 1997. URL http:/ 219–231, 2001. CODEN PMFAA4. /site.ebrary.com/id/10166593; ISSN 0032-2423. REFERENCES 35

Hamming:2004:MMA In Swartzlander, Jr. [Swa15b], pages 3–16. ISBN 981-4641-46- [Ham04] R. W. (Richard Wesley) Hamming. 4 (hardcover), 981-4641-47-2 (e- Methods of Mathematics Applied to book). LCCN QA76.6 .C633 2015 Calculus, Probability, and Statis- vol. 2. tics. Dover books on mathematics. Dover, New York, NY, USA, 2004. Hamming:2015:DN ISBN 0-486-43945-3 (paperback). xviii + 857 pp. LCCN QA37.3 [Ham15b] R. W. Hamming. On the distribution of numbers. In Swartzlan- .H35 2004. URL http://www. der, Jr. [Swa15a], pages 321–337. loc.gov/catdir/enhancements/ ISBN 981-4651-56-7 (vol. 1; hard- fy0618/2004053443-d.html. cover), 981-4651-57-5, 981-4641-47- Hamming:2009:FCG 2 (e-book). LCCN QA76.6 .C633 2015 vol. 1. [Ham09] Richard Hamming. Fehlerkor- rigierende Codes. (German) [error- Harper:2003:BHG correcting codes]. In Historische Notizen zur Informatik. (German) [Har03] L. H. Harper. On the bandwidth [Historical notes on computer sci- of a Hamming graph. Theoret- ence] [Bau09], pages 337–344. ISBN ical Computer Science, 301(1–3): 3-540-85790-7. LCCN QA76.17 491–498, May 14, 2003. CODEN .B38 2009. TCSCDI. ISSN 0304-3975 (print), 1879-2294 (electronic). Hamming:2012:IAN Hemming:1968:CCM [Ham12a] R. W. (Richard Wesley) Hamming. Introduction to Applied Numerical [Hem68] R. V. Hemming. Chislennye Analysis. Dover books on mathe- metody dlya nauchnykh rabotnikov matics. Dover, New York, NY, USA, i inzhenerov (Russian) [Numeri- 2012. ISBN 0-486-48590-0 (paper- cal methods for scientists and en- back). x + 331 pp. LCCN QA297 gineers]. Translated from the En- .H275 2012. glish by V. L. Arlazarov, G. S. Raz- Hamming:2012:CEC ina and A. V. Uskov. Edited by R. S. Guter. Izdat. “Nauka”, Moscow, [Ham12b] Richard Hamming. Classical error- USSR, 1968. 400 pp. correcting codes: Machines should work. people should think. In Hamming:1951:EDC Marinescu and Marinescu [MM12], pages 345–454. ISBN 0-12-383874- [HH51] Richard W. Hamming and Bernard D. 6 (hardcover). LCCN QA76.889 Holbrook. Error-detecting and .M363 2012. correcting system. US Patent Hamming:2015:EDE 2,552,629A., May 15, 1951. URL https://patents.google.com/patent/ [Ham15a] R. W. Hamming. Error detect- US2552629A/en. Patent ﬁled 11 ing and error correcting codes. January 1950. REFERENCES 36

Hopkins:1957:CR //link.springer-ny.com/link/ service/series/0558/papers/2260/ [HH57] I. L. Hopkins and R. W. Hamming. 22600038.pdf. On creep and relaxation. Journal of Applied Physics, 28(8):906–909, Au- Hamming:1978:MFU gust 1957. CODEN JAPIAU. ISSN [HK78] Richard W. Hamming and James F. 0021-8979 (print), 1089-7550 (elec- Kaiser. Multisection filter using in- tronic), 1520-8850. See note [HH58]. flected amplitude change function Hopkins:1958:NPC to sharpen its band-edge responses. US Patent 4,074,212., February 14, [HH58] I. L. Hopkins and R. W. Hamming. 1978. URL https://www.google. Note on paper On Creep and Relax- com/patents/US4074212. Patent ation. Journal of Applied Physics, filed 16 December 1976. 29(4):742, April 1958. CODEN Homma:2009:SGH JAPIAU. ISSN 0021-8979 (print), 1089-7550 (electronic), 1520-8850. [HK09] Masaaki Homma and Seon Jeong See [HH57]. Kim. The second generalized Ham- ming weight for two-point codes on Heidenreich:1965:NEE a Hermitian curve. Designs, Codes, [HH65] R. D. Heidenreich and R. W. and Cryptography, 50(1):1–40, Jan- Hamming. Numerical evaluation uary 2009. CODEN DCCREC. of electron image phase contrast. ISSN 0925-1022 (print), 1573-7586 The Bell System Technical Jour- (electronic). URL http://www. nal, 44(2):207–233, February 1965. springerlink.com/openurl.asp? CODEN BSTJAN. ISSN 0005- genre=article&issn=0925-1022& 8580 (print), 2376-7154 (electronic). volume=50&issue=1&spage=1. URL http://bstj.bell-labs. Honkala:2002:CIP com/BSTJ/images/Vol44/bstj44- 2-207.pdf; http://www.alcatel-[HL02] Iiro Honkala and Antoine Lobstein. lucent.com/bstj/vol44-1965/articles/ On the complexity of the identifi- bstj44-2-207.pdf. cation problem in Hamming spaces. Acta Informatica, 38(11/12):839– Hirst:2001:SSI 845, November 2002. CODEN [HH01] Simon Hirst and Bahram Honary. AINFA2. ISSN 0001-5903 (print), A simple soft-input/soft-output de- 1432-0525 (electronic). coder for Hamming codes. Lec- Honkala:2001:CIS ture Notes in Computer Sci- ence, 2260:38–??, 2001. CO- [HLR01] Iiro Honkala, Tero Laihonen, and DEN LNCSD9. ISSN 0302- Sanna Ranto. On codes identi- 9743 (print), 1611-3349 (electronic). fying sets of vertices in Hamming URL http://link.springer-ny. spaces. Designs, Codes, and Cryp- com/link/service/series/0558/ tography, 24(2):193–204, October bibs/2260/22600038.htm; http: 2001. CODEN DCCREC. ISSN REFERENCES 37

0925-1022 (print), 1573-7586 (elec- low hit zone. Designs, Codes, tronic). URL http://www.wkap. and Cryptography, 75(1):157–174, nl/oasis.htm/353906. April 2015. CODEN DCCREC. ISSN 0925-1022 (print), 1573-7586 Hamming:1965:NLB (electronic). URL http://link. [HM65] R. W. Hamming and W. L. Mam- springer.com/article/10.1007/ mel. A note on the location s10623-013-9900-x. of the binary point in a com- Han:2017:CLH puting machine. IEEE Trans- actions on Electronic Comput- [HPP+17] Hongyu Han, Daiyuan Peng, ers, EC-14(2):260–261, April 1965. Udaya Parampalli, Zheng Ma, CODEN IEECA8. ISSN 0367- and Hongbin Liang. Construc- 7508. URL http://ieeexplore. tion of low-hit-zone frequency hop- ieee.org/stamp/stamp.jsp?tp=& ping sequences with optimal par- arnumber=4038414. tial Hamming correlation by inter- Houghton:1997:EEC leaving techniques. Designs, Codes, and Cryptography, 84(3):401–414, [Hou97a] A. D. Houghton. The Engineer’s September 2017. CODEN DC- Error Coding Handbook. Springer- CREC. ISSN 0925-1022 (print), Verlag, Berlin, Germany / Heidel- 1573-7586 (electronic). berg, Germany / London, UK / etc., 1997. ISBN 1-4613-0447-4. 272 pp. He:2004:GCH LCCN TK7888.4. Houghton:1997:HC [HPR04] Matthew X. He, Sergei V. Petoukhov, and Paolo E. Ricci. Genetic code, [Hou97b] A. D. Houghton. Hamming codes. Hamming distance and stochastic In The Engineer’s Error Coding matrices. Bulletin of Mathematical Handbook [Hou97a], chapter 4, Biology, 66(5):1405–1421, Septem- pages 27–34. ISBN 1-4613-0447-4. ber 2004. CODEN BMTBAP. LCCN TK7888.4. ISSN 0092-8240 (print), 1522-9602 Hamming:1966:CIF (electronic). URL http://link. springer.com/content/pdf/10. [HP66] Richard W. Hamming and Roger S. 1016/j.bulm.2004.01.002.pdf. Pinkham. A class of integration formulas. Journal of the ACM,13 Hamming:1998:PSS (3):430–438, July 1966. CODEN JACOAH. ISSN 0004-5411 (print), [HPS98] Richard Hamming, Roger Pinkham, 1557-735X (electronic). and Richard Stong. Problems and Han:2015:NLB solutions: Solutions: Another Polya urn scheme: 10504. American [HPL15] Hongyu Han, Daiyuan Peng, and Mathematical Monthly, 105(2):181– Xing Liu. New lower bounds on the 182, ???? 1998. CODEN AM- aperiodic Hamming correlations of MYAE. ISSN 0002-9890 (print), frequency hopping sequences with 1930-0972 (electronic). REFERENCES 38

Hecker:2000:EFH Horimoto:2001:GHW

[HR00] Siegfried S. Hecker and Gian-Carlo [HS01] H. Horimoto and K. Shiromoto. Rota, editors. Essays on the Fu- On generalized Hamming weights ture: in honor of Nick Metropolis. for codes over ﬁnite chain rings. Birkh¨auser Boston Inc., Cambridge, Lecture Notes in Computer Sci- MA, USA, 2000. ISBN 1-4612-0777- ence, 2227:141–??, 2001. CO- 0 (e-book), 1-4612-6898-2 (print), 0- DEN LNCSD9. ISSN 0302- 8176-3856-3, 3-7643-3856-3. xvii + 9743 (print), 1611-3349 (electronic). 276 pp. LCCN Q160.2 .E77 2000. URL http://link.springer-ny. com/link/service/series/0558/ Hamming:1954:RCS bibs/2227/22270141.htm; http: //link.springer-ny.com/link/ [HRSC54] R. W. Hamming, Sibyl Rock, A. L. service/series/0558/papers/2227/ Samuel, and W. C. Carter. Re- 22270141.pdf. dundancy checking for small digital computers. In Proceedings of the Huang:2006:CCH December 8–10, 1954, Eastern Joint [HSZZ06] Wei Huang, Yaoyun Shi, Shengyu Computer Conference: Design and Zhang, and Yufan Zhu. The com- Application of Small Digital Com- munication complexity of the Ham- puters, AIEE-IRE ’54 (Eastern), ming distance problem. Informa- pages 56–57. ACM Press, New York, tion Processing Letters, 99(4):149– NY 10036, USA, 1954. URL http:/ 153, August 31, 2006. CODEN /doi.acm.org/10.1145/1455270. IFPLAT. ISSN 0020-0190 (print), 1455283. 1872-6119 (electronic). Hamming:1955:RCS Houselander:1990:IHB

[HRSC55] R. W. Hamming, Sibyl Rock, A. L. [HT90] P. Houselander and J. T. Taylor. Samuel, and W. C. Carter. Re- Improving the Hamming binary as- dundancy checking for small digi- sociative memory. Electronics Let- tal computers. In Proceedings of ters, 26(11):705–707, May 1990. the Eastern Joint Computer Confer- CODEN ELLEAK. ISSN 0013-5194 ence, Philadelphia, December 8–10, (print), 1350-911X (electronic). 1954, pages 56–57. AFIPS Press, Montvale, NJ, USA, 1955. Huning:1993:NSA

Hamming:1979:DF [Hun93] H. Huning. A node splitting algorithm that reduces the number of [HS79] R. W. Hamming and S. D. Stearns. connections in a Hamming distance Digital ﬁlters. IEEE Transactions classifying network. Lecture Notes on Systems, Man, and Cybernet- in Computer Science, 686:102–??, ics, 9(1):67, January 1979. CODEN 1993. CODEN LNCSD9. ISSN ISYMAW. ISSN 0018-9472 (print), 0302-9743 (print), 1611-3349 (elec- 2168-2909 (electronic). tronic). REFERENCES 39

Hamming:1980:DF Itoh:1986:RSC

[HY80] R. W. Hamming and C. K. Yuen. [IS86] Yoshiaki Itoh and Herbert Solomon. Digital ﬁlters. IEEE Transactions Random sequential coding by Ham- on Systems, Man, and Cybernetics, ming distance. Journal of Applied 10(10):689, October 1980. CODEN Probability, 23(3):688–695, Septem- ISYMAW. ISSN 0018-9472 (print), ber 1986. CODEN JPRBAM. ISSN 2168-2909 (electronic). 0021-9002 (print), 1475-6072 (electronic). URL http://www.jstor. Heng:2017:EHW org/stable/3214007. Irwin:1987:PSC [HY17] Ziling Heng and Qin Yue. Eval- uation of the Hamming weights [IS87] Mary Jane Irwin and Renato Ste- of a class of linear codes based fanelli, editors. Proceedings: 8th on Gauss sums. Designs, Codes, Symposium on Computer Arith- and Cryptography, 83(2):307–326, metic, May 19–21, 1987, Villa May 2017. CODEN DCCREC. Olmo, Como, Italy. IEEE Computer ISSN 0925-1022 (print), 1573- Society Press, 1109 Spring Street, 7586 (electronic). URL http:// Suite 300, Silver Spring, MD 20910, link.springer.com/accesspage/ USA, May 1987. ISBN 0-8186- article/10.1007/s10623-016-0222- 0774-2 (paperback), 0-8186-4774-4 7; http://link.springer.com/ (microﬁche), 0-8186-8774-6 (case). article/10.1007/s10623-016-0222- LCCN QA 76.9 C62 S95 1987. 7. Isaka:2005:HRS IEEE:2018:IRW [Isa05] M. Isaka. High-rate serially con- [IEE18] IEEE. IEEE Richard W. Ham- catenated codes using Hamming ming Medal. IEEE Web site, codes. In IEEE International Con- 2018. URL https://www.ieee. ference on Communications, 2005. org/about/awards/medals/hamming. ICC 2005. IEEE Computer Soci- html; https://www.ieee.org/ ety Press, 1109 Spring Street, Suite content/dam/ieee-org/ieee/web/ 300, Silver Spring, MD 20910, USA, org/about/hamming_rl.pdf. 2005. Izadikhah:2009:UHD Imrich:1997:RHG [Iza09] Mohammad Izadikhah. Using the [IK97] Wilfried Imrich and Sandi Klavˇzar. Hamming distance to extend TOP- Recognizing Hamming graphs in lin- SIS in a fuzzy environment. Jour- ear time and space. Information nal of Computational and Ap- Processing Letters, 63(2):91–95, Au- plied Mathematics, 231(1):200–207, gust 13, 1997. CODEN IFPLAT. September 1, 2009. CODEN ISSN 0020-0190 (print), 1872-6119 JCAMDI. ISSN 0377-0427 (print), (electronic). 1879-1778 (electronic). URL REFERENCES 40

http://www.sciencedirect.com/ don, UK / etc., October 2009. science/article/pii/S0377042709000533. ISBN 3-642-01155-1, 3-642-01156- X. LCCN T177.N7 S56 2009. Jain:2007:CTB Karon:1977:RIA [Jai07] Sapna Jain. Campopiano-type bounds in non-Hamming array cod- [Kar77] John Karon. Reviews: Introduc- ing. Linear Algebra and Its Appli- tion to Applied Numerical Analysis, cations, 420(1):135–159, January 1, by Richard W. Hamming; Numer- 2007. CODEN LAAPAW. ISSN ical Methods with FORTRAN IV 0024-3795 (print), 1873-1856 (elec- Case Studies, by William S. Dorn tronic). and Daniel D. McCracken; Numeri- cal Quadrature and Solution of Or- Jarrous:2013:SCF dinary Differential Equations,byA. [JP13] Ayman Jarrous and Benny Pinkas. H. Stroud. American Mathematical Secure computation of functional- Monthly, 84(4):304–307, April 1977. ities based on Hamming distance CODEN AMMYAE. ISSN 0002- and its application to computing 9890 (print), 1930-0972 (electronic). document similarity. International Kelly:2018:AIM Journal of Applied Cryptography. IJACT, 3(1):21–46, 2013. CODEN [Kel18a] Cindy Kelly. AtomicHeritage ???? ISSN 1753-0563 (print), 1753- interview with Martin Mandel- 0571 (electronic). berg. YouTube 52m video., May 7, 2018. URL https: Juncosa:1962:NMS //www.manhattanprojectvoices. [Jun62] M. L. Juncosa. Book review: org/oral-histories/martin-mandelbergs- Applied mathematics: Numerical interview; https://www.youtube. Methods for Scientists and En- com/watch?v=cXLI-UpEAJo. gineers. Richard W. Hamming. Kelly:2018:MMI McGraw-Hill, New York, 1962. 411 pp. Illus. $11. Science, 138(3545): [Kel18b] Cindy Kelly. Martin Mandel- 1091, December 7, 1962. CODEN berg’s interview. Web document., SCIEAS. ISSN 0036-8075 (print), March 16, 2018. URL https: 1095-9203 (electronic). //www.manhattanprojectvoices. org/oral-histories/martin-mandelbergs- Kaiser:2009:SRL interview. [Kai09] J. F. Kaiser. Richard Hamming — Kaiser:1977:SRS you and your research. In Aslak Tveito, A. M. (Are Magnus) Bru- [KH77] J. Kaiser and R. Hamming. Sharp- aset, and Olav Lysne, editors, Sim- ening the response of a symmet- ula Research Laboratory: by think- ric nonrecursive filter by multiple ing constantly about it, pages 37– use of the same filter. In ICASSP 60. Springer-Verlag, Berlin, Ger- ’77. IEEE International Conference many / Heidelberg, Germany / Lon- on Acoustics, Speech, and Signal REFERENCES 41

Processing, volume 2, pages 82– Kolpakov:2003:FAR 85. IEEE Computer Society Press, 1109 Spring Street, Suite 300, Sil- [KK03] Roman Kolpakov and Gregory ver Spring, MD 20910, USA, May Kucherov. Finding approximate 1977. repetitions under Hamming distance. Theoretical Computer Sci- Khemming:1972:CCM ence, 303(1):135–156, June 28, 2003. CODEN TCSCDI. ISSN 0304-3975 [Khe72] R. V. Khemming. Chislennye (print), 1879-2294 (electronic). metody dlya nauchnykh rabotnikov i inzhenerov (Russian) [Numerical Kim:2015:FEE methods for scientists and engi- + neers]. Izdat. “Nauka”, Moscow, [KKI 15] Jaeyoung Kim, Myeongsu Kang, USSR, second revised edition, 1972. Md Shohidul Islam, Cheol-Hong 400 pp. Translated from the English Kim, and Jong-Myon Kim. A fast by V. L. Arlazarov, G. S. Razina and energy-eﬃcient Hamming de- and A. V. Uskov, Edited by R. S. coder for software-deﬁned radio us- Guter. ing graphics processing units. The Journal of Supercomputing, 71(7): Khemming:1983:CTK 2454–2472, July 2015. CODEN JO- SUED. ISSN 0920-8542 (print), [Khe83] R. V. Khemming. Teoriya 1573-0484 (electronic). URL http: kodirovaniya i teoriya informatsii. //link.springer.com/article/ (Russian) [Coding theory and infor- 10.1007/s11227-015-1396-x. mation theory]. “Radio i Svyaz0”, Moscow, USSR, 1983. 174 pp. Klein:2013:CBH Translated from the English by S. [Kle13] Shmuel T. Klein. On the con- I. Gel0fand, Translation edited and nection between Hamming codes, with a preface by B. S. Tsybakov. Heapsort and other methods. Infor- mation Processing Letters, 113(17): Kolpakov:2001:FAR 617–620, August 30, 2013. CODEN [KK01] Roman Kolpakov and Gregory IFPLAT. ISSN 0020-0190 (print), Kucherov. Finding approximate 1872-6119 (electronic). URL repetitions under Hamming dis- http://www.sciencedirect.com/ tance. Lecture Notes in Com- science/article/pii/S0020019013001555. puter Science, 2161:170–??, 2001. Knoblauch:1988:BRW CODEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (electronic). [Kno88] M. Knoblauch. Buchbesprechung: URL http://link.springer-ny. R. W. Hamming: Informa- com/link/service/series/0558/ tion und Codierung, VCH Ver- bibs/2161/21610170.htm; http: lagsgesellschaft, Weinheim 1987. //link.springer-ny.com/link/ 270 Seiten, Preis: DM 74,-. service/series/0558/papers/2161/ Berichte der Bunsen-Gesellschaft 21610170.pdf. fuer Physikalische Chemie, 1963– REFERENCES 42

1990, 92(8):943, August 1988. CO- URL http://link.springer-ny. DEN BBPCAX. ISSN 0005-9021. com/link/service/series/0558/ Klein:2017:HPE bibs/2260/22600009.htm; http: //link.springer-ny.com/link/ [KS17] Shmuel Klein and Dana Shapira. service/series/0558/papers/2260/ Hierarchical parallel evaluation of a 22600009.pdf. Hamming code. Algorithms, 10(2): 50–??, April 2017. Liu:2008:RGH

Kim:2012:SSS [LCL08] Zihui Liu, Wende Chen, and Yuan Luo. The relative generalized Ham- [KSSY12] Cheonshik Kim, Dongkyoo Shin, ming weight of linear q-ary codes Dongil Shin, and Ching-Nung Yang. and their subcodes. Designs, Codes, A(2, 2) secret sharing scheme based and Cryptography, 48(2):111–123, on Hamming code and AMBTC. August 2008. CODEN DCCREC. Lecture Notes in Computer Sci- ISSN 0925-1022 (print), 1573-7586 ence, 7197:129–139, 2012. CODEN (electronic). URL http://www. LNCSD9. ISSN 0302-9743 (print), springerlink.com/openurl.asp? 1611-3349 (electronic). URL http: genre=article&issn=0925-1022& //link.springer.com/chapter/ volume=48&issue=2&spage=111. 10.1007/978-3-642-28490-8_14/. Karadeniz:2015:NEB Liu:2012:WIM

[KY15] Suat Karadeniz and Bahattin [LCWY12] Longcheng Liu, Yong Chen, Biao Yildiz. New extremal binary Wu, and Enyu Yao. Weighted in- self-dual codes of length 64 from verse minimum cut problem un- R3-lifts of the extended binary der the sum-type Hamming dis- Hamming code. Designs, Codes, tance. Lecture Notes in Computer and Cryptography, 74(3):673–680, Science, 7285:26–35, 2012. CODEN March 2015. CODEN DCCREC. LNCSD9. ISSN 0302-9743 (print), ISSN 0925-1022 (print), 1573-7586 1611-3349 (electronic). URL http: (electronic). URL http://link. //link.springer.com/chapter/ springer.com/article/10.1007/ 10.1007/978-3-642-29700-7_3/. s10623-013-9884-6. Lange:2001:UEP Lee:1998:RWH

[LA01] Christoph Lange and Andreas [Lee98] Jan Lee. Richard Wesley Ham- Ahrens. On the undetected er- ming: 1915–1998. IEEE Annals ror probability for shortened Ham- of the History of Computing, 20(2): ming codes on channels with mem- 60–62, April/June 1998. CODEN ory. Lecture Notes in Com- IAHCEX. ISSN 1058-6180 (print), puter Science, 2260:9–??, 2001. 1934-1547 (electronic). URL http:/ CODEN LNCSD9. ISSN 0302- /ieeexplore.ieee.org/iel4/85/ 9743 (print), 1611-3349 (electronic). 14609/00667309.pdf. REFERENCES 43

Levenshtein:2004:SPC Loomis:2002:RWH

[Lev04] V. I. Levenshtein. A system of poly- [LP02] Herschel H. Loomis and David S. nomials for the complex Hamming Potter. Richard W. Hamming spaces. In International Symposium (1915–1998). In Anonymous, edi- on Information Theory, 2004. ISIT tor, Memorial Tributes, volume 10, 2004. Proceedings. IEEE Computer pages 121–124. National Academy Society Press, 1109 Spring Street, Press, Washington, DC, USA, 2002. Suite 300, Silver Spring, MD 20910, ISBN 0-309-08457-1, 0-585-14960- USA, 2004. 7 (e-book), 0-309-05575-X. LCCN TA139 .N34 2002. URL http:// Liu:2009:TAH nap.edu/10403/chapter/23. Liu:2014:LHZ [Liu09] Andy Liu. Two applications of a Hamming code. College Mathe- [LPH14] Xing Liu, Daiyuan Peng, and matics Journal, 40(1):2–5, January Hongyu Han. Low-hit-zone fre- 2009. CODEN ???? ISSN 0746- quency hopping sequence sets with 8342 (print), 1931-1346 (electronic). optimal partial Hamming correla- URL http://www.tandfonline. tion properties. Designs, Codes, com/doi/abs/10.1080/07468342. and Cryptography, 73(1):167–176, 2009.11922327. October 2014. CODEN DCCREC. ISSN 0925-1022 (print), 1573-7586 Langtangen:2009:HE (electronic). URL http://link. [LL09] Hans Petter Langtangen and Olav springer.com/article/10.1007/ Lysne. The Hamming experience. In s10623-013-9817-4. Simula Research Laboratory, pages Long:2014:WHH 33–35. Springer-Verlag, Berlin, Ger- [LS14] Philip M. Long and Rocco A. Serve- many / Heidelberg, Germany / Lon- dio. On the weight of halfspaces don, UK / etc., October 2009. over Hamming balls. SIAM Jour- Legg:2017:GVF nal on Discrete Mathematics, 28(3): 1035–1061, ???? 2014. CODEN [LMWC17] Philip A. Legg, Eamonn Maguire, SJDMEC. ISSN 0895-4801 (print), Simon Walton, and Min Chen. 1095-7146 (electronic). Glyph visualization: A fail-safe Liu:2010:RGH design scheme based on quasi- Hamming distances. IEEE Com- [LWW10] Zihui Liu, Jie Wang, and Xin-Wen puter Graphics and Applications, Wu. On the relative generalized 37(2):31–41, March/April 2017. Hamming weights of linear codes CODEN ICGADZ. ISSN 0272- and their subcodes. SIAM Jour- 1716 (print), 1558-1756 (electronic). nal on Discrete Mathematics, 24(4): URL https://www.computer.org/ 1234–1241, ???? 2010. CODEN csdl/mags/cg/2017/02/mcg2017020031- SJDMEC. ISSN 0895-4801 (print), abs.html. 1095-7146 (electronic). REFERENCES 44

Liu:2008:IMM McCall:1959:NMR

[LY08] Longcheng Liu and Enyu Yao. In- [MH59] D. W. McCall and R. W. Hamming. verse min–max spanning tree prob- Nuclear magnetic resonance in crys- lem under the Weighted sum-type tals. Acta Crystallographica, 12(2): Hamming distance. Theoretical 81–86, February 1959. CODEN AC- Computer Science, 396(1–3):28–34, CRA9. ISSN 0365-110X (print), May 10, 2008. CODEN TCSCDI. 1600-8642 (electronic). See [MH63]. ISSN 0304-3975 (print), 1879-2294 McCall:1963:ENM (electronic). [MH63] D. W. McCall and R. W. Ham- Manz:2016:HGC ming. [Errata:] nuclear magnetic resonance in crystals. Acta Crys- [Man16] Olaf Manz. Hamming- und Golay- tallographica, 16(10):1071, October Codes. In Fehlerkorrigierende 1963. CODEN ACCRA9. ISSN Codes, pages 51–70. Springer 0365-110X (print), 1600-8642 (elec- Fachmedien Wiesbaden, December tronic). See [MH59]. 2016. Metropolis:1980:HCT Mandelberg:2018:RWH [MHR80] Nicholas Metropolis, Jack Howlett, [Man18] Martin Mandelberg. Richard and Gian-Carlo Rota, editors. A Wesley Hamming: Man, Math- History of Computing in the Twen- ematician, Mentor. ????, ????, tieth Century: a Collection of Es- 2018. ???? pp. URL says. Academic Press, New York, https://richardwesleyhamming. USA, 1980. ISBN 0-12-491650- com/foreword-of-the-book.In 3, 1-4832-9668-7 (e-book). LCCN preparation, Fall 2018; see [Kel18b]. QA75.5 .I63 1976. Original versions of these papers were presented at Mazurkiewicz:2003:SSH the International Research Confer- ence on the History of Computing, [Maz03] Jacek Mazurkiewicz. Systolic sim- held at the Los Alamos Scientiﬁc ulation of Hamming neural net- Laboratory, 10–15 June 1976. work. In Neural Networks and Soft Computing, pages 867–872. Physica- Mickens:1985:MAP Verlag HD, 2003. [Mic85] Ronald E. Mickens, editor. Mathe- Ma:2010:HCM matical analysis of physical systems. Van Nostrand Reinhold Co., New [MC10] Rick Ma and Samuel Cheng. Ham- York, NY, USA, 1985. ISBN 0-442- ming coding for multiple sources. 26077-6. x + 357 pp. LCCN QC20 In 2010 IEEE International Sym- .M36 1985. posium on Information Theory. Mitchell:2009:IHR IEEE Computer Society Press, 1109 Spring Street, Suite 300, Silver [Mit09] Gregory Mitchell. Investigation Spring, MD 20910, USA, June 2010. of Hamming, Reed–Solomon, and REFERENCES 45

Turbo forward error correcting matrices based on semidefinite pro- codes. Technical report, Defense gramming. SIAM Journal on Op- Technical Information Center, ????, timization, 20(6):3408–3426, ???? 2009. 2010. CODEN SJOPE8. ISSN Marinescu:2012:CQI 1052-6234 (print), 1095-7189 (electronic). URL http://epubs.siam. [MM12] Dan C. Marinescu and Gabriela M. org/siopt/resource/1/sjope8/ Marinescu, editors. Classical v20/i6/p3408_s1. and Quantum Information. Else- vier, Amsterdam, The Netherlands, Manthey:2005:ICH 2012. ISBN 0-12-383874-6 (hard- [MR05] Bodo Manthey and Rüdiger Reis- cover). xviii + 725 pp. LCCN chuk. The intractability of comput- QA76.889 .M363 2012. ing the Hamming distance. Theo- Morgan:1998:RWH retical Computer Science, 337(1–3): 331–346, June 9, 2005. CODEN [Mor98] Samuel P. Morgan. Richard Wes- TCSCDI. ISSN 0304-3975 (print), ley Hamming (1915–1998). No- 1879-2294 (electronic). tices of the American Mathemati- cal Society, 45(8):972–977, Septem- Martin:2002:DCP ber 1998. CODEN AMNOAN. ISSN 0002-9920 (print), 1088- [MS02] José Luis Fernández-Villacañas 9477 (electronic). URL http: Mart´ın and Mónica Sierra Sánchez. //www.ams.org/notices/199808/ Does crossover probability de- mem-morgan.pdf. pend on fitness and Hamming differences in genetic algorithms? Morgan:2002:HRW Lecture Notes in Computer Sci- ence, 2415:389–??, 2002. CO- [Mor02] Samuel P. Morgan. Hamming, DEN LNCSD9. ISSN 0302- Richard Wesley (1915–1998), math- 9743 (print), 1611-3349 (electronic). ematician and computer scientist. URL http://link.springer-ny. In Mark C. (Mark Christopher) com/link/service/series/0558/ Carnes, editor, American national bibs/2415/24150389.htm; http: biography online: the life of a na- //link.springer-ny.com/link/ tion is told by the lives of its peo- service/series/0558/papers/2415/ ple, volume 9, page ?? Oxford Uni- 24150389.pdf. versity Press, Walton Street, Oxford OX2 6DP, UK, July 2002. ISBN 0- Muniz:2006:IEH 19-520635-5 (24-volume set). LCCN CT213 .A68 1999. [Mun06] Marcelo Muniz. Isometric em- k beddings of Zp in the Ham- Mittelmann:2010:EBQ N k ming space Fp and Zp-linear [MP10] Hans Mittelmann and Jiming Peng. codes. Designs, Codes, and Cryp- Estimating bounds for quadratic as- tography, 41(2):147–152, Novem- signment problems associated with ber 2006. CODEN DCCREC. Hamming and Manhattan distance ISSN 0925-1022 (print), 1573-7586 REFERENCES 46

(electronic). URL http://www. OConnor:2012:RWH springerlink.com/openurl.asp? genre=article&issn=0925-1022& [OR12] J. J. O’Connor and E. F. Robert- volume=41&issue=2&spage=147. son. Richard Wesley Hamming. MacTutor History of Mathematics Morelos-Zaragoza:2002:AEC archive document., January 2012. URL http://www-history.mcs. [MZ02a] Robert H. Morelos-Zaragoza. The st-andrews.ac.uk/Biographies/ Art of Error Correcting Cod- Hamming.html. ing. John Wiley, New York, NY, Oren:2012:ASC USA, 2002. ISBN 0-471-49581- 6, 0-470-84782-4 (e-book), 0-470- [ORSW12] Yossef Oren, Mathieu Renauld, 85247-X (e-book), 0-470-03569-2 (e- Fran¸cois-Xavier Standaert, and book). xvi + 221 pp. LCCN Avishai Wool. Algebraic side- QA268 .M67 2002. URL http:// channel attacks beyond the Ham- onlinelibrary.wiley.com/book/ ming weight leakage model. Lecture 10.1002/0470847824. Notes in Computer Science, 7428: 140–154, 2012. CODEN LNCSD9. Morelos-Zaragoza:2002:HGR ISSN 0302-9743 (print), 1611-3349 (electronic). URL http://link. [MZ02b] Robert H. Morelos-Zaragoza. Ham- springer.com/chapter/10.1007/ ming, Golay and Reed–Muller 978-3-642-33027-8_9/. codes. In The Art of Er- ror Correcting Coding [MZ02a], Ostergaard:2002:CSH chapter 2, pages 23–32. ISBN [Ost02]¨ Patric R. J. Osterg˚¨ ard. Clas- 0-471-49581-6, 0-470-84782-4 (e- sifying subspaces of Hamming book), 0-470-85247-X (e-book), spaces. Designs, Codes, and Cryp- 0-470-03569-2 (e-book). LCCN tography, 27(3):297–305, December QA268 .M67 2002. URL http:// 2002. CODEN DCCREC. ISSN onlinelibrary.wiley.com/book/ 0925-1022 (print), 1573-7586 (elec- 10.1002/0470847824. tronic). URL http://ipsapp008. Olaya-Leon:2015:SGH lwwonline.com/content/getfile/ 4630/44/9/abstract.htm; http: //ipsapp008.lwwonline.com/content/ [OLGP15] Wilson Olaya-Le´on and Clau- getfile/4630/44/9/fulltext.pdf. dia Granados-Pinz´on. The second generalized Hamming weight Ostergaard:2004:REF of certain Castle codes. Designs, Codes, and Cryptography, 76(1):81– [OV04]¨ Patric R. J. Osterg˚¨ ard and Alexan- 87, July 2015. CODEN DCCREC. der Vardy. Resolving the existence ISSN 0925-1022 (print), 1573-7586 of full-rank tilings of binary Ham- (electronic). URL http://link. ming spaces. SIAM Journal on Dis- springer.com/article/10.1007/ crete Mathematics, 18(2):382–387, s10623-014-9981-1. 2004. CODEN SJDMEC. ISSN REFERENCES 47

0895-4801 (print), 1095-7146 (elec- Center — Rua Maestro Jo˜ao Seppe, tronic). URL http://epubs.siam. n. 900, 16. andar — Sala 163 — org/sam-bin/dbq/article/43580. S˜ao Carlos/SP - CEP: 13561-120, Brazil, February 2018. Pang:1986:CCC

[PE86] King F. Pang and Abbas El Gamal. Parnas:1989:CRD Communication complexity of com- + puting the Hamming distance. [PSvE 89] David L. Parnas, W. L. Scherlis, SIAM Journal on Computing,15 M. H. van Emden, Jacques Co- (4):932–947, ???? 1986. CODEN hen, R. W. Hamming, Richard M. SMJCAT. ISSN 0097-5397 (print), Karp, and Terry Winograd. Col- 1095-7111 (electronic). leagues respond to Dijkstra’s comments. Communications of the Perry:1993:RWH ACM, 32(12):1405–1413, December 1989. CODEN CACMA2. ISSN [Per93] Tekla S. Perry. Richard W. 0001-0782 (print), 1557-7317 (elec- Hamming. IEEE Spectrum,30 tronic). (5):80–82, May 1993. CODEN IEESAM. ISSN 0018-9235 (print), Pirsic:2014:DFT 1939-9340 (electronic). URL http://www.readabstracts.com/ [PW14] Gottlieb Isabel Pirsic and Arne Engineering-and-manufacturing- Winterhof. On discrete Fourier industries/Susan-Hackwood-Richard- transform, ambiguity, and Hamming- W-Hamming.html. autocorrelation of pseudorandom Phelps:1995:KNH sequences. Designs, Codes, and Cryptography, 73(2):319–328, [PL95] Kevin T. Phelps and Mike Levan. November 2014. CODEN DC- Kernels of nonlinear Hamming CREC. ISSN 0925-1022 (print), codes. Designs, Codes, and Cryp- 1573-7586 (electronic). URL http: tography, 6(3):247–257, November //link.springer.com/article/ 1995. CODEN DCCREC. ISSN 10.1007/s10623-013-9916-2. 0925-1022 (print), 1573-7586 (electronic). URL http://www.wkap. Parisi:2006:HDB nl/oasis.htm/93425. Panek:2018:CHE [PZ06] Giorgio Parisi and Francesco Zam- poni. On the high density behav- [PP18] Luciano Panek and Nayene Michele Paião ior of Hamming codes with fixed Panek. Códigos de Hamming es- minimum distance. Journal of Sta- tendidos como códigos perfeitos. tistical Physics, 123(6):1145–1167, In ????, Proceeding Series of the June 2006. CODEN JSTPSB. Brazilian Society of Computational ISSN 0022-4715 (print), 1572-9613 and Applied Mathematics. SBMAC: (electronic). URL http://link. Sociedade de Matemática Aplicada springer.com/article/10.1007/ e Computacional, Edif´ıcio Medical s10955-006-9142-7. REFERENCES 48

Rahim:2017:BED Robertson:1987:EDC [Rob87] James E. Robertson. Error- [Rah17] Robbi Rahim. Bit error detection detection and correction for ad- and correction with Hamming code dition and subtraction through algorithm. ????, September 2017. use of higher radix extensions of Rigas:2015:EMV Hamming codes. In Irwin and Stefanelli [IS87], pages 226–229. [REF15] Ioannis Rigas, George Economou, ISBN 0-8186-0774-2 (paperback), and Spiros Fotopoulos. Effi- 0-8186-4774-4 (microfiche), 0-8186- cient modeling of visual saliency 8774-6 (case). LCCN QA 76.9 based on local sparse representa- C62 S95 1987. URL http:// tion and the use of Hamming dis- www.acsel-lab.com/arithmetic/ tance. Computer Vision and Im- arith8/papers/ARITH8_Robertson. age Understanding: CVIU, 134 pdf. (??):33–45, May 2015. CODEN Robinson:2001:WMN CVIUF4. ISSN 1077-3142 (print), 1090-235X (electronic). URL [Rob01] Sara Robinson. Why mathemati- http://www.sciencedirect.com/ cians now care about their hat science/article/pii/S1077314215000223. color. New York Times, ??(??):F5, April 10, 2001. CODEN NYTIAO. Ren:2014:NSF ISSN 0362-4331 (print), 1542-667X, 1553-8095. URL https://search. [RFZ14] Wenli Ren, Fang-Wei Fu, and proquest.com/hnpnewyorktimes/ Zhengchun Zhou. New sets of docview/92030606/. frequency-hopping sequences with Rifa:2012:IHC optimal Hamming correlation. De- signs, Codes, and Cryptography,72 [RSV12] J. Rifà, F. I. Solov’eva, and M. Vil- (2):423–434, August 2014. CODEN lanueva. Intersection of Ham- DCCREC. ISSN 0925-1022 (print), ming codes avoiding Hamming sub- 1573-7586 (electronic). URL http: codes. Designs, Codes, and Cryp- //link.springer.com/article/ tography, 62(2):209–223, Febru- 10.1007/s10623-012-9774-3. ary 2012. CODEN DCCREC. ISSN 0925-1022 (print), 1573-7586 Rurik:2016:HCE (electronic). URL http://www. springerlink.com/openurl.asp? [RM16] William Rurik and Arya Mazum- genre=article&issn=0925-1022& dar. Hamming codes as error- volume=62&issue=2&spage=209. reducing codes. In 2016 IEEE Infor- Rifa:2015:EIH mation Theory Workshop (ITW). IEEE Computer Society Press, 1109 [RSV15a] J. Rifà, F. I. Solov’eva, and M. Vil- Spring Street, Suite 300, Silver lanueva. Erratum to: Intersection Spring, MD 20910, USA, September of Hamming codes avoiding Ham- 2016. ming subcodes. Designs, Codes, REFERENCES 49

and Cryptography, 74(1):283, Jan- 1088-6842 (electronic). URL uary 2015. CODEN DCCREC. http://www.ams.org/journals/ ISSN 0925-1022 (print), 1573-7586 mcom/1975-29-130/S0025-5718- (electronic). URL http://link. 75-99678-7/S0025-5718-75-99678- springer.com/article/10.1007/ 7.pdf. s10623-014-0011-0; http:// link.springer.com/content/pdf/ Sack:2016:RHH 10.1007/s10623-014-0011-0.pdf. [Sac16] Harald Sack. Richard Hamming Rifa:2015:SEH and the Hamming code. Web blog., February 11, 2016. URL http: [RSV15b] Josep Rifà, Faina I. Solov’eva, and //scihi.org/richard-hamming- Mercè Villanueva. Self-embeddings hamming-code/. of Hamming Steiner triple systems of small order and APN Salman:2013:HDD permutations. Designs, Codes, [Sal13] Raied Salman. Hamming distance and Cryptography, 75(3):405–427, and data compression of 1-D CA. June 2015. CODEN DCCREC. In Computer Science & Information ISSN 0925-1022 (print), 1573-7586 Technology (CS & IT). Academy (electronic). URL http://link. & Industry Research Collaboration springer.com/article/10.1007/ Center (AIRCC), ????, May 2013. s10623-013-9909-1. Ramezanpour:2012:CAS Samorodnitsky:2017:IFH [RZ12] A. Ramezanpour and R. Zecchina. [Sam17] Alex Samorodnitsky. An inequal- Cavity approach to sphere packing ity for functions on the Hamming in Hamming space. Physical Re- cube. Combinatorics, Probabil- view E (Statistical physics, plasmas, ity and Computing, 26(3):468–480, fluids, and related interdisciplinary May 2017. CODEN CPCOFG. topics), 85(2):021106, February 6, ISSN 0963-5483 (print), 1469-2163 2012. CODEN PLEEE8. ISSN (electronic). URL /core/product/ 1539-3755 (print), 1550-2376 (elec- 3770E7921E125EF4A73A413E396348CB. tronic). URL https://link. Scaife:1974:SNA aps.org/doi/10.1103/PhysRevE. 85.021106. [Sca74] B. K. P. (Brendan Kevin Patrick) S:1975:BRR Scaife, editor. Studies in numerical analysis: papers in hon- [S.75] J. S. Book review: R. W. Hamming, our of Cornelius Lanczos. Aca- Numerical Methods for Scientists demic Press, New York, USA, and Engineers, 2nd ed., McGraw- 1974. ISBN 0-12-621150-7. xxii Hill Book Co., New York, 1973, + 333 pp. LCCN QA297 ix + 721 pp., 24 cm. Mathemat- .S86. URL http://catalog. ics of Computation, 29(130):648– hathitrust.org/Record/000575557. 649, May 1975. CODEN MCM- Published for the Royal Irish PAF. ISSN 0025-5718 (print), Academy. REFERENCES 50

Schulz:1991:HCE Stearns:1999:DVA

[Sch91] Ralph-Hardo Schulz. Hamming- [SH99] Samuel D. Stearns and Don R. Codes und erweiterte Hamming- Hush, editors. Digitale Verarbeitung Codes. (German) [Hamming codes analoger Signale. (German) [Digital and extended Hamming codes]. In Analysis of Analog Signal]. Wal- Codierungstheorie. (German) [Cod- ter de Gruyter, New York, NY, ing theory], pages 111–115. Vieweg USA and Berlin, Germany, Decem- + Teubner Verlag, Braunschweig, ber 1999. 571 pp. Germany, 1991. Shallit:2009:HDC

Schulz:2003:HCE [Sha09] Jeffrey Shallit. Hamming distance for conjugates. Discrete Math- [Sch03] Ralph-Hardo Schulz. Hamming- ematics, 309(12):4197–4199, June Codes und erweiterte Hamming- 2009. CODEN DSMHA4. ISSN Codes. (German) [Hamming codes 0012-365X (print), 1872-681X (elec- and extended Hamming codes]. In tronic). Codierungstheorie. (German) [Cod- ing theory], pages 112–116. Vieweg Shepherd:1995:PPH + Teubner Verlag, Braunschweig, Germany, 2003. [She95] S. J. Shepherd. Primitive polynomials over GF(2) of Hamming weight Serov:2011:LDH 3 and 5 up to high order. Report 573, Electronic and Electrical En- [Ser11] A. A. Serov. Limit distribution gineering Department, University of of the Hamming distance from the Bradford, Bradford, Yorkshire, UK, random Boolean function to the March 1995. set of affine functions. Theory of Probability and its Applications,55 Sivakoff:2014:SPD (4):717–722, ???? 2011. CODEN [Siv14] David Sivakoff. Site percola- TPRBAU. ISSN 0040-585X (print), tion on the d-dimensional Ham- 1095-7219 (electronic). URL http:/ ming torus. Combinatorics, Prob- /epubs.siam.org/tvp/resource/ ability and Computing, 23(2):290– 1/tprbau/v55/i4/p717_s1. 315, March 2014. CODEN CP- COFG. ISSN 0963-5483 (print), Stearns:1990:DSA 1469-2163 (electronic). [SH90] Samuel D. Stearns and Don R. Sarvepalli:2010:DQC Hush. Digital Signal Analysis. Pren- tice Hall signal processing series. [SK10a] Pradeep Sarvepalli and Andreas Prentice-Hall, Upper Saddle River, Klappenecker. Degenerate quantum NJ 07458, USA, second edition, codes and the quantum Hamming 1990. ISBN 0-13-213117-X, 0-13- bound. Physical Review A (Atomic, 211772-X (paperback). xviii + 440 Molecular, and Optical Physics), pp. LCCN TK5102.5 .S698 1990. 81(3):032318, March 19, 2010. REFERENCES 51

CODEN PLRAAN. ISSN 1050- Sakai:2002:AES 2947 (print), 1094-1622, 1538-4446, 1538-4519. URL https://link. [SS02] Yasuyuki Sakai and Kouichi Saku- aps.org/doi/10.1103/PhysRevA. rai. Algorithms for efficient simul- 81.032318. taneous elliptic scalar multiplication with reduced joint Hamming Savari:2010:WHM weight representation of scalars. Lecture Notes in Computer Sci- [SK10b] S. A. Savari and J. Kliewer. ence, 2433:484–??, 2002. CO- When Huffman meets Hamming: DEN LNCSD9. ISSN 0302- a class of optimal variable-length 9743 (print), 1611-3349 (electronic). error correcting codes. In Storer URL http://link.springer-ny. and Marcellin [SM10], pages com/link/service/series/0558/ 327–336. ISBN 0-7695-3994- bibs/2433/24330484.htm; http: 7. ISSN 1068-0314 (print), //link.springer-ny.com/link/ 2375-0359 (electronic). LCCN service/series/0558/papers/2433/ ???? URL http://ieeexplore. 24330484.pdf. ieee.org/stamp/stamp.jsp?tp=& arnumber=5453476. Stakhov:2018:MCS Storer:2010:DPD [Sta18] Alexey Stakhov. Mission-critical systems, paradox of Hamming [SM10] James A. (James Andrew) Storer code, row hammer effect, ‘Tro- and Michael W. Marcellin, editors. jan Horse’ of the binary sys- DDC 2010: proceedings: Data Com- tem and numeral systems with ir- pression Conference: 24–26 March rational bases. The Computer 2010, Snowbird, Utah. IEEE Com- Journal, 61(7):1038–1063, July 1, puter Society Press, 1109 Spring 2018. CODEN CMPJA6. ISSN Street, Suite 300, Silver Spring, MD 0010-4620 (print), 1460-2067 (elec- 20910, USA, 2010. ISBN 0-7695- tronic). URL http://academic. 3994-7. ISSN 1068-0314 (print), oup.com/comjnl/article/61/7/ 2375-0359 (electronic). LCCN 1038/4430323. ???? URL http://ieeexplore. ieee.org/stamp/stamp.jsp?tp=& Stinson:2002:SBS arnumber=5453521. [Sti02] D. R. Stinson. Some baby- Solomon:2000:GED step giant-step algorithms for the low Hamming weight discrete log- [Sol00] G. Solomon. Golay encoding/ arithm problem. Mathematics decoding via BCH–Hamming. Com- of Computation, 71(237):379–391, puters and Mathematics with Appli- January 2002. CODEN MCM- cations, 39(11):103–108, June 2000. PAF. ISSN 0025-5718 (print), 1088- CODEN CMAPDK. ISSN 0898- 6842 (electronic). URL http:/ 1221 (print), 1873-7668 (electronic). /www.ams.org/journal-getitem? URL http://www.sciencedirect. pii=S0025-5718-01-01310-2; com/science/article/pii/S0898122100001140http://www.ams.org/mcom/2002-. REFERENCES 52

71-237/S0025-5718-01-01310-2/ Swartzlander:2015:CAc S0025-5718-01-01310-2.dvi; http://www.ams.org/mcom/2002- [Swa15c] Earl E. Swartzlander, Jr., editor. 71-237/S0025-5718-01-01310-2/ Computer Arithmetic, volume 3. S0025-5718-01-01310-2.pdf; World Scientific Publishing Co. Pte. http://www.ams.org/mcom/2002- Ltd., P. O. Box 128, Farrer Road, 71-237/S0025-5718-01-01310-2/ Singapore 9128, 2015. ISBN 981- S0025-5718-01-01310-2.ps; http: 4651-13-3 (hardcover), 981-4641-47- //www.ams.org/mcom/2002-71-237/ 2 (e-book). xvii + 451 pp. LCCN S0025-5718-01-01310-2/S0025- QA76.6 .C633 2015 vol. 3. 5718-01-01310-2.tex. Swetina:1989:FSM Swartzlander:1990:CAb [Swe89] J. Swetina. First and second mo- [Swa90] Earl E. Swartzlander, Jr. Computer ments and the mean Hamming dis- Arithmetic, volume 2. IEEE Com- tance in a stochastic replication- puter Society Press, 1109 Spring mutation model for biological Street, Suite 300, Silver Spring, MD macromolecules. Journal of Mathe- 20910, USA, 1990. ISBN 0-8186- matical Biology, 27(4):463–483, Au- 8945-5. ix + 396 pp. LCCN QA76.9 gust 1989. CODEN JMBLAJ. .C62C66 1990. This is part of a ISSN 0303-6812 (print), 1432-1416 two-volume collection of influential (electronic). URL http://link. papers on the design of computer springer.com/article/10.1007/ arithmetic. See also [?]. BF00290640. Swartzlander:2015:CAa Sutton:2012:CMB [Swa15a] Earl E. Swartzlander, Jr., editor. [SWH12] Andrew M. Sutton, L. Darrell Computer Arithmetic, volume 1. Whitley, and Adele E. Howe. World Scientific Publishing Co. Pte. Computing the moments of k- Ltd., P. O. Box 128, Farrer Road, bounded pseudo-Boolean functions Singapore 9128, 2015. ISBN 981- over Hamming spheres of arbitrary 4651-56-7 (vol. 1; hardcover), 981- radius in polynomial time. The- 4651-57-5, 981-4641-47-2 (e-book). oretical Computer Science, 425(1): ???? pp. LCCN QA76.6 .C633 2015 58–74, March 30, 2012. CODEN vol. 1. TCSCDI. ISSN 0304-3975 (print), Swartzlander:2015:CAb 1879-2294 (electronic). URL http://www.sciencedirect.com/ [Swa15b] Earl E. Swartzlander, Jr., editor. science/article/pii/S0304397511001101. Computer Arithmetic, volume 2. World Scientific Publishing Co. Pte. Takashima:1996:HWT Ltd., P. O. Box 128, Farrer Road, Singapore 9128, 2015. ISBN 981- [Tak96] Keizo Takashima. On Hamming 4641-46-4 (hardcover), 981-4641-47- weight test and sojourn time test 2 (e-book). xxxviii + 446 pp. LCCN of m-sequences. Monte Carlo QA76.6 .C633 2015 vol. 2. Methods and Applications, 2(4): REFERENCES 53

331–340, ???? 1996. CO- 0024-094X (print), 1530-9282 (elec- DEN MCMAC6. ISSN 0929- tronic). URL https://www.jstor. 9629 (print), 1569-3961 (electronic). org/stable/1572868. URL http://www.degruyter.com/ view/j/mcma.1996.2.issue-4/mcma. Trevisan:1997:WHM 1996.2.4.331/mcma.1996.2.4.331. [Tre97] Luca Trevisan. When Ham- xml. ming meets Euclid: the ap- Terrell:1978:BRD proximability of geometric TSP and MST (extended abstract). [Ter78] T. J. Terrell. Book review: Dig- In ACM [ACM97], pages 21– ital Filters Hamming, Richard 29. ISBN 0-89791-888-6. LCCN W. (Prentice-Hall Inc., 1977, 226 QA76.5 .A849 1997. URL http: pp., $14.35). International Jour- //www.acm.org/pubs/articles/ nal of Electrical Engineering Ed- proceedings/stoc/258533/p21- ucation, 15(3):288, July 1978. trevisan/p21-trevisan.pdf; CODEN IJEEAF. ISSN 0020- http://www.acm.org/pubs/citations/ 7209. URL http://journals. proceedings/stoc/258533/p21- sagepub.com/doi/pdf/10.1177/ trevisan/. ACM order no. 508970. 002072097801500327. Trevisan:2000:WHM Terrell:1984:BRD [Tre00] Luca Trevisan. When Hamming [Ter84] T. J. Terrell. Book review: Digi- meets Euclid: The approximabil- tal Filters, (Second Edition): Ham- ity of geometric TSP and Steiner ming, R. W. (Prentice-Hall, 1983, tree. SIAM Journal on Computing, 257 pp., $26.05). International 30(2):475–485, April 2000. CODEN Journal of Electrical Engineering SMJCAT. ISSN 0097-5397 (print), Education, 21(1):94–95, January 1095-7111 (electronic). URL http: 1984. CODEN IJEEAF. ISSN 0020- //epubs.siam.org/sam-bin/dbq/ 7209. article/35273. Tukey:1949:MNC Tulpan:2014:TPP [TH49] John W. Tukey and R. W. Ham- [TSM14] Dan Tulpan, Derek H. Smith, and ming. Measuring noise color. Tech- Roberto Montemanni. Thermody- nical memorandum, Bell Laborato- namic post-processing versus GC- ries, Murray Hill, NJ, USA, 1949. content pre-processing for DNA 1–127 pp. codes satisfying the Hamming dis- Thompson:1973:BRC tance and reverse-complement constraints. IEEE/ACM Transac- [Tho73] Michael Thompson. Book review: tions on Computational Biology Computers and Society, by Richard and Bioinformatics, 11(2):441–452, W. Hamming. Leonardo (Ox- March 2014. CODEN ITCBCY. ford, England), 6(4):368, Autumn ISSN 1545-5963 (print), 1557-9964 1973. CODEN LEONDP. ISSN (electronic). REFERENCES 54

Tannenbaum:2004:IDL ory and Related Fields, 147(1–2):1– 41, May 2010. CODEN PTRFEU. [TSS04] Emmanuel Tannenbaum, James L. ISSN 0178-8051 (print), 1432-2064 Sherley, and Eugene I. Shakhnovich. (electronic). URL http://link. Imperfect DNA lesion repair in springer.com/article/10.1007/ the semiconservative quasispecies s00440-009-0200-3. model: Derivation of the Ham- ming class equations and solu- Viswanath:2006:MCL tion of the single-ﬁtness peak land- [VR06] G. Viswanath and B. Sundar Ra- scape. Physical Review E (Statis- jan. Matrix characterization of lin- tical physics, plasmas, ﬂuids, and ear codes with arbitrary Hamming related interdisciplinary topics),70 weight hierarchy. Linear Algebra (6):061915, December 30, 2004. and Its Applications, 412(2–3):396– CODEN PLEEE8. ISSN 1539- 407, January 15, 2006. CODEN 3755 (print), 1550-2376 (electronic). LAAPAW. ISSN 0024-3795 (print), URL https://link.aps.org/doi/ 1873-1856 (electronic). 10.1103/PhysRevE.70.061915. vanderGeer:1994:GHW Tromp:1995:SWB [VV94] G. Van der Geer and M. Van [TZZ95] J. Tromp, L. Zhang, and Y. Zhao. der Vlugt. Generalized Hamming Small weight bases for Hamming weights of Melas codes and dual codes. Lecture Notes in Computer Melas codes. SIAM Journal on Dis- Science, 959:235–??, 1995. CODEN crete Mathematics, 7(4):554–559, LNCSD9. ISSN 0302-9743 (print), November 1994. CODEN SJDMEC. 1611-3349 (electronic). ISSN 0895-4801 (print), 1095-7146 Tromp:1997:SWB (electronic). [TZZ97] John Tromp, Louxin Zhang, and Wong:2014:PHD Ying Zhao. Small weight bases for Hamming codes. Theoretical [WK14] Kok-Seng Wong and Myung Ho Computer Science, 181(2):337–345, Kim. On private Hamming dis- July 30, 1997. CODEN TCSCDI. tance computation. The Jour- ISSN 0304-3975 (print), 1879- nal of Supercomputing, 69(3):1123– 2294 (electronic). URL http:// 1138, September 2014. CODEN www.elsevier.com/cgi-bin/cas/ JOSUED. ISSN 0920-8542 (print), tree/store/tcs/cas_sub/browse/ 1573-0484 (electronic). URL http: browse.cgi?year=1997&volume= //link.springer.com/article/ 181&issue=2&aid=2480. 10.1007/s11227-013-1063-z. vanderHofstad:2010:RSH Wang:2014:HEK [vdHL10] Remco van der Hofstad and Mal- [WZNM14] Feng Wang, Wan-Lei Zhao, wina J. Luczak. Random subgraphs Chong-Wah Ngo, and Bernard of the 2D Hamming graph: the su- Merialdo. A Hamming embed- percritical phase. Probability The- ding kernel with informative bag- REFERENCES 55

of-visual words for video seman- URL http://link.springer-ny. tic indexing. ACM Transactions com/link/service/series/0558/ on Multimedia Computing, Com- bibs/2122/21220159.htm; http: munications, and Applications,10 //link.springer-ny.com/link/ (3):26:1–26:??, April 2014. CODEN service/series/0558/papers/2122/ ???? ISSN 1551-6857 (print), 1551- 21220159.pdf. 6865 (electronic). Zhuang:2013:CCE Wang:2017:NBP [ZLD13] Zhuojun Zhuang, Yuan Luo, and [WZYG17] Xin Wang, Yiwei Zhang, Yit- Bin Dai. Code constructions and ing Yang, and Gennian Ge. New existence bounds for relative gener- bounds of permutation codes un- alized Hamming weight. Designs, der Hamming metric and Kendall’s Codes, and Cryptography, 69(3): τ-metric. Designs, Codes, and 275–297, December 2013. CODEN Cryptography, 85(3):533–545, De- DCCREC. ISSN 0925-1022 (print), cember 2017. CODEN DCCREC. 1573-7586 (electronic). URL http: ISSN 0925-1022 (print), 1573-7586 //link.springer.com/article/ (electronic). URL https://link. 10.1007/s10623-012-9657-7. springer.com/article/10.1007/ Zhou:2012:AHC s10623-016-0321-5. [ZTYP12] Zhengchun Zhou, Xiaohu Tang, Zhao:2013:EHW Yang Yang, and Udaya Parampalli. [ZGZ+13] Xinjie Zhao, Shize Guo, Fan On the aperiodic Hamming correla- Zhang, Tao Wang, Zhijie Shi, tion of frequency-hopping sequences Huiying Liu, Keke Ji, and Jing from norm functions. Lecture Notes Huang. Eﬃcient Hamming weight- in Computer Science, 7280:148– based side-channel cube attacks 158, 2012. CODEN LNCSD9. on PRESENT. The Journal of ISSN 0302-9743 (print), 1611-3349 Systems and Software, 86(3):728– (electronic). URL http://link. 743, March 2013. CODEN JS- springer.com/chapter/10.1007/ SODM. ISSN 0164-1212 (print), 978-3-642-30615-0_14/. 1873-1228 (electronic). URL http://www.sciencedirect.com/ science/article/pii/S0164121212003081. Ziegler:2001:CHG

[Zie01] G¨unter M. Ziegler. Coloring Ham- ming graphs, optimal binary codes, and the 0/1-Borsuk problem in low dimensions. Lecture Notes in Com- puter Science, 2122:159–??, 2001. CODEN LNCSD9. ISSN 0302- 9743 (print), 1611-3349 (electronic).