hamming distance
61List of algebraic coding theory topics — This is a list of algebraic coding theory topics. ARQ[disambiguation needed  ] Adler 32 BCH code BCJR algorithm Berger code Berlekamp Massey algo …
62Covering code — In coding theory, a covering code is an object satisfying a certain mathematical property: A code of length n over Q is an R covering code if for every word of Qn there is a codeword such that their Hamming distance is . Contents 1 Definition 2… …
63Johnson bound — The Johnson bound is a bound on the size of error correcting codes.Let C be a q ary code of length n, i.e. a subset of mathbb{F} q^n. Let d be the minimum distance of C, i.e. :d = min {x,y in C, x eq y} d(x,y) where d(x,y) is the Hamming distance …
64Closest string — In theoretical computer science, closest string is the name of an NP hard computational problem, which tries to find the geometrical center of a set of input strings. To understand the word center it is necessary to define a distance between two… …
652-satisfiability — In computer science, 2 satisfiability (abbreviated as 2 SAT or just 2SAT) is the problem of determining whether a collection of two valued (Boolean or binary) variables with constraints on pairs of variables can be assigned values satisfying all… …
66List of University of Illinois at Urbana-Champaign people — This is an incomplete list of notable people associated with the University of Illinois at Urbana Champaign in the United States of America. Bill Gates noted in a February 2004 speech that Microsoft hires more alumni of the university than from… …
67Taxicab geometry — versus Euclidean distance: In taxicab geometry all three pictured lines (red, blue, and yellow) have the same length (12) for the same route. In Euclidean geometry, the green line has length 6×√2 ≈ 8.48, and is the unique shortest path …
68List of electronics topics — Alphabetization has been neglected in some parts of this article (the b section in particular). You can help by editing it. This is a list of communications, computers, electronic circuits, fiberoptics, microelectronics, medical electronics,… …
69Block code — In computer science, a block code is a type of channel coding. It adds redundancy to a message so that, at the receiver, one can decode with minimal (theoretically zero) errors, provided that the information rate (amount of transported… …
70Morphogenic network/Inspiration for morphogenic network — Inspiration for morphogenic network= Genetic algorithm with branchingThis theory was inspired by an attempt to apply the genetic algorithm to a classifier system. The traditional genetic algorithm fails to take into account that the gene pool is… …
