X-Nico

unusual facts about Block code



Berlekamp–Welch algorithm

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

Hamming bound

In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere-packing bound or the volume bound from an interpretation in terms of packing balls in the Hamming metric into the space of all possible words.


see also