English
Related papers

Related papers: On Codes over $\mathbb{F}_{q}+v\mathbb{F}_{q}+v^{2…

200 papers

Linear complementary dual (LCD) codes and linear complementary pairs (LCP) of codes have been proposed for new applications as countermeasures against side-channel attacks (SCA) and fault injection attacks (FIA) in the context of direct sum…

Information Theory · Computer Science 2023-11-03 Sanjit Bhowmick , Deepak Kumar Dalai , Sihem Mesnager

There is a one-to-one correspondence between $\ell$-quasi-cyclic codes over a finite field $\mathbb F_q$ and linear codes over a ring $R = \mathbb F_q[Y]/(Y^m-1)$. Using this correspondence, we prove that every $\ell$-quasi-cyclic self-dual…

Information Theory · Computer Science 2012-01-31 Sunghyu Han , Jon-Lark Kim , Heisook Lee , Yoonjin Lee

The aim of this paper is to give conditions for the equivalency between skew constacyclic codes, skew cyclic codes and skew negacyclic codes defined over semi-local rings. Also, we provide construction and an enumeration of Euclidean and…

Information Theory · Computer Science 2019-02-25 Ranya D. Boulanouar , Aicha Batoul

A linear code of length $n$ over a finite chain ring $R$ with residue field $\F_q$ is a $R$-submodule of $R^n$. A $R$-linear code is a code over $\F_q$ (not necessarily linear) which is the generalized Gray map image of a linear code over…

Information Theory · Computer Science 2025-12-03 Cristina Fernández-Córdoba , Sergi Sánchez-Aragón , Mercè Villanueva

It is reasonable to expect the theory of quantum codes to be simplified in the case of codes of minimum distance 2; thus, it makes sense to examine such codes in the hopes that techniques that prove effective there will generalize. With…

Quantum Physics · Physics 2007-05-23 Eric M. Rains

Self-orthogonal codes are of interest as they have important applications in quantum codes, lattices and many areas. In this paper, based on the weakly regular plateaued functions or plateaued Boolean functions, we construct a family of…

Information Theory · Computer Science 2024-11-08 Peng Wang , Ziling Heng

Generalized quasi-cyclic (GQC) codes form a natural generalization of quasi-cyclic (QC) codes. They are viewed here as mixed alphabet codes over a family of ring alphabets. Decomposing these rings into local rings by the Chinese Remainder…

Information Theory · Computer Science 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

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

In this paper, we study the complementary dual codes in more general setting (which are called Galois LCD codes) by a uniform method. A necessary and sufficient condition for linear codes to be Galois LCD codes is determined, and…

Information Theory · Computer Science 2017-05-03 Xiusheng Liu , Yun Fan , Hualu Liu

In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…

Information Theory · Computer Science 2025-01-29 Puyin Wang , Jinquan Luo

We establish a complete classification of binary group codes with complementary duals for a finite group and explicitly determine the number of linear complementary dual (LCD) cyclic group codes by using cyclotomic cosets. The dimension and…

Information Theory · Computer Science 2022-01-24 Ankan Shaw , Sanjit Bhowmick , Satya Bagchi

New $s$-extremal extremal unimodular lattices in dimensions $38$, $40$, $42$ and $44$ are constructed from self-dual codes over $\mathbb{F}_5$ by Construction A. In the process of constructing these codes, we obtain a self-dual $[44,22,14]$…

Information Theory · Computer Science 2022-08-09 Masaaki Harada

In this article, we introduce new scalar products over finite rings via additive isomorphisms. This allows us to define new notions of right (respectively left) orthogonal codes, that are not necessarily linear. This leads to definitions of…

Rings and Algebras · Mathematics 2024-11-18 Nabil Bennenni , André Leroy

From a given $[n, k]$ code $C$, we give a method for constructing many $[n, k]$ codes $C'$ such that the hull dimensions of $C$ and $C'$ are identical. This method can be applied to constructions of both self-dual codes and linear…

Information Theory · Computer Science 2021-08-31 Keita Ishizuka , Ken Saito

Some linear codes associated to maximal algebraic curves via Feng-Rao construction are investigated. In several case, these codes have better minimum distance with respect to the previously known linear codes with same length and dimension.

Algebraic Geometry · Mathematics 2009-06-17 Stefania Fanali

Linear complementary dual (LCD) codes introduced by Massey are the codes whose intersections with their dual codes are trivial. It can help to improve the security of the information processed by sensitive devices, especially against…

Information Theory · Computer Science 2020-12-29 Liangdong Lu , Ruihu Li , Qiang Fu , Chen Xuan , Wenping Ma

In this work, we investigate additive complementary dual (ACD) codes and their construction over finite fields $\mathbb{F}_{q^2}$ with respect to the trace inner products, where $q$ is a prime power. First, we associate an additive code…

Information Theory · Computer Science 2025-10-21 Gyanendra K. Verma , R. K. Sharma

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

Cyclic BCH codes and negacyclic BCH codes form important subclasses of cyclic codes and negacyclic codes, respectively, and can produce optimal linear codes in many cases. To the best of our knowledge, there are few results on the dual…

Information Theory · Computer Science 2024-01-29 Yuqing Fu , Hongwei Liu

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
‹ Prev 1 3 4 5 6 7 10 Next ›