ویراساینس.
سند علمی

Extension theorems for self-dual codes over rings and new binary self-dual codes

Abidin Kaya, Bahattin Yildiz

چکیده

In this work, extension theorems are generalized to self-dual codes over rings and as applications many new binary self-dual extremal codes are found from self-dual codes over F2m + uF2m for m = 1, 2. The duality and distance preserving Gray maps from F4 + uF4 to (F2 + uF2) and F42 are used to obtain self-dual codes whose binary Gray images are [64, 32, 12]-extremal self-dual. An F2 + uF2-extension is used and as binary images, 178 extremal binary self-dual codes of length 68 with new weight enumerators are obtained. Especially the first examples of codes with γ = 3 and many codes with the rare γ = 4, 6 parameters are obtained. In addition to these, two hundred fifty doubly even self dual [96, 48, 16]-codes with new weight enumerators are obtained from four-circulant codes over F4 + uF4. New extremal doubly even binary codes of lengths 80 and 88 are also found by the F2+uF2-lifts of binary four circulant codes and a corresponding result about 3-designs is stated.

اسناد مشابه

  • Constructions of self-dual codes over finite commutative chain rings

    سند علمی۲۰۱۰IJICoTSteven T. Dougherty, Jon-Lark Kim, Hongwei Liu

    We study self-dual codes over chain rings. We describe a technique for constructing new self-dual codes from existing codes and we prove that for chain rings containing an element c with c = −1 all self-dual codes can be constructed by this technique. We extend this construction

  • Construction of MDS self-dual codes over Galois rings

    سند علمی۲۰۰۷Des. Codes CryptographyJon-Lark Kim, Yoonjin Lee

    The purpose of this paper is to construct nontrivial MDS self-dual codes over Galois rings. We consider a building-up construction of self-dual codes over Galois rings as a GF(q)-analogue of [20]. We give a necessary and sufficient condition on which the building-up construction

  • An Algorithm for Finding Self-Orthogonal and Self-Dual Codes Over Gaussian and Eisenstein Integer Residue Rings Via Chinese Remainder Theorem

    مقاله‌ی دسترسی آزاد۲۰۲۳IEEE Access['Hajime Matsui', '']

    A code over Gaussian or Eisenstein integer residue ring is an additive group of vectors with entries in this which closed under the action constant multiplication by integers. In paper, we define dual codes for and rings, consider construction self-dual codes. Because, uniqueness

  • Self-dual codes over commutative Frobenius rings

    سند علمی۲۰۱۰Finite Fields and Their ApplicationsSteven T. Dougherty, Jon-Lark Kim, Hamid Kulosman, Hongwei Liu

    We prove that self-dual codes exist over all finite commutative Frobenius rings, via their decomposition by the Chinese Remainder Theorem into local rings. We construct non-free self-dual codes under some conditions, using self-dual codes over finite fields, and we also construct

  • Type II Self-Dual Codes over Finite Rings and Even Unimodular Lattices

    سند علمی۱۹۹۹STEVEN T. DOUGHERTY, MASAAKI HARADA

    In this paper, we investigate self-dual codes over finite rings, specifically the ring Z2m of integers modulo 2m . Type II codes over Z2m are introduced as self-dual codes with Euclidean weights which are a multiple of 2m+1. We describe a relationship between Type II codes and ev

  • Double and bordered α-circulant self-dual codes over finite commutative chain rings

    سند علمی۲۰۰۸MICHAEL KIERMAIER, ALFRED WASSERMANN

    MICHAEL KIERMAIER, ALFRED WASSERMANN michael.kiermaier, alfred.wassermann@uni-bayreuth.de Mathematical Department, University of Bayreuth, D-95440 Bayreuth, GERMANY Abstract. In this paper we investigate codes over finite commutative rings R, whose generator matrices are built fr