The build-up construction of quasi self-dual codes over a non-unital ring

نویسندگان

چکیده

There is a local ring [Formula: see text] of order without identity for the multiplication, defined by generators and relations as We study recursive construction self-orthogonal codes over classify, up to permutation equivalence, length size (called here quasi self-dual or QSD) text]. In particular, we classify Type IV (QSD with even weights)

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Construction of quasi-cyclic self-dual codes

There is a one-to-one correspondence between l-quasi-cyclic codes over a finite field Fq and linear codes over a ring R = Fq[Y ]/(Y m − 1). Using this correspondence, we prove that every l-quasi-cyclic self-dual code of length ml over a finite field Fq can be obtained by the building-up construction, provided that char (Fq) = 2 or q ≡ 1 (mod 4), m is a prime p, and q is a primitive element of F...

متن کامل

Construction of Self - Dual Codes over F

We present two kinds of construction methods for self-dual codes over F2 + uF2. Specially, the second construction (respectively, the first one) preserves the types of codes, that is, the constructed codes from Type II (respectively, Type IV) is also Type II (respectively, Type IV). Every Type II (respectively, Type IV) code over F2 + uF2 of free rank larger than three (respectively, one) can b...

متن کامل

Construction of MDS self-dual codes over Galois rings

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 holds. We construct MDS self-dual codes of lengths up to 8 over GR(3, 2), GR(3, 2) and GR(3, 2), and near-MDS self-du...

متن کامل

Construction and number of self-dual skew codes over F_p2

The aim of this text is to construct and to enumerate self-dual θ-cyclic and θ-negacyclic codes over IFp2 where p is a prime number and θ is the Frobenius automorphism.

متن کامل

Construction of Self-dual Codes over $F_p+vF_p$

In this paper, we determine all self-dual codes over Fp + vFp (v 2 = v) in terms of self-dual codes over the finite field Fp and give an explicit construction for self-dual codes over Fp + vFp, where p is a prime.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra and Its Applications

سال: 2021

ISSN: ['1793-6829', '0219-4988']

DOI: https://doi.org/10.1142/s0219498822501432