Abstract
We present a method of constructing free self-dual codes over Z8 and Z16 which are extremal or optimal with respect to the Hamming weight. We first prove that every (extremal or optimal) free self-dual code over Z2m can be found from a binary (extremal or optimal) Type II code for any positive integer m≥ 2. We find explicit algorithms for construction of self-dual codes over Z8 and Z16. Our construction method is basically a lifting method. Furthermore, we find an upper bound of minimum Hamming weights of free self-dual codes over Z2m. By using our explicit algorithms, we construct extremal free self-dual codes over Z8 and Z16 up to lengths 40.
Original language | English |
---|---|
Pages (from-to) | 239-257 |
Number of pages | 19 |
Journal | Designs, Codes, and Cryptography |
Volume | 81 |
Issue number | 2 |
DOIs | |
State | Published - 1 Nov 2016 |
Bibliographical note
Funding Information:Due to the referee’s helpful comments, we added Lemma and Theorem . We express our gratitude to the referee. Yoonjin Lee is supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2009-0093827) and also by the National Research Foundation of Korea (NRF) Grant funded by the Korea government (MEST) (2014-002731).
Publisher Copyright:
© 2015, Springer Science+Business Media New York.
Keywords
- Code over a ring
- Extremal self-dual code
- Free self-dual code
- Optimal self-dual code
- Self-dual code