English
Related papers

Related papers: Self-dual 2-quasi Negacyclic Codes over Finite Fie…

200 papers

We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two…

Information Theory · Computer Science 2010-02-15 Kenza Guenda

Quasi-twisted (QT) codes are a generalization of quasi-cyclic (QC) codes. Based on consta-cyclic simplex codes, a new explicit construction of a family of 2-generator quasi-twisted (QT) two-weight codes is presented. It is also shown that…

Information Theory · Computer Science 2008-06-02 Eric Z. Chen

Let $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $R=\mathbb{F}_{p^m}[u]/\langle u^2\rangle=\mathbb{F}_{p^m}+u\mathbb{F}_{p^m}$ $(u^2=0)$, where $p$ is a prime and $m$ is a positive integer. For any $\lambda\in…

Information Theory · Computer Science 2017-10-25 Yonglin Cao , Yuan Cao , Jian Gao , Fang-wei Fu

The dual of the Kasami code of length $q^2-1$, with $q$ a power of $2$, is constructed by concatenating a cyclic MDS code of length $q+1$ over $F_q$ with a Simplex code of length $q-1$. This yields a new derivation of the weight…

Information Theory · Computer Science 2023-06-28 Minjia Shi , Denis Krotov , Patrick Solé

We introduce a consistent and efficient method to construct self-dual codes over $GF(q)$ with symmetric generator matrices from a self-dual code over $GF(q)$ of smaller length where $q \equiv 1 \pmod 4$. Using this method, we improve the…

Information Theory · Computer Science 2021-02-22 Whan-Hyuk Choi , Jon-Lark Kim

LCD codes are linear codes that intersect with their dual trivially. Quasi cyclic codes that are LCD are characterized and studied by using their concatenated structure. Some asymptotic results are derived. Hermitian LCD codes are…

Information Theory · Computer Science 2016-08-08 Cem Güneri , Buket Özkaya , Patrick Solé

In this paper, we give an important isomorphism between contacyclic codes and cyclic codes over finite principal ideal rings. Necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite principal…

Information Theory · Computer Science 2015-05-06 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

For any different odd primes $\ell$ and $p$, structure of constacyclic codes of length $2\ell^mp^n$ over a finite field $\mathbb F_q$ of characteritic $p$ and their duals is established in term of their generator polynomials. Among other…

Information Theory · Computer Science 2014-06-10 Bocong Chen , Hai Q. Dinh , Hongwei Liu

In this paper we investigate linear codes with complementary dual (LCD) codes and formally self-dual codes over the ring $R=\F_{q}+v\F_{q}+v^{2}\F_{q}$, where $v^{3}=v$, for $q$ odd. We give conditions on the existence of LCD codes and…

Information Theory · Computer Science 2017-04-13 A. Melakhessou , K. Guenda , T. A. Gulliver , M. Shi , P. Solé

We study the maximum length of $q$-ary codes as a function of alphabet size, code size, and Singleton defect. For an $(n, M, d)_q$ code with dimension $\kappa = \log_q M \ge 2$ and Singleton defect $s = n - \lceil\kappa\rceil + 1 - d$, we…

Combinatorics · Mathematics 2026-04-07 Tim Alderson

We study the asymptotic behavior of double and four circulant codes, which are quasi-cyclic codes of index two and four respectively. Exact enumeration results are derived for these families of codes with the prescribed hull dimension.…

Information Theory · Computer Science 2025-08-14 Zohreh Aliabadi , Tekgül Kalaycı

Let $p\neq3$ be any prime and $l\neq3$ be any odd prime with $gcd(p,l)=1$. $F_{q}^{*}=\langle\xi\rangle$ is decomposed into mutually disjoint union of $gcd(q-1,3lp^{s})$ coset over the subgroup $\langle\xi^{3lp^{s}}\rangle$, where $\xi$ is…

Information Theory · Computer Science 2016-01-25 Li Liu , Lanqiang Li , Xiaoshan Kai , Shixin Zhu

Linear codes with complementary duals (LCD) have a great deal of significance amongst linear codes. Maximum distance separable (MDS) codes are also an important class of linear codes since they achieve the greatest error correcting and…

Information Theory · Computer Science 2019-09-17 Mehmet E. Koroglu , Mustafa Sarı

Let A(q,n,d) denote the maximum size of a q-ary code of length n and distance d. We study the minimum asymptotic redundancy \rho(q,n,d)=n-log_q A(q,n,d) as n grows while q and d are fixed. For any d and q<=d-1, long algebraic codes are…

Information Theory · Computer Science 2007-07-13 Sergey Yekhanin , Ilya Dumer

This paper explores extremal self-dual double circulant (DC) codes and linear complementary dual (LCD) codes of arbitrary length over the Galois field $\mathbb F_2$. We establish the sufficient and necessary conditions for DC codes and…

Information Theory · Computer Science 2025-02-21 Wenyu Han , Tongjiang Yan , Ming Yan

Let $q$ be a power of a prime $p$. In this paper, we study reversible cyclic codes of arbitrary length over the ring $ R = \mathbb{F}_q + u \mathbb{F}_q$, where $u^2=0 mod q$. First, we find a unique set of generators for cyclic codes over…

Information Theory · Computer Science 2019-10-16 Om Prakash , Shikha Patel , Shikha Yadav

We consider codes over the two semi-local non-unital rings of order six, \[ H_{23} = \langle a,b \mid 2a=0, 3b = 0, a^2=a, b^2 = 0, ab = 0 = ba \rangle,\] and \[H_{32} = \langle a,b \mid 2a=0, 3b = 0, a^2=0, b^2 = b, ab = 0 = ba \rangle. \]…

Rings and Algebras · Mathematics 2025-08-25 Altaf Alshuhail

Subspace codes, and in particular cyclic subspace codes, have gained significant attention in recent years due to their applications in error correction for random network coding. In this paper, we introduce a new technique for constructing…

Information Theory · Computer Science 2025-07-15 Chiara Castello , Paolo Santonastaso

In this paper, we study the structure of cyclic, quasi-cyclic, constacyclic codes and their skew codes over the finite ring R=Z_3+vZ_3+v^2Z_3, v^3=v. The Gray images of cyclic, quasi-cyclic, skew cyclic, skew quasi-cyclic and skew…

Information Theory · Computer Science 2018-11-09 Abdullah Dertli , Yasein Cengellenmis , Senol Eren

A classical result of Conway and Pless is that a natural projection of the fixed code of an automorphism of odd prime order of a self-dual binary linear code is self-dual. In this paper we prove that the same holds for involutions under…

Combinatorics · Mathematics 2014-11-25 Martino Borello , Gabriele Nebe
‹ Prev 1 3 4 5 6 7 10 Next ›