English
Related papers

Related papers: Self-Dual Skew Cyclic Codes over $\mathbb{F}_{q}+u…

200 papers

Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…

Combinatorics · Mathematics 2012-07-24 Lars Eirik Danielsen

Let $p$ be an odd prime number, $\mathbb{F}_{p^m}$ be a finite field of cardinality $p^m$ and $s$ a positive integer. Using some combinatorial identities, we obtain certain properties for Kronecker product of matrices over $\mathbb{F}_p$…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

In this paper, we study negacyclic codes of odd length and of length $2^k$ over the ring $R=\mathbb{Z}_4+u\mathbb{Z}_4$, $u^2=0$. We give the complete structure of negacyclic codes for both the cases. We have obtained a minimal spanning set…

Information Theory · Computer Science 2014-12-12 Rama Krishna Bandi , Maheshanand Bhaintwal

This paper investigates the algebraic structure of additive complementary pairs of cyclic codes over a finite commutative ring. We demonstrate that for every additive complementary pair of additive cyclic codes, both constituent codes are…

Information Theory · Computer Science 2025-06-13 Sanjit Bhowmick , Kuntal Deka , Alexandre Fotue Tabue , Edgar Martínez-Moro

We show that there are good long binary generalized quasi-cyclic self-dual (either Type I or Type II) codes.

Information Theory · Computer Science 2016-01-12 MinJia Shi , Yan Liu , Patrick Solé

In this article, we study skew constacyclic codes over a class of finite commutative semisimple rings. The automorphism group of $\mathcal{R}=\prod_{i=1}^t F_q$ is determined, and we characterize skew constacyclic codes over ring by linear…

Information Theory · Computer Science 2022-06-06 Ying Zhao

We give sufficient conditions for self-orthogonality with respect to symplectic, Euclidean and Hermitian inner products of a wide family of quasi-cyclic codes of index two. We provide lower bounds for the symplectic weight and the minimum…

Information Theory · Computer Science 2019-02-15 Carlos Galindo , Fernando Hernando , Ryutaroh Matsumoto

Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…

Information Theory · Computer Science 2022-01-05 Swati Bhardwaj , Madhu Raka

In this paper, we discuss DNA codes that are cyclic or quasi-cyclic over $\Z_{4}+\omega \Z_{4}$, where $\omega^{2}=2+2\omega$ along with methods to construct these with combinatorial constraints. We also generalize results obtained for the…

Information Theory · Computer Science 2021-10-20 Adel Alahmadi , Alaa Altassan , Amani Alyoubi , Manish K. Gupta , Hatoon Shoaib

This work studies skew polycyclic codes over finite chain rings defined by central trinomials. For this class of codes, we investigate Hamming equivalence in the non-commutative (skew) setting. We introduce an equivalence relation on the…

Information Theory · Computer Science 2026-05-06 Maryam Bajalan , Edgar Martínez-Moro , Hassan Ou-azzou

This paper gives new methods of constructing {\it symmetric self-dual codes} over a finite field $GF(q)$ where $q$ is a power of an odd prime. These methods are motivated by the well-known Pless symmetry codes and quadratic double circulant…

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

Let $R=\mathbb{Z}_4+u\mathbb{Z}_4,$ where $\mathbb{Z}_4$ denotes the ring of integers modulo $4$ and $u^2=0$. In the present paper, we introduce a new Gray map from $R^n$ to $\mathbb{Z}_{4}^{2n}.$ We study $(1+2u)$-constacyclic codes over…

Rings and Algebras · Mathematics 2015-04-15 Mohammad Ashraf , Ghulam Mohammad

Let $R$ be a finite commutative chain ring, $D_{2n}$ be the dihedral group of size $2n$ and $R[D_{2n}]$ be the dihedral group ring. In this paper, we completely characterize left ideals of $R[D_{2n}]$ (called left $D_{2n}$-codes) when ${\rm…

Information Theory · Computer Science 2021-05-18 H. Aghili , R. Sobhani

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$ and $s$ a positive integer. Using properties for Kronecker product of matrices and calculation for linear equations over $\mathbb{F}_{2^m}$, an efficient method for the…

Information Theory · Computer Science 2018-11-28 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Somphong Jitman

In this paper, we study the $\sigma$-self-orthogonality of constacyclic codes of length $p^s$ over the finite commutative chain ring $\mathbb F_{p^m} + u \mathbb F_{p^m}$, where $u^2=0$ and $\sigma$ is a ring automorphism of $\mathbb…

Information Theory · Computer Science 2018-07-26 Hongwei Liu , Jingge Liu

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

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

Information Theory · Computer Science 2026-01-21 Kanat Abdukhalikov , Askar S. Dzhumadil'daev , San Ling

Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…

Information Theory · Computer Science 2025-12-29 Leijo Jose , Lavanya G. , Anuradha Sharma

Let \(\cU\) be the multiplicative group of order~\(n\) in the splitting field \(\bbF_{q^m}\) of \(x^n-1\) over the finite field \(\bbF_q\). Any map of the form \(x\rightarrow cx^t\) with \(c\in \cU\) and \(t=q^i\), \(0\leq i<m\), is…

Information Theory · Computer Science 2022-02-17 Henk D. L. Hollmann

Long quasi-cyclic codes of any fixed index $>1$ have been shown to be asymptotically good, depending on Artin primitive root conjecture in (A. Alahmadi, C. G\"uneri, H. Shoaib, P. Sol\'e, 2017). We use this recent result to construct good…

Information Theory · Computer Science 2018-09-11 Minjia Shi , Rongsheng Wu , Patrick Sole
‹ Prev 1 4 5 6 7 8 10 Next ›