English
Related papers

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

200 papers

In this paper we investigate repeated root cyclic and negacyclic codes of length $p^rm$ over $\mathbb{F}_{p^s}$ with $(m,p)=1$. In the case $p$ odd, we give necessary and sufficient conditions on the existence of negacyclic self-dual codes.…

Information Theory · Computer Science 2012-07-17 Kenza Guenda , T. Aaron Gulliver

Constacyclic codes over finite fields are an important class of linear codes as they contain distance-optimal codes and linear codes with best known parameters. They are interesting in theory and practice, as they have the constacyclic…

Information Theory · Computer Science 2024-04-30 Tingfang Chen , Zhonghua Sun , Conghui Xie , Hao Chen , Cunsheng Ding

A kind of self-dual quasi-abelian codes of index $2$ over any finite field $F$ is introduced. By counting the number of such codes and the number of the codes of this kind whose relative minimum weights are small, such codes are proved to…

Information Theory · Computer Science 2021-08-18 Liren Lin , Yun Fan

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 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

It is proved in a reference (Fan, Lin, IEEE TIT, vol.67, pp.5016-5025) that the self-dual (LCD respectively) dihedral codes over a finite field~$F$ with ${|F|=q}$ are asymptotically good if $q$ is even (odd respectively). In this paper, we…

Information Theory · Computer Science 2023-03-02 Yun Fan , Yue Leng

Double circulant codes of length $2n$ over the semilocal ring $R = \mathbb{F}_q + u\mathbb{F}_q,\, u^2=u,$ are studied when $q$ is an odd prime power, and $-1$ is a square in $\mathbb{F}_q.$ Double negacirculant codes of length $2n$ are…

Information Theory · Computer Science 2018-06-11 Minjia Shi , Hongwei Zhu , Liqin Qian , Lin Sok , Patrick Solé

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

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

In this paper, we investigate the existence of self-dual MRD codes $C\subset L^n$, where $L/F$ is an arbitrary field extension of degree $m\geq n$. We then apply our results to the case of finite fields, and prove that if $m=n$ and…

Information Theory · Computer Science 2024-01-31 Grégory Berhuy

We characterize the structure of 2-quasi-cyclic codes over a finite field F by the so-called Goursat Lemma. With the characterization, we exhibit a necessary and sufficient condition for a 2-quasi-cyclic code being a dihedral code. And we…

Information Theory · Computer Science 2022-01-06 Yun Fan , Yuchang Zhang

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

The study of MDS self-dual codes has attracted lots of attention in recent years. There are many papers on determining existence of $q-$ary MDS self-dual codes for various lengths. There are not existence of $q-$ary MDS self-dual codes of…

Information Theory · Computer Science 2016-09-16 Hongxi Tong , Xiaoqing Wang

In this paper, by investigating the factor of the $x^n+1$, we deduce that the structure of the reversible negacyclic code over the finite field $\mathbb{F}_{q}$, where $q$ is an odd prime power. Though studying $q-$cyclotomic cosets modulo…

Information Theory · Computer Science 2021-01-21 Shixin Zhu , Binbin Pang , Zhonghua Sun

In this paper, we study some repeated-root two-dimensional cyclic and constacyclic codes over a finite field $F=\mathbb{F}_q$. We obtain the generator matrices and generator polynomials of these codes and their duals. We also investigate…

Information Theory · Computer Science 2022-05-31 Marziyeh Beygi Khormaei , Ashkan Nikseresht , Shohreh Namazi

This is a manuscript of a chapter prepared for a book. The good codes possess large information length and large minimum distance. A class of codes is said to be asymptotically good if there exists a positive real $\delta$ such that, for…

Information Theory · Computer Science 2022-03-03 Yun Fan , Liren Lin

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

We construct MDS Euclidean and Hermitian self-dual codes over large finite fields of odd and even characteristics. Our codes arise from cyclic and negacyclic duadic codes.

Information Theory · Computer Science 2010-04-08 Kenza Guenda

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

Many kinds of codes which possess two cycle structures over two special finite commutative chain rings, such as ${\Bbb Z}_2{\Bbb Z}_4$-additive cyclic codes and quasi-cyclic codes of fractional index etc., were proved asymptotically good.…

Information Theory · Computer Science 2022-03-11 Yun Fan , Hualu Liu
‹ Prev 1 2 3 10 Next ›