Error-correcting codes from permutation groups (Q1043942)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Error-correcting codes from permutation groups |
scientific article; zbMATH DE number 5644941
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Error-correcting codes from permutation groups |
scientific article; zbMATH DE number 5644941 |
Statements
Error-correcting codes from permutation groups (English)
0 references
10 December 2009
0 references
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.
0 references
error-correcting code
0 references
permutation group
0 references
base
0 references
covering design
0 references
graph decomposition
0 references
0 references
