On linear codes admitting large automorphism groups |
| |
| Authors: | Nicola Pace Angelo Sonnino |
| |
| Institution: | 1.School of Mathematical Sciences,Dublin Institute of Technology,Dublin 8,Ireland;2.Dipartimento di Matematica, Informatica ed Economia,Università degli Studi della Basilicata,Potenza,Italy |
| |
| Abstract: | Linear codes with large automorphism groups are constructed. Most of them are suitable for permutation decoding. In some cases they are also optimal. For instance, we construct an optimal binary code of length \(n=252\) and dimension \(k=12\) having minimum distance \(d=120\) and automorphism group isomorphic to \(\text {PSL}(2,8)\rtimes \text {C}_{3}\). |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
