Error-correcting codes from permutation groups
The usual setting for error-correcting codes is replaced with permutation groups \(G\). An decoding algorithm is given using a combinatorial structure (called by the author an \textit{uncovering-by-bases}) related to covering designs. Several examples of this are constructed and the complexity of the algorithm is analyzed. A conjecture is formulated about uncovering-by-bases for \(G\) and it is proved in some special cases. The implication of this conjecture for the complexity of the decoding algorithm is also discussed.
scientific article; zbMATH DE number 5644941