中文
相关论文

相关论文: Galois LCD Codes over Finite Fields

200 篇论文

The Euclidean hull of a linear code $C$ is defined as $C\cap C^{\perp}$, where $C^\perp$ denotes the dual of $C$ under the Euclidean inner product. A linear code with zero hull dimension is called a linear complementary dual (LCD) code. A…

信息论 · 计算机科学 2023-04-25 Zohreh Aliabadi , Tekgül Kalaycı

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…

信息论 · 计算机科学 2014-06-10 Bocong Chen , Hai Q. Dinh , Hongwei Liu

Bicyclic codes are a generalization of the one dimensional (1D) cyclic codes to two dimensions (2D). Similar to the 1D case, in some cases, 2D cyclic codes can also be constructed to guarantee a specified minimum distance. Many aspects of…

量子物理 · 物理学 2024-04-08 Sankara Sai Chaithanya Rayudu , Pradeep Kiran Sarvepalli

Linear finite dynamical systems play an important role, for example, in coding theory and simulations. Methods for analyzing such systems are often restricted to cases in which the system is defined over a field %and usually strive to…

动力系统 · 数学 2026-04-03 Jonas Kantic , Claudio Qureshi , Daniel Panario , Fabian Legl

We construct two series of linear codes over finite ring $\mathbb{F}_{q}[x]/(x^2)$ and Galois ring $GR(p^2,m)$ respectively reaching the Griesmer bound. They derive two series of codes over finite field $\mathbb{F}_{q}$ by Gray map. The…

信息论 · 计算机科学 2016-12-06 Jin Li , Aixian Zhang , Keqin Feng

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…

信息论 · 计算机科学 2017-02-02 Cem Güneri , Ferruh Özbudak , Buket Özkaya , Elif Saçıkara , Zahra Sepasdar , Patrick Solé

The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…

信息论 · 计算机科学 2012-10-09 Yun Fan , Guanghui Zhang

A characterization of a class of optimal three-weight cyclic codes of dimension 3 over any finite field was recently presented in [10]. Shortly after this, a generalization for the sufficient numerical conditions of such characterization…

信息论 · 计算机科学 2016-09-26 Gerardo Vega

Motivated by a problem in computer architecture we introduce a notion of the perfect distance-dominating set, PDDS, in a graph. PDDSs constitute a generalization of perfect Lee codes, diameter perfect codes, as well as other codes and…

离散数学 · 计算机科学 2013-08-06 Carlos Araujo , Italo J. Dejter , Peter Horak

We introduce a general construction of many Hermitian LCD $[n, k]$ codes from a given Hermitian LCD $[n, k]$ code. Furthermore, we present some results on punctured codes and shortened codes of quaternary Hermitian LCD codes. As an…

信息论 · 计算机科学 2022-07-05 Keita Ishizuka

In this paper, we introduce a general construction of linear codes with small dimension hull from any non LCD codes. Furthermore, we show that for any linear code $\Co$ over $\F_q$ ($q > 3$) with $dim(Hull(\Co))=h$ there exist an equivalent…

信息论 · 计算机科学 2023-06-02 Maouche Youcef

Quantum maximal-distance-separable (MDS) codes form an important class of quantum codes. It is very hard to construct quantum MDS codes with relatively large minimum distance. In this paper, based on classical constacyclic codes, we…

信息论 · 计算机科学 2014-05-22 Liqi Wang , Shixin Zhu

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…

信息论 · 计算机科学 2022-05-31 Marziyeh Beygi Khormaei , Ashkan Nikseresht , Shohreh Namazi

Let $q=p^h$ be a prime power and $e$ be an integer with $0\leq e\leq h-1$. $e$-Galois self-orthogonal codes are generalizations of Euclidean self-orthogonal codes ($e=0$) and Hermitian self-orthogonal codes ($e=\frac{h}{2}$ and $h$ is…

信息论 · 计算机科学 2023-02-10 Yang Li , Yunfei Su , Shixin Zhu , Shitao Li , Minjia Shi

In this paper, we extend a necessary and sufficient condition for a linear code over a Galois ring to be minimal and establish new bounds on the length of an $m$-dimensional minimal linear code. Building upon this structural…

信息论 · 计算机科学 2026-03-30 Biplab Chatterjee , Sihem Mesnager , Ratnesh Kumar Mishra , Makhan Maji , Kalyan Hansda

Linear complementary dual (LCD) cyclic codes were referred historically to as reversible cyclic codes, which had applications in data storage. Due to a newly discovered application in cryptography, there has been renewed interest in LCD…

信息论 · 计算机科学 2017-09-12 Claude Carlet , Sihem Mesnager , Chunming Tang , Yanfeng Qi

We present a Galois theory of parameterized linear differential equations where the Galois groups are linear differential algebraic groups, that is, groups of matrices whose entries are functions of the parameters and satisfy a set of…

经典分析与常微分方程 · 数学 2007-05-23 Phyllis J. Cassidy , Michael F. Singer

In this paper we characterize the algebraic structure of two-dimensional $(\alpha,\beta )$-constacyclic codes of arbitrary length $s.\ell$ and of their duals. For $\alpha,\beta \in \{1,-1\}$, we give necessary and sufficient conditions for…

信息论 · 计算机科学 2020-07-30 Swati Bhardwaj , Madhu Raka

Twisted generalized Reed-Solomon (TGRS) codes, as a flexible extension of classical generalized Reed-Solomon (GRS) codes, have attracted significant attention in recent years. In this paper, we construct two classes of LCD codes from the…

信息论 · 计算机科学 2026-01-26 Ziwei Zhao , Xiaoni DU , Xingbin Qiao

Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…

表示论 · 数学 2020-10-27 Vyacheslav Babych , Nataliya Golovashchuk