Related papers: On symmetric and Hermitian rank distance codes
In this paper, we consider the Reed-Muller (RM) codes. For the first order RM code, we prove that it is unique in the sense that any linear code with the same length, dimension and minimum distance must be the first order RM code; For the…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…
Additive codes over GF(9) that are self-dual with respect to the Hermitian trace inner product have a natural application in quantum information theory, where they correspond to ternary quantum error-correcting codes. However, these codes…
Over fields of characteristic unequal to $2$, we can identify symmetric matrices with homogeneous polynomials of degree $2$. This allows us to view symmetric rank-metric codes as living inside the space of such polynomials. In this paper,…
MDS codes have diverse practical applications in communication systems, data storage, and quantum codes due to their algebraic properties and optimal error-correcting capability. In this paper, we focus on a class of linear codes and…
We prove that if $n >k^2$ then a $k$-dimensional linear code of length $n$ over ${\mathbb F}_{q^2}$ has a truncation which is linearly equivalent to a Hermitian self-orthogonal linear code. In the contrary case we prove that truncations of…
A (q,k,t)-design matrix is an m x n matrix whose pattern of zeros/non-zeros satisfies the following design-like condition: each row has at most q non-zeros, each column has at least k non-zeros and the supports of every two columns…
An additive quaternary $[n,k,d]$-code (length $n,$ quaternary dimension $k,$ minimum distance $d$) is a $2k$-dimensional F_2-vector space of $n$-tuples with entries in $Z_2\times Z_2$ (the $2$-dimensional vector space over F_2) with minimum…
Two families of complementary codes over finite fields $\mathbb{F}_q$ are studied, where $q=r^2$ is square: i) Hermitian complementary dual linear codes, and ii) trace Hermitian complementary dual subfield linear codes. Necessary and…
We present a general construction of asymmetric quantum codes based on additive codes under the trace Hermitian inner product. Various families of additive codes over $\F_{4}$ are used in the construction of many asymmetric quantum codes…
We introduce a novel concept of rank for subsets of finite metric spaces E^n_q (the set of all n-dimensional vectors over an alphabet of size q) equipped with the Hamming distance, where the rank R(A) of a subset A is defined as the number…
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…
We determine the generic complete eigenstructures for $n \times n$ complex symmetric matrix polynomials of odd grade $d$ and rank at most $r$. More precisely, we show that the set of $n \times n$ complex symmetric matrix polynomials of odd…
A code of length $n$ is said to be (combinatorially) $(\rho,L)$-list decodable if the Hamming ball of radius $\rho n$ around any vector in the ambient space does not contain more than $L$ codewords. We study a recently introduced class of…
We present families of quantum error-correcting codes which are optimal in the sense that the minimum distance is maximal. These maximum distance separable (MDS) codes are defined over q-dimensional quantum systems, where q is an arbitrary…
Let $p$ be a prime such that $p \equiv 2$ or $3$ mod $5$. Linear block codes over the non-commutative matrix ring of $2 \times 2$ matrices over the prime field $GF(p)$ endowed with the Bachoc weight are derived as isometric images of linear…
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
We study the dual linear code of points and generators on a non-singular Hermitian variety $\mathcal{H}(2n+1,q^2)$. We improve the earlier results for $n=2$, we solve the minimum distance problem for general $n$, we classify the $n$…
Let $C$ be a $(n,q^{2k},n-k+1)_{q^2}$ additive MDS code which is linear over ${\mathbb F}_q$. We prove that if $n \geqslant q+k$ and $k+1$ of the projections of $C$ are linear over ${\mathbb F}_{q^2}$ then $C$ is linear over ${\mathbb…
In this paper, we mainly use classical Hermitian self-orthogonal generalized Reed-Solomon codes to construct two new classes of quantum MDS codes. Most of our quantum MDS codes have minimum distance larger than q/2+1. Compared with…