X-Nico

Berlekamp–Welch algorithm

In the problem of decoding Reed–Solomon codes, the inputs are pair wise distinct evaluation points $\backslash alpha\; i$’s (i = 1, . . ., n) where $\backslash alpha\; i\; \backslash in\; \backslash mathbb\{F\}$ with dimension $K$ and distance $D\; =\; N\; -\; K\; +\; 1$ and a codeword $y$ = $(y\; 1,\; \backslash ldots\; ,\; y\; n)\; \backslash in\; \backslash mathbb\{F\}\; n$.

CSS code

Let $C\; 1$ and $C\; 2$ be two (classical) $n,k\; 1$, $n,k\; 2$ codes such, that $C\; 2\; \backslash subset\; C\; 1$ and $C\; 1\; ,\; C\; 2^\backslash perp$ both have minimal distance $\backslash geq\; 2t+1$, where $C\; 2^\backslash perp$ is the code dual to $C\; 2$.

Minimum distance

Closest pair of points problem, the algorithmic problem of finding two points that have the minimum distance among a larger set of points

•

Minimum distance estimation, a statistical method for fitting a model to data

•

Shortest path problem, the minimum length of a path between two points in a graph

•

Euclidean distance, the minimum length of any curve between two points in the plane

see also

Ole Jørgen Hammeken

In February 2009, Hammeken planned a centennial dog sled trip from northern Canada to the North Pole, 771 km (480 mi), one-way, minimum distance, retracing the footsteps of Robert Peary.