Check character systems over groups and orthogonal Latin squares (Q1912704)

In a check character system, a single check character is added in order to detect all single errors and neighbour transpositions (or some other double errors). The characters are elements of a finite map \(G\) and permutations of \(G\) are used to define the check character. Necessary and sufficient conditions are given for the desired error-detection capability, as well as examples. In the second part, error detecting codes with two check characters are treated for recognizing double errors. Some examples use fixed point free automorphisms, the existence of which is equivalent to that of some special sets of mutually orthogonal Latin squares.