Abstract
We develop a construction method of isodual codes over GF(q), where q is a prime power; we construct isodual codes over GF(q) of length 2n+2 from isodual codes over GF(q) of length 2n. Using this method, we find some isodual codes over GF(q), where q=2,3 and 5. In more detail, we obtain binary isodual codes of lengths 32, 34, 36, 38, and 40, where all these codes of lengths 32, 34, and 36 are optimal and some codes of length 38 are optimal. We note that all these binary isodual codes are not self-dual codes, and in particular, in the case of length 38 all their weight enumerators are different from those of binary self-dual codes of the same length; in fact, four binary isodual codes of length 38 are formally self-dual even codes. We construct isodual codes over GF(3) and GF(5) of lengths 4, 6, and 8 as well.
| Original language | English |
|---|---|
| Pages (from-to) | 372-385 |
| Number of pages | 14 |
| Journal | Finite Fields and their Applications |
| Volume | 45 |
| DOIs | |
| State | Published - 1 May 2017 |
Bibliographical note
Funding Information:The first named author was supported by the National Research Foundation of Korea (NRF) grant founded by the Korea government (NRF-2013R1A1A2063240), and the second named author was 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 founded by the Korea government (MEST) (2014-002731).
Publisher Copyright:
© 2017 Elsevier Inc.
Keywords
- Equivalence
- Formally self-dual code
- Isodual code
- Self-dual code