Classification of Extremal Double Circulant Formally Self-DualEven Codes
Designs, Codes and Cryptography
On the nonexsitence of extremal self-dual codes
Discrete Applied Mathematics
Near-Extremal Formally Self-Dual Even Codes of Lengths 24 and 32
Designs, Codes and Cryptography
Shadow bounds for self-dual codes
IEEE Transactions on Information Theory
The linear programming bound for binary linear codes
IEEE Transactions on Information Theory
On the classification and enumeration of self-dual codes
Finite Fields and Their Applications
The nonexistence of near-extremal formally self-dual codes
Designs, Codes and Cryptography
Constructing formally self-dual codes over Rk
Discrete Applied Mathematics
| Hi-index | 0.04 |
It is a well-known fact that if C is an [n,k,d] formally self-dual even code with n30, then d==48 with 8|n. In this paper, we prove that if n=72 and 8|n, then there is no near-extremal f.s.d. even code. This result comes from the negative coefficients of weight enumerators. In addition, we introduce shadow transform in near-extremal f.s.d. even codes. Using this we present some results about the nonexistence of near-extremal f.s.d. even codes with n=48,64.