# American Institute of Mathematical Sciences

November  2007, 1(4): 477-487. doi: 10.3934/amc.2007.1.477

## Decoding the Mathieu group M12

 1 School of Mathematics and Statistics, Carleton University, 1125 Colonel By Drive, Ottawa, Ontario K1S 5B6, Canada 2 School of Mathematical Sciences, Queen Mary, University of London, Mile End Road, London, E1 4NS, United Kingdom

Received  June 2007 Revised  October 2007 Published  October 2007

The sporadic Mathieu group M12 can be viewed as an error-correcting code, where the codewords are the group's elements written as permutations in list form, and with the usual Hamming distance. We investigate the properties of this group as a code, in particular determining completely the probabilities of successful and ambiguous decoding of words with more than 3 errors (which is the number that can be guaranteed to be corrected).
Citation: Robert F. Bailey, John N. Bray. Decoding the Mathieu group M12. Advances in Mathematics of Communications, 2007, 1 (4) : 477-487. doi: 10.3934/amc.2007.1.477
 [1] Adrian Korban, Serap Sahinkaya, Deniz Ustun. New type I binary $[72, 36, 12]$ self-dual codes from $M_6(\mathbb{F}_2)G$ - Group matrix rings by a hybrid search technique based on a neighbourhood-virus optimisation algorithm. Advances in Mathematics of Communications, 2022  doi: 10.3934/amc.2022032 [2] Sihuang Hu, Gabriele Nebe. There is no $[24,12,9]$ doubly-even self-dual code over $\mathbb F_4$. Advances in Mathematics of Communications, 2016, 10 (3) : 583-588. doi: 10.3934/amc.2016027 [3] Jorge P. Arpasi. On the non-Abelian group code capacity of memoryless channels. Advances in Mathematics of Communications, 2020, 14 (3) : 423-436. doi: 10.3934/amc.2020058 [4] Jayashree Dey, Ratna Dutta. Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting. Advances in Mathematics of Communications, 2022  doi: 10.3934/amc.2022077 [5] Stefano Barbero, Emanuele Bellini, Rusydi H. Makarim. Rotational analysis of ChaCha permutation. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021057 [6] María Chara, Ricardo A. Podestá, Ricardo Toledano. The conorm code of an AG-code. Advances in Mathematics of Communications, 2021  doi: 10.3934/amc.2021018 [7] Martino Borello, Francesca Dalla Volta, Gabriele Nebe. The automorphism group of a self-dual $[72,36,16]$ code does not contain $\mathcal S_3$, $\mathcal A_4$ or $D_8$. Advances in Mathematics of Communications, 2013, 7 (4) : 503-510. doi: 10.3934/amc.2013.7.503 [8] Shiping Cao, Anthony Coniglio, Xueyan Niu, Richard H. Rand, Robert S. Strichartz. The mathieu differential equation and generalizations to infinite fractafolds. Communications on Pure and Applied Analysis, 2020, 19 (3) : 1795-1845. doi: 10.3934/cpaa.2020073 [9] Washiela Fish, Jennifer D. Key, Eric Mwambene. Partial permutation decoding for simplex codes. Advances in Mathematics of Communications, 2012, 6 (4) : 505-516. doi: 10.3934/amc.2012.6.505 [10] Laura Luzzi, Ghaya Rekaya-Ben Othman, Jean-Claude Belfiore. Algebraic reduction for the Golden Code. Advances in Mathematics of Communications, 2012, 6 (1) : 1-26. doi: 10.3934/amc.2012.6.1 [11] Irene Márquez-Corbella, Edgar Martínez-Moro, Emilio Suárez-Canedo. On the ideal associated to a linear code. Advances in Mathematics of Communications, 2016, 10 (2) : 229-254. doi: 10.3934/amc.2016003 [12] Serhii Dyshko. On extendability of additive code isometries. Advances in Mathematics of Communications, 2016, 10 (1) : 45-52. doi: 10.3934/amc.2016.10.45 [13] Armando G. M. Neves. Upper and lower bounds on Mathieu characteristic numbers of integer orders. Communications on Pure and Applied Analysis, 2004, 3 (3) : 447-464. doi: 10.3934/cpaa.2004.3.447 [14] Nikolay Yankov. Self-dual [62, 31, 12] and [64, 32, 12] codes with an automorphism of order 7. Advances in Mathematics of Communications, 2014, 8 (1) : 73-81. doi: 10.3934/amc.2014.8.73 [15] Andrea Seidl, Stefan Wrzaczek. Opening the source code: The threat of forking. Journal of Dynamics and Games, 2022  doi: 10.3934/jdg.2022010 [16] Tuan Phung-Duc, Hiroyuki Masuyama, Shoji Kasahara, Yutaka Takahashi. M/M/3/3 and M/M/4/4 retrial queues. Journal of Industrial and Management Optimization, 2009, 5 (3) : 431-451. doi: 10.3934/jimo.2009.5.431 [17] Nian Li, Qiaoyu Hu. A conjecture on permutation trinomials over finite fields of characteristic two. Advances in Mathematics of Communications, 2019, 13 (3) : 505-512. doi: 10.3934/amc.2019031 [18] Ethel Mokotoff. Algorithms for bicriteria minimization in the permutation flow shop scheduling problem. Journal of Industrial and Management Optimization, 2011, 7 (1) : 253-282. doi: 10.3934/jimo.2011.7.253 [19] Ricardo P. Beausoleil, Rodolfo A. Montejo. A study with neighborhood searches to deal with multiobjective unconstrained permutation problems. Journal of Industrial and Management Optimization, 2009, 5 (2) : 193-216. doi: 10.3934/jimo.2009.5.193 [20] Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario. Cycle structure of permutation functions over finite fields and their applications. Advances in Mathematics of Communications, 2012, 6 (3) : 347-361. doi: 10.3934/amc.2012.6.347

2021 Impact Factor: 1.015