On designs and formally self-dual codes
Designs, Codes and Cryptography
The MAGMA algebra system I: the user language
Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the first MAGMA conference
Nonexistence of near-extremal formally self-dual even codes of length divisible by 8
Discrete Applied Mathematics
The nonexistence of near-extremal formally self-dual codes
Designs, Codes and Cryptography
Linear codes over $${\mathbb{F}_2+u\mathbb{F}_2+v\mathbb{F}_2+uv\mathbb{F}_2}$$
Designs, Codes and Cryptography
Formally self-dual additive codes over F4
Journal of Symbolic Computation
Binary formally self-dual odd codes
Designs, Codes and Cryptography
A note on formally self-dual even codes of length divisible by 8
Finite Fields and Their Applications
Codes over Rk, Gray maps and their binary images
Finite Fields and Their Applications
| Hi-index | 0.04 |
In this work, we study construction techniques of formally self-dual codes over the infinite family of rings R"k=F"2[u"1,u"2,...,u"k]/. These codes give rise to binary formally self-dual codes. Using these constructions, we obtain a number of good formally self-dual binary codes including even formally self-dual binary codes of parameters [72,36,14], [56,28,12], [44,22,10] and odd formally self-dual binary codes of parameters [72,36,13], all of which have better minimum distances than the best known self-dual codes of the same lengths.