Error-correcting codes from permutation groups

Discrete Mathematics

Volumn 309, Issue 13, 2009, Pages 4253-4265

  Bailey, Robert F ^a  

^a CARLETON UNIVERSITY   (Canada)

Author keywords

Base; Covering design; Error correcting code; Graph decomposition; Permutation group

Indexed keywords

BASE; COVERING DESIGN; ERROR-CORRECTING CODE; GRAPH DECOMPOSITION; PERMUTATION GROUP;

ARTIFICIAL INTELLIGENCE; DECOMPOSITION; GRAPH THEORY; WIRELESS TELECOMMUNICATION SYSTEMS;

INFORMATION THEORY;

EID: 67349095347     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2008.12.027     Document Type: Article

References (20)

1. R.F. Bailey, Permutation groups, error-correcting codes and uncoverings, Ph.D. Thesis, University of London, 2006
2. Bailey R.F. Uncoverings-by-bases for base-transitive permutation groups. Des. Codes Cryptogr. 41 (2006) 153-176
3. 12. Adv. Math. Commun. 1 (2007) 477-487
4. Bailey R.F., and Dixon J.P. Distance enumerators for permutation groups. Comm. Algebra 35 (2007) 3045-3051
5. R.F. Bailey, T. Prellberg, Decoding generalised hyperoctahedral groups and asymptotic analysis of correctible error patterns (in preparation)
6. Blake I.F. Permutation codes for discrete channels. IEEE Trans. Inform. Theory 20 (1974) 138-140
7. Blake I.F., Cohen G., and Deza M. Coding with permutations. Inf. Control 43 (1979) 1-19
8. Bryant D.E. Cycle decompositions of complete graphs. In: Hilton A.J.W., and Talbot J. (Eds). Surveys in Combinatorics 2007. London Mathematical Society Lecture Note Series 346 (2007), Cambridge University Press, Cambridge
9. Butler G. Fundamental Algorithms for Permutation Groups. Lecture Notes in Computer Science 559 (1991), Springer-Verlag, Berlin
10. Cameron P.J. Permutation Groups. London Mathematical Society Student Texts 45 (1999), Cambridge University Press, Cambridge
11. Chu W., Colbourn C.J., and Dukes P. Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32 (2004) 51-64
12. The GAPGroup, GAP - Groups Algorithms, and Programming Version 4.4, 2004. http://www.gap-system.org
13. D.M. Gordon, La Jolla Covering Repository. http://www.ccrwest.org/cover.html
14. Gordon D.M., Kuperberg G., and Patashnik O. New constructions for covering designs. J. Comb. Des. 3 (1995) 269-284
15. Huczynska S. Powerline communications and the 36 officers problem. Phil. Trans. Royal Soc. A 364 (2006) 3199-3214
16. Huffman W.C. Codes and groups. In: Pless V.S., and Huffman W.C. (Eds). Handbook of Coding Theory (1998), Elsevier, Amsterdam
17. E. Lucas, Récreations Mathématiqués, vol II, Paris, 1892
18. Mills W.H., and Mullin R.C. Coverings and packings. In: Dinitz J.H., and Stinson D.R. (Eds). Contemporary Design Theory: A Collection of Surveys (1992), John Wiley & Sons, New York
19. Sims C.C. Determining the conjugacy classes of a permutation group. In: Birkhoff G., and Hall M. (Eds). Computers in Algebra and Number Theory (1971), American Mathematical Society, Providence
20. Wilson R.J. Introduction to Graph Theory. 4th ed. (1996), Prentice Hall, Harlow