The syndromes decoding algorithm in group codes (Q6156920)

For semisimple algebras \(\mathbb{K}G\), a general and efficient decoding algorithm for group codes is provided. This method is based on the syndrome decoding algorithm and uses the decomposition of a semisimple group algebra as a direct sum of two-sided ideals generated by a central idempotent of \(\mathbb{K}G\). For the abelian case a simpler version of this algorithm is presented. Some examples are given to describe the process of this algorithm.