Related papers: Perfect Hermitian rank-metric codes
We investigate the Whitney numbers of the first kind of rank-metric lattices, which are closely linked to the open problem of enumerating rank-metric codes having prescribed parameters. We apply methods from the theory of hyperovals and…
The sum-rank metric can be seen as a generalization of both, the rank and the Hamming metric. It is well known that sum-rank metric codes outperform rank metric codes in terms of the required field size to construct maximum distance…
The sum-rank metric arises as an algebraic approach for coding in MIMO block-fading channels and multishot network coding. Codes designed in the sum-rank metric have raised interest in applications such as streaming codes, robust coded…
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…
We investigate two fundamental questions intersecting coding theory and combinatorial geometry, with emphasis on their connections. These are the problem of computing the asymptotic density of MRD codes in the rank metric, and the Critical…
The rank modulation scheme has been proposed for efficient writing and storing data in non-volatile memory storage. Error-correction in the rank modulation scheme is done by considering permutation codes. In this paper we consider codes in…
In this work, we consider tilings of the Hamming cube and look for metrics which turn the tilings into a perfect code. We consider the family of metrics which are determined by a weight and are compatible with the support of vectors…
We study linear codes over Gaussian integers equipped with the Mannheim distance. We develop Mannheim-metric analogues of several classical bounds. We derive an explicit formula for the volume of Mannheim balls, which yields a sphere…
Codes which attain the sphere packing bound are called perfect codes. The most important metrics in coding theory on which perfect codes are defined are the Hamming metric and the Johnson metric. While for the Hamming metric all perfect…
We solve the problem of the classification of perfect quantum codes. We prove that the only nontrivial perfect quantum codes are those with the parameters . There exist no other nontrivial perfect quantum codes.
In this paper, we investigate completely decomposable rank-metric codes, i.e. rank-metric codes that are the direct sum of 1-dimensional maximum rank distance codes. We study the weight distribution of such codes, characterizing codewords…
Saturating sets are combinatorial objects in projective spaces over finite fields that have been intensively investigated in the last three decades. They are related to the so-called covering problem of codes in the Hamming metric. In this…
We investigate the asymptotic density of error-correcting codes with good distance properties and prescribed linearity degree, including sublinear and nonlinear codes. We focus on the general setting of finite translation-invariant metric…
A tiling of the $n$-dimensional Hamming cube gives rise to a perfect code (according to a given metric) if the basic tile is a metric ball. We are concerned with metrics on the $n$-dimensional Hamming cube which are determined by a weight…
Optimal rank-metric codes in Ferrers diagrams are considered. Such codes consist of matrices having zeros at certain fixed positions and can be used to construct good codes in the projective space. Four techniques and constructions of…
In this paper we introduce and investigate rank-metric intersecting codes, a new class of linear codes in the rank-metric context, inspired by the well-studied notion of intersecting codes in the Hamming metric. A rank-metric code is said…
We study singular Hermitian metrics on vector bundles. There are two main results in this paper. The first one is on the coherence of the higher rank analogue of multiplier ideals for singular Hermitian metrics defined by global sections.…
Codes in the sum-rank metric have received many attentions in recent years, since they have wide applications in the multishot network coding, the space-time coding and the distributed storage. In this paper, by constructing covering codes…
In this paper, we study the enumerative and asymptotic properties related to Hermitian $\ell$-complementary codes on the unitary space over $\F_{q^2}$. We provide some closed form expressions for the counting formulas of Hermitian…
Given a parity-check matrix $H_m$ of a $q$-ary Hamming code, we consider a partition of the columns into two subsets. Then, we consider the two codes that have these submatrices as parity-check matrices. We say that anyone of these two…