Code

Systematic code

A π‘ž-ary code C is said to be systematic on positions {π‘Ÿπ‘–}π‘˜π‘–=1 iff a given codeword 𝑐 ∈C is completely determined by the values of π‘π‘Ÿπ‘–, #m/def/code i.e. |C| =π‘žπ‘˜ and there is exactly one codeword for every choice of the coΓΆrdinates in the positions. Such codes are sometimes called separable, since one may separate information digits from redundant (check) digits.1


#state/tidy | #lang/en | #SemBr

Footnotes

  1. 1999. Introduction to coding theory, Β§3.2, p. 36 ↩