A ๐-ary codeC is said to be systematic on positions {๐๐}๐๐=1 iff a given codeword ๐โC is completely determined by the values of ๐๐๐, 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