Error-correcting codes from permutation groups
type: Item
instance of: scholarly article
title: Error-correcting codes from permutation groups
zbMATH Open document ID: 1184.94273
author: Robert F. Bailey
published in: Discrete Mathematics
publication date: 2009-12-10T00:00:00Z
review text: 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.
reviewed by: Piroska Lakatos
Mathematics Subject Classification ID: 94B25
Mathematics Subject Classification ID: 05B40
Mathematics Subject Classification ID: 20B35
zbMATH DE Number: 5644941
zbMATH Keywords: error-correcting code
zbMATH Keywords: permutation group
zbMATH Keywords: base
zbMATH Keywords: covering design
zbMATH Keywords: graph decomposition
describes a project that uses: GAP
MaRDI profile type: Publication
full work available at URL: j.disc.2008.12.027
OpenAlex ID: W2154926368
cites work: Uncoverings-by-bases for base-transitive permutation groups.
cites work: Decoding the Mathieu group \(M_{12}\)
cites work: Distance Enumerators for Permutation Groups
cites work: Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns
cites work: Permutation codes for discrete channels (Corresp.)
cites work: Coding with permutations
cites work: Q5421810
cites work: Fundamental algorithms for permutation groups
cites work: Q4231664
cites work: Constructions for permutation codes in powerline communications
cites work: New constructions for covering designs
cites work: Powerline communication and the 36 officers problem
cites work: Most primitive groups have messy invariants
cites work: Q4026151
cites work: Q5617749
cites work: Q4376970
DOI: 10.1016/J.DISC.2008.12.027
description: scientific article; zbMATH DE number 5644941