Constacyclic and Linear Complementary Dual Codes Over Fq + uFq
نویسندگان
چکیده
منابع مشابه
Construction of skew cyclic and skew constacyclic codes over Fq+uFq+vFq
In this paper, skew cyclic and skew constacyclic codes over finite non-chain ring R = F_q+uF_q+vF_q, where q= p^m, p is an odd prime and u^{2}=u, v^{2}=v, uv=vu=0 are studied. We show that Gray image of a skew cyclic code of length n over R is a skew quasi-cyclic code of length 3n over F_q of index 3. Structural properties of skew cyclic and skew constacyclic over R are obtained. Further, gener...
متن کاملSkew cyclic codes and skew(<alpha>1+u<alpha>2+v<alpha>3+uv<alpha>4)-constacyclic codes over Fq + uFq + vFq + uvFq
In this paper, we study skew cyclic and skew constacyclic codes over the ring R = Fq + uFq + vFq + uvFq where q = p^m; p is an odd prime, u^2 = u; v^2 = v; uv = vu. We show that Gray image of a skew cyclic code of length n is a skew quasi-cyclic code of length 4n over Fq of index 4. We also study the structural properties of skew cyclic and skew constacyclic codes over R. Further, generating po...
متن کاملFq-Linear Cyclic Codes over Fq: DFT Characterization
Codes over Fqm that form vector spaces over Fq are called Fq-linear codes over Fqm . Among these we consider only cyclic codes and call them Fq-linear cyclic codes (FqLC codes) over Fqm . This class of codes includes as special cases (i) group cyclic codes over elementary abelian groups (q = p, a prime), (ii) subspace subcodes of Reed-Solomon codes and (iii) linear cyclic codes over Fq (m=1). T...
متن کاملExtendability of linear codes over Fq
For an [n, k, d]q code C, we define a mapping wC from PG(k − 1, q) to the set of weights of C via a generator matrix of C. We give a geometric aspect derived from wC to investigate the extendability of linear codes. We survey known extension theorems and some recent results.
متن کاملBinary linear complementary dual codes
Linear complementary dual codes (or codes with complementary duals) are codes whose intersections with their dual codes are trivial. We study binary linear complementary dual [n, k] codes with the largest minimum weight among all binary linear complementary dual [n, k] codes. We characterize binary linear complementary dual codes with the largest minimum weight for small dimensions. A complete ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Defence Science Journal
سال: 2020
ISSN: 0976-464X,0011-748X
DOI: 10.14429/dsj.70.15691