English
Related papers

Related papers: Hermitian Self-Dual Cyclic Codes of Length $p^a$ o…

200 papers

For any positive integers $m$ and $k$, existing literature only determines the number of all Euclidean self-dual cyclic codes of length $2^k$ over the Galois ring ${\rm GR}(4,m)$, such as in [Des. Codes Cryptogr. (2012) 63:105--112]. Using…

Information Theory · Computer Science 2020-07-21 Yuan Cao , Yonglin Cao , San ling , Guidong Wang

Self-dual and complementary dual cyclic/abelian codes over finite fields form important classes of linear codes that have been extensively studied due to their rich algebraic structures and wide applications. In this paper, abelian codes…

Rings and Algebras · Mathematics 2019-01-03 Somphong Jitman , San Ling

Self-dual cyclic codes form an important class of linear codes. It has been shown that there exists a self-dual cyclic code of length $n$ over a finite field if and only if $n$ and the field characteristic are even. The enumeration of such…

Information Theory · Computer Science 2017-07-19 Supawadee Prugsapitak , Somphong Jitman

The main focus of this paper is the complete enumeration of self-dual abelian codes in non-principal ideal group algebras $\mathbb{F}_{2^k}[A\times \mathbb{Z}_2\times \mathbb{Z}_{2^s}]$ with respect to both the Euclidean and Hermitian inner…

Rings and Algebras · Mathematics 2016-09-27 Parinyawat Choosuwan , Somphong Jitman , Patanee Udomkavanich

This paper investigates the existence, enumeration and asymptotic performance of self-dual and LCD double circulant codes over Galois rings of characteristic $p^2$ and order $p^4$ with $p$ and odd prime. When $p \equiv 3 \pmod{4},$ we give…

Information Theory · Computer Science 2018-01-23 Minjia Shi , Daitao Huang , Lin Sok , Patrick Solé

Generalizing Euclidean inner product and Hermitian inner product, we introduce Galois inner products, and study the Galois self-dual constacyclic codes in a very general setting by a uniform method. The conditions for existence of Galois…

Information Theory · Computer Science 2015-12-24 Yun Fan , Liang Zgang

Skew polynomial rings over finite fields ([7] and [10]) and over Galois rings ([8]) have been used to study codes. In this paper, we extend this concept to finite chain rings. Properties of skew constacyclic codes generated by monic right…

Information Theory · Computer Science 2010-10-04 Somphong Jitman , San Ling , Patanee Udomkavanich

Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…

Information Theory · Computer Science 2023-06-27 Hao Chen

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

Information Theory · Computer Science 2016-03-14 Odessa D. Consorte , Lilibeth D. Valdez

Let $F$ be a field with cardinality $p^\ell$ and $0\neq \lambda\in F$, and $0\le h<\ell$. Extending Euclidean and Hermitian inner products, Fan and Zhang introduced Galois $p^h$-inner product (DCC, vol.84, pp.473-492). In this paper, we…

Information Theory · Computer Science 2024-11-28 Yun Fan , Yue Leng

In this paper, we construct MDS Euclidean self-dual codes which are extended cyclic duadic codes. And we obtain many new MDS Euclidean self-dual codes. We also construct MDS Hermitian self-dual codes from generalized Reed-Solomon codes and…

Information Theory · Computer Science 2016-06-24 Hongxi Tong , Xiaoqing Wang

In this paper, we give conditions for the existence of Hermitian self-dual $\Theta-$cyclic and $\Theta-$negacyclic codes over the finite chain ring $\mathbb{F}_q+u\mathbb{F}_q$. By defining a Gray map from $R=\mathbb{F}_q+u\mathbb{F}_q$ to…

Information Theory · Computer Science 2019-03-20 Zineb Hebbache , Kenza Guenda , N. Tugba Özzaim , Mehmet Özen , T. Aaron Gulliver

Codes over Galois rings have been studied extensively during the last three decades. Negacyclic codes over $GR(2^a,m)$ of length $2^s$ have been characterized: the ring $\mathcal{R}_2(a,m,-1)= \frac{GR(2^a,m)[x]}{\langle x^{2^s}+1\rangle}$…

Information Theory · Computer Science 2017-08-16 Hongwei Liu , Youcef Maouche

For prime $p$, $GR(p^a,m)$ represents the Galois ring of order $p^{am}$ and characterise $p$, where $a$ is any positive integer. In this article, we study the Type (1) $\lambda$-constacyclic codes of length $4p^s$ over the ring $GR(p^a,m)$,…

Information Theory · Computer Science 2023-01-18 Om Prakash , Habibul Islam , Ram Krishna Verma

For $\lambda$ an $n$-th power of a unit in a finite chain ring we prove that $\lambda$-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some…

Information Theory · Computer Science 2012-12-18 Aicha Batoul , Kenza Guenda , T. Aaron Gulliver

Let $D_{2n}=\langle x,y\mid x^n=1, y^2=1, yxy=x^{-1}\rangle$ be a dihedral group, and $R={\rm GR}(p^2,m)$ be a Galois ring of characteristic $p^2$ and cardinality $p^{2m}$ where $p$ is a prime. Left ideals of the group ring $R[D_{2n}]$ are…

Information Theory · Computer Science 2016-09-15 Yonglin Cao , Yuan Cao , Fang-Wei Fu

Let $\mathbb{F}_{2^m}$ be a finite field of cardinality $2^m$, $R=\mathbb{F}_{2^m}+u\mathbb{F}_{2^m}$ $(u^2=0)$ and $s,n$ be positive integers such that $n$ is odd. In this paper, we give an explicit representation for every self-dual…

Information Theory · Computer Science 2019-07-17 Yuan Cao , Yonglin Cao , Hai Q. Dinh , Fang-Wei Fu , Fanghui Ma

In this paper, we explore some properties of Galois hulls of cyclic serial codes over a chain ring and we devise an algorithm for computing all the possible parameters of the Euclidean hulls of that codes. We also establish the average…

Information Theory · Computer Science 2021-02-16 Sarra Talbi , Aicha Batoul , Alexandre Fotue Tabue , Edgar Martínez-Moro

Let $p$ be a prime integer, $n,s\geq 2$ be integers satisfying ${\rm gcd}(p,n)=1$, and denote $R=\mathbb{Z}_{p^s}[v]/\langle v^2-pv\rangle$. Then $R$ is a local non-principal ideal ring of $p^{2s}$ elements. First, the structure of any…

Information Theory · Computer Science 2017-10-27 Yuan Cao , Yonglin Cao

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
‹ Prev 1 2 3 10 Next ›