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

New MDS or near MDS self-dual codes over finite fields

Hongxi Tong, Xiaoqing Wang

چکیده

The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of q−ary MDS self-dual codes for various lengths. There are not existence of q−ary MDS self-dual codes of some lengths, even these lengths < q. We generalize MDS Euclidean self-dual codes to near MDS Euclidean self-dual codes and near MDS isodual codes. And we obtain many new near MDS isodual codes from extended negacyclic duadic codes and we obtain many new MDS Euclidean self-dual codes from MDS Euclidean self-dual codes. We generalize MDS Hermitian self-dual codes to near MDS Hermitian self-dual codes. We obtain near MDS Hermitian self-dual codes from extended negacyclic duadic codes and from MDS Hermitian self-dual codes.

اسناد مشابه

  • Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields

    سند علمی۲۰۱۷Adv. in Math. of Comm.Ekkasit Sangwisut, Somphong Jitman, Patanee Udomkavanich

    Constacyclic and quasi-twisted Hermitian self-dual codes over finite fields are studied. An algorithm for factorizing xn − λ over Fq2 is given, where λ is a unit in Fq2 . Based on this factorization, the dimensions of the Hermitian hulls of λ-constacyclic codes of length n over F

  • On the classification of the extremal self-dual codes over small fields with 2-transitive automorphism groups

    سند علمی۲۰۱۴Des. Codes CryptographyAnton Malevich, Wolfgang Willems

    There are seven binary extremal self-dual doubly-even codes which are known to have a 2-transitive automorphism group. Using representation theoretical methods we show that there are no other such codes, except possibly n = 1 024. We also classify all extremal ternary self-dual a

  • 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

  • An improved upper bound on self-dual codes over finite fields GF(11), GF(19), and GF(23)

    مقاله‌ی دسترسی آزاد۲۰۲۱Designs, Codes and Cryptography['Whan-Hyuk Choi', 'Jon-Lark Kim', '']

    This paper gives new methods of constructing symmetric self-dual codes over a finite field GF(q) where q is power an odd prime. These are motivated by the well-known Pless symmetry and quadratic double circulant codes. Using these methods, we construct amount GF(11), GF(19), GF(2

  • 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