English
Related papers

Related papers: On maximum additive Hermitian rank-metric codes

200 papers

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

Let $X=X(n,q)$ be the set of $n\times n$ Hermitian matrices over $\mathbb{F}_{q^2}$. It is well known that $X$ gives rise to a metric translation association scheme whose classes are induced by the rank metric. We study $d$-codes in this…

Combinatorics · Mathematics 2017-08-18 Kai-Uwe Schmidt

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

Combinatorics · Mathematics 2020-05-13 G. Longobardi , G. Lunardon , R. Trombetti , Y. Zhou

Let $\mathscr{S}_n(q)$ denote the set of symmetric bilinear forms over an $n$-dimensional $\mathbb{F}_q$-vector space. A subset $\mathcal{C}$ of $\mathscr{S}_n(q)$ is called a $d$-code if the rank of $A-B$ is larger than or equal to $d$ for…

Combinatorics · Mathematics 2025-12-23 Wei Tang , Yue Zhou

Maximum Hermitian rank metric codes were introduced by Schmidt in 2018 and in this paper we propose both interpolation-based encoding and decoding algorithms for this family of codes when the length and the minimum distance of the code are…

Information Theory · Computer Science 2021-06-25 Wrya K. Kadir , Chunlei Li , Ferdinando Zullo

This paper presents encoding and decoding algorithms for several families of optimal rank metric codes whose codes are in restricted forms of symmetric, alternating and Hermitian matrices. First, we show the evaluation encoding is the right…

Information Theory · Computer Science 2022-02-08 Wrya K. Kadir , Chunlei Li , Ferdinando Zullo

In this paper we provide a large family of rank-metric codes, which contains properly the codes recently found by Longobardi and Zanella (2021) and by Longobardi, Marino, Trombetti and Zhou (2021). These codes are…

Information Theory · Computer Science 2021-04-16 Alessandro Neri , Paolo Santonastaso , Ferdinando Zullo

Maximum rank-distance (MRD) codes are extremal codes in the space of $m\times n$ matrices over a finite field, equipped with the rank metric. Up to generalizations, the classical examples of such codes were constructed in the 1970s and are…

Combinatorics · Mathematics 2018-02-14 Kai-Uwe Schmidt , Yue Zhou

We study the Hermitian hull-variation problem for vector rank-metric codes. Except for one parameter pair, we show that the Hermitian hull dimension of such a code can be reduced to any smaller value within its equivalence class, and in…

Information Theory · Computer Science 2026-05-20 Duy Ho

In [A. Neri, P. Santonastaso, F. Zullo. Extending two families of maximum rank distance codes], the authors extended the family of $2$-dimensional $\mathbb{F}_{q^{2t}}$-linear MRD codes recently found in [G. Longobardi, G. Marino, R.…

Information Theory · Computer Science 2023-03-29 S. Gupta , G. Longobardi , R. Trombetti

In the realm of rank-metric codes, Maximum Rank Distance (MRD) codes are optimal algebraic structures attaining the Singleton-like bound. A major open problem in this field is determining whether an MRD code can be extended to a longer one…

Information Theory · Computer Science 2026-04-02 Daniele Bartoli , Alessandro Giannoni , Giuseppe Marino , Alessandro Neri

This study investigates Hermitian rank-metric codes, a special class of rank-metric codes, focusing on perfect codes and on the analysis of their covering properties. Firstly, we establish bounds on the size of spheres in the space of…

Information Theory · Computer Science 2025-08-07 Usman Mushrraf

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…

Combinatorics · Mathematics 2012-07-24 Lars Eirik Danielsen

The projective space of order $n$ over a finite field $\F_q$ is a set of all subspaces of the vector space $\F_q^{n}$. In this work, we consider error-correcting codes in the projective space, focusing mainly on constant dimension codes. We…

Information Theory · Computer Science 2011-09-09 Natalia Silberstein

This preprint is of a chapter to appear in {\it Combinatorics and finite fields: Difference sets, polynomials, pseudorandomness and applications. Radon Series on Computational and Applied Mathematics}, K.-U. Schmidt and A. Winterhof (eds.).…

Combinatorics · Mathematics 2019-04-12 John Sheekey

As a result of their applications in network coding, space-time coding, and coding for criss-cross errors, matrix codes have garnered significant attention; in various contexts, these codes have also been termed rank-metric codes,…

Information Theory · Computer Science 2015-07-21 Katherine Morrison

This paper investigates the construction of rank-metric codes with specified Ferrers diagram shapes. These codes play a role in the multilevel construction for subspace codes. A conjecture from 2009 provides an upper bound for the dimension…

Information Theory · Computer Science 2019-04-30 Jared Antrobus , Heide Gluesing-Luerssen

In this paper we extend the study of linear spaces of upper triangular matrices endowed with the flag-rank metric. Such metric spaces are isometric to certain spaces of degenerate flags and have been suggested as suitable framework for…

Combinatorics · Mathematics 2023-03-30 Gianira N. Alfarano , Alessandro Neri , Ferdinando Zullo

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,…

Information Theory · Computer Science 2023-03-14 Arthur Bik , Alessandro Neri

We calculate the maximal dimension of linear spaces of symmetric and hermitian matrices with given high rank, generalizing a well-known result of Adams {\em et al.}

Algebraic Topology · Mathematics 2007-05-23 Andrea Causin , Gian Pietro Pirola
‹ Prev 1 2 3 10 Next ›