相关论文: On symmetric and Hermitian rank distance codes
We construct new stabilizer quantum error-correcting codes from generalized monomial-Cartesian codes. Our construction uses an explicitly defined twist vector, and we present formulas for the minimum distance and dimension. Generalized…
We revisit and extend the connections between $\mathbb{F}_{q^m}$-linear rank-metric codes and evasive $\mathbb{F}_q$-subspaces of $\mathbb{F}_{q^m}^k$. We give a unifying framework in which we prove in an elementary way how the parameters…
New families of maximum distance separable (MDS) codes are constructed from elliptic curves by exploiting their group structures. In contrast to classical constructions based on divisors supported at a single rational point, the proposed…
First we give an overview of the known supplementary difference sets (SDS) (A_i), i=1..4, with parameters (n;k_i;d), where k_i=|A_i| and each A_i is either symmetric or skew and k_1 + ... + k_4 = n + d. Five new Williamson matrices over the…
This paper investigates the decoding of certain Gabidulin codes that were transmitted over a channel with space-symmetric errors. Space-symmetric errors are additive error matrices that have the property that their column and row spaces are…
Non-Hermitian matrices $H\in M_2(\mathbb{C})$ satisfying the relation $ H^{\dag}G = GH $, for invertible and singular Hermitian matrices $G$ have been studied. The matrices $H$ corresponding to invertible $G$ are known in the literature as…
The exploration of linear subspaces, particularly scattered subspaces, has garnered considerable attention across diverse mathematical disciplines in recent years, notably within finite geometries and coding theory. Scattered subspaces play…
We study the functional code $C_d(\mathcal{X})$, introduced by G. Lachaud in 1996, in the case where $\mathcal{X}$ is a rank $n$ degenerate Hermitian variety $P\mathcal{U}_{n-1}$ in $\mathbb{P}^n(\mathbb{F}_{q^2})$ and $d\leq q$. We…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
The Ulam distance of two permutations on $[n]$ is $n$ minus the length of their longest common subsequence. In this paper, we show that for every $\varepsilon>0$, there exists some $\alpha>0$, and an infinite set $\Gamma\subseteq…
Both maximum distance separable (MDS) codes that are not equivalent to generalized Reed-Solomon (GRS) codes (non-GRS MDS codes) and near MDS (NMDS) codes have nice applications in communication and storage systems. In this paper, we…
We describe a new parameterized family of symmetric error-correcting codes with low-density parity-check matrices (LDPC). Our codes can be described in two seemingly different ways. First, in relation to Reed-Muller codes: our codes are…
We provide an algebraic description for sum-rank metric codes, as quotient space of a skew polynomial ring. This approach generalizes at the same time the skew group algebra setting for rank-metric codes and the polynomial setting for codes…
Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…
The Etzion-Silberstein conjecture asserts that, for any finite field $\mathbb F$, Ferrers diagram $\mathcal D$, and integer $d$, there exists a linear matrix code supported on $\mathcal D$ with minimum rank distance $d$ that attains a…
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…
Extending recent work on the Euclidean hull, we derive closed-form ratio decompositions for the number of linear codes with prescribed Hermitian and symplectic hull dimension. The Hermitian ratio admits a uniform lower bound of at least…
Linear complementary dual (LCD) maximum distance separable (MDS) codes are constructed to given specifications. For given $n$ and $r<n$, with $n$ or $r$ (or both) odd, MDS LCD $(n,r)$ codes are constructed over finite fields whose…
Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…
The intersection ${\bf C}\bigcap {\bf C}^{\perp_H}$ of a linear code ${\bf C} \subset {\bf F}_{q^2}$ and its Hermitian dual ${\bf C}^{\perp_H}$ is called the Hermitian hull of this code. A linear code ${\bf C} \subset {\bf F}_{q^2}$…