English
Related papers

Related papers: Euclidean and Hermitian LCD MDS codes

200 papers

Interest in the hulls of linear codes has been growing rapidly. More is known when the inner product is Euclidean than Hermitian. A shift to the latter is gaining traction. The focus is on a code whose Hermitian hull dimension and dual…

Information Theory · Computer Science 2025-12-22 Lin Sok , Martianus Frederic Ezerman , Ling San

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Information Theory · Computer Science 2024-10-24 Puyin Wang , Jinquan Luo

The hull of linear codes have promising utilization in coding theory and quantum coding theory. In this paper, we study the hull of generalized Reed-Solomon codes and extended generalized Reed-Solomon codes over finite fields with respect…

Information Theory · Computer Science 2018-07-13 Gaojun Luo , Xiwang Cao

In this paper, we prove existence of optimal complementary dual codes (LCD codes) over large finite fields. We also give methods to generate orthogonal matrices over finite fields and then apply them to construct LCD codes. Construction…

Information Theory · Computer Science 2017-04-14 Lin Sok , Minjia Shi , Patrick Solé

Systematic constructions of MDS self-dual codes is widely concerned. In this paper, we consider the constructions of MDS Euclidean self-dual codes from short length. Indeed, the exact constructions of MDS Euclidean self-dual codes from…

Information Theory · Computer Science 2019-10-24 Derong Xie , Xiaolei Fang , Jinquan Luo

The determination of the maximal length of maximum distance separable (MDS) codes arising from elliptic curves is a central problem in coding theory. For an elliptic curve $E$ over $\mathbb{F}_q$, let $\operatorname{MEC}(k,q)$ denote the…

Information Theory · Computer Science 2026-05-29 Haojie Chen , Chuangqiang Hu , Junjie Huang , Chang-An Zhao

Additive codes have attracted considerable attention for their potential to outperform linear codes. However, distinguishing strictly additive codes from those that are equivalent to linear codes remains a fundamental challenge. To resolve…

Information Theory · Computer Science 2026-03-17 Kanat Abdukhalikov , Duy Ho

LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality…

Information Theory · Computer Science 2019-11-25 Carlos Galindo , Olav Geil , Fernando Hernando , Diego Ruano

In this paper, we show that LCD codes are not equivalent to linear codes over small finite fields. The enumeration of binary optimal LCD codes is obtained. We also get the exact value of LD$(n,2)$ over $\mathbb{F}_3$ and $\mathbb{F}_4$. We…

Information Theory · Computer Science 2021-01-22 Binbin Pang , Shixin Zhu , Xiaoshan Kai

A new ensemble of structured codes is introduced. These codes are called Quasi Linear Codes (QLC). The QLC's are constructed by taking subsets of linear codes. They have a looser structure compared to linear codes and are not closed under…

Information Theory · Computer Science 2016-02-16 F. Shirani , M. Heidari , S. S. Pradhan

Let $\mathtt{R}$ be a finite commutative chain ring with the maximal ideal $\gamma\mathtt{R}$ of nilpotency index $e\geq 2,$ and let $\check{\mathtt{R}}=\mathtt{R}/\gamma^{s}\mathtt{R}$ for some positive integer $ s< e.$ In this paper, we…

Information Theory · Computer Science 2024-12-16 Leijo Jose , Anuradha Sharma

In this paper, we describe a procedure for constructing $q$--ary $[N,3,N-2]$--MDS codes, of length $N\leq q+1$ (for $q$ odd) or $N\leq q+2$ (for $q$ even), using a set of non--degenerate Hermitian forms in $PG(2,q^2)$.

Information Theory · Computer Science 2009-07-19 A. Aguglia , L. Giuzzi

This work explores LCD and self-dual codes over a noncommutative non-unital ring $ E_p= \langle r,s ~|~ pr =ps=0,~ r^2=r,~ s^2=s,~ rs=r,~ sr=s \rangle$ of order $p^2$ where $p$ is a prime. Initially, we study the monomial equivalence of two…

Information Theory · Computer Science 2025-01-23 Anup Kushwaha , Indibar Debnath , Om Prakash

MDS self-dual codes have good algebraic structure, and their parameters are completely determined by the code length. In recent years, the construction of MDS Euclidean self-dual codes with new lengths has become an important issue in…

Information Theory · Computer Science 2025-04-03 Weirong Meng , Weijun Fang , Fang-Wei Fu , Haiyan Zhou , Ziyi Gu

Quantum maximum-distance-separable (MDS) codes are an important class of quantum codes. In this paper, using constacyclic codes and Hermitain construction, we construct some new quantum MDS codes of the form $q=2am+t$,…

Information Theory · Computer Science 2018-03-22 Liangdong Lu , Wenping Ma , Ruihu Li , Yuena Ma , Luobin Guo

We investigate a natural subfamily of twisted linearized Reed--Solomon (TLRS) codes in the sum-rank metric, where the twist is applied only to the constant term. We establish a simple necessary and sufficient condition for these codes to be…

Information Theory · Computer Science 2026-04-29 Sanjit Bhowmick , Kuntal Deka , Edgar Martínez-Moro

Let $\cal M$ denote the set ${\cal S}_{n, q}$ of $n \times n$ symmetric matrices with entries in ${\rm GF}(q)$ or the set ${\cal H}_{n, q^2}$ of $n \times n$ Hermitian matrices whose elements are in ${\rm GF}(q^2)$. Then $\cal M$ equipped…

Combinatorics · Mathematics 2020-11-16 Antonio Cossidente , Giuseppe Marino , Francesco Pavese

The Galois hull of a linear code is the intersection of itself and its Galois dual code, which has aroused the interest of researchers in these years. In this paper, we study Galois hulls of linear codes. Firstly, the symmetry of the…

Information Theory · Computer Science 2023-01-12 Yang Li , Shixin Zhu

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…

Information Theory · Computer Science 2022-07-05 Keita Ishizuka

This paper studies the theory of linear analog error correction coding. Since classical concepts of minimum Hamming distance and minimum Euclidean distance fail in the analog context, a new metric, termed the "minimum (squared Euclidean)…

Information Theory · Computer Science 2011-05-10 Kai Xie , Jing , Li
‹ Prev 1 4 5 6 7 8 10 Next ›