Abstract
A code \({\mathcal {C}}\) is called formally self-dual if \({\mathcal {C}}\) and \({\mathcal {C}^{\perp}}\) have the same weight enumerators. There are four types of nontrivial divisible formally self-dual codes over \({\mathbb {F}_2,\,\mathbb {F}_3}\) , and \({\mathbb F_4}\) . These codes are called extremal if their minimum distances achieve the Mallows-Sloane bound. S. Zhang gave possible lengths for which extremal self-dual codes do not exist. In this paper, we define near-extremal formally self-dual (f.s.d.) codes. With Zhang’s systematic approach, we determine possible lengths for which the four types of near-extremal formally self-dual codes as well as the two types of near-extremal formally self-dual additive codes cannot exist. In particular, our result on the nonexistence of near-extremal binary f.s.d. even codes of any even length n completes all the cases since only the case 8|n was dealt with by Han and Lee.
Similar content being viewed by others
References
Assmus E.F. Jr., Key J.D.: Designs and Their Codes. Cambridge University Press, Cambridge (1992)
Conway J.H., Sloane N.J.A.: Sphere Packings, Lattices and Groups, 3rd edn. Springer, New York (1999)
Ebelin W.: Lattices and Codes. Friedrich Vieweg and Sohn Verlag (2002).
Grassl M.: Bounds on the minimum distance of linear codes. Online available at http://www.codetables.de. Accessed on 2008-02-06.
Han S., Kim J.-L.: Formally self-dual additive codes over \({\mathbb F_4}\) (preprint).
Han S., Lee J.B.: Nonexistence of near-extremal formally self-dual even codes of length divisible by 8. Discrete Appl. Math. 155, 1031–1037 (2007)
Höhn G.: Self-dual codes over the Kleinian four group. Math. Ann. 327, 227–255 (2003)
Huffman W.C.: On the classification and enumeration of self-dual codes. Finite Fields Appl. 11, 451–490 (2005)
Huffman W.C., Pless V.: Fundamentals of Error-correcting Codes. Cambridge University Press, Cambridge (2003)
Kennedy G.T., Pless V.: On designs and formally self-dual codes. Des. Codes Cryptogr. 4, 43–55 (1994)
Mallows C.L., Odlyzko A.M., Sloane N.J.A.: Upper bounds for modular forms, lattices, and codes. J. Algebra 36, 68–76 (1975)
Nebe G., Rains E.M., Sloane N.J.A.: Self-dual Codes and Invariant Theory. Springer, Berlin (2006)
Pless V., Pierce J.N.: Self-dual codes over GF(q) satisfy a modified Varshamov-Gilbert bound. Inform. Control. 23, 35–40 (1973)
Rains E.M.: Shadow bounds for self-dual codes. IEEE Trans. Inform. Theory 44, 134–139 (1998)
Rains E.M., Sloane N.J.A.: Self-dual codes. In: Pless, V.S., Huffman, W.C. (eds) Handbook of Coding Theory, Elsevier, Amsterdam (1998)
Sloane N.J.A.: Self-dual codes and lattices. Proc. Symp. Pure Math. 34, 273–308 (1979)
Zhang S.: On the nonexistence of extremal self-dual codes. Discrete Appl. Math. 91, 277–286 (1999)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J.D. Key.
Rights and permissions
About this article
Cite this article
Han, S., Kim, JL. The nonexistence of near-extremal formally self-dual codes. Des. Codes Cryptogr. 51, 69–77 (2009). https://doi.org/10.1007/s10623-008-9244-0
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-008-9244-0