hamming distance
81Concatenated error correction code — In coding theory, concatenated codes form a class of error correcting codes that are derived by combining an inner code and an outer code. They were conceived in 1966 by Dave Forney as a solution to the problem of finding a code that has both… …
82Convolutional code — In telecommunication, a convolutional code is a type of error correcting code in which each m bit information symbol (each m bit string) to be encoded is transformed into an n bit symbol, where m/n is the code rate (n ≥ m) and the transformation… …
83Sørensen similarity index — The Sørensen index, also known as Sørensen’s similarity coefficient, is a statistic used for comparing the similarity of two samples. It was developed by the botanist Thorvald Sørensen and published in 1948 [Sørensen, T. (1948) A method of… …
84Similarity (geometry) — Geometry = Two geometrical objects are called similar if one is congruent to the result of a uniform scaling (enlarging or shrinking) of the other. One can be obtained from the other by uniformly stretching , possibly with additional rotation,… …
85Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… …
86Cosine similarity — is a measure of similarity between two vectors by measuring the cosine of the angle between them. The cosine of 0 is 1, and less than 1 for any other angle. The cosine of the angle between two vectors thus determines whether two vectors are… …
87Cyclic redundancy check — A cyclic redundancy check (CRC) is an error detecting code designed to detect accidental changes to raw computer data, and is commonly used in digital networks and storage devices such as hard disk drives. Blocks of data entering these systems… …
88Artificial immune system — Artificial immune systems (AIS) are computational systems inspired by the principles and processes of the vertebrate immune system. The algorithms typically exploit the immune system s characteristics of learning and memory to solve a problem.… …
89Repetition code — is an (r,1) coding scheme that repeats the bits across a channel to achieve error free communication (r is the number of bits in each codeword for each data bit to be coded). Repetition code is generally a very naive method of encoding data… …
90Hypercube graph — The hypercube graph Q4 Vertices 2n Edges 2n−1n …
