English
Related papers

Related papers: Perfect Hermitian rank-metric codes

200 papers

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…

Information Theory · Computer Science 2026-01-23 Alessandro Neri , Ferdinando Zullo

We propose the first non-trivial generic decoding algorithm for codes in the sum-rank metric. The new method combines ideas of well-known generic decoders in the Hamming and rank metric. For the same code parameters and number of errors,…

Information Theory · Computer Science 2021-10-29 Sven Puchinger , Julian Renner , Johan Rosenkilde

Diameter perfect codes form a natural generalization for perfect codes. They are based on the code-anticode bound which generalizes the sphere-packing bound. The code-anticode bound was proved by Delsarte for distance-regular graphs and it…

Information Theory · Computer Science 2021-09-28 Tuvi Etzion

Several new applications and a number of new mathematical techniques have increased the research on error-correcting codes in the Lee metric in the last decade. In this work we consider several coding problems and constructions of…

Information Theory · Computer Science 2015-03-13 Tuvi Etzion , Alexander Vardy , Eitan Yaakobi

The focus of this article is on metric completions of triangulated categories arising in the representation theory of hereditary finite dimensional algebras and commutative rings. We explicitly describe all completions of bounded derived…

Representation Theory · Mathematics 2026-01-28 Cyril Matoušek

Properties of Hermitian forms are used to investigate several natural questions from CR Geometry. To each Hermitian symmetric polynomial we assign a Hermitian form. We study how the signature pairs of two Hermitian forms behave under the…

Complex Variables · Mathematics 2011-10-20 John P. D'Angelo , Jiri Lebl

In the rank modulation scheme for flash memories, permutation codes have been studied. In this paper, we study perfect permutation codes in $S_n$, the set of all permutations on $n$ elements, under the Kendall \tau-Metric. We answer one…

Information Theory · Computer Science 2020-11-04 Wang Xiang , Wang Yuanjie , Yin Wenjuan , Fu Fang-Wei

We describe odd-length-cube tilings of the n-dimensional q-ary torus what includes q-periodic integer lattice tilings of R^n. In the language of coding theory these tilings correspond to perfect codes with respect to the maximum metric. A…

Combinatorics · Mathematics 2016-01-15 Claudio Qureshi , Sueli I. R. Costa

Nearly perfect packing codes are those codes that meet the Johnson upper bound on the size of error-correcting codes. This bound is an improvement to the sphere-packing bound. A related bound for covering codes is known as the van Wee…

Information Theory · Computer Science 2024-10-08 Avital Boruchovsky , Tuvi Etzion , Ron M. Roth

Pseudo-hermitian matrices are matrices hermitian with respect to an indefinite metric. They can be thought of as the truncation of pseudo-hermitian operators, defined over some Krein space, together with the associated metric, to a finite…

Mathematical Physics · Physics 2022-02-03 Joshua Feinberg , Roman Riser

We construct integer error-correcting codes and covering codes for the limited-magnitude error channel with more than one error. The codes are lattices that pack or cover the space with the appropriate error ball. Some of the constructions…

Information Theory · Computer Science 2020-06-01 Hengjia Wei , Xin Wang , Moshe Schwartz

Motivated by the search for best lattice sphere packings in Euclidean spaces of large dimensions we study randomly generated perfect lattices in moderately large dimensions (up to d=19 included). Perfect lattices are relevant in the…

Statistical Mechanics · Physics 2013-05-30 Alexei Andreanov , Antonello Scardicchio

The existence question for tiling of the $n$-dimensional Euclidian space by crosses is well known. A few existence and nonexistence results are known in the literature. Of special interest are tilings of the Euclidian space by crosses with…

Combinatorics · Mathematics 2012-10-12 Sarit Buzaglo , Tuvi Etzion

Self-orthogonal codes have been of interest due to there rich algebraic structures and wide applications. Euclidean self-orthogonal codes have been quite well studied in literature. Here, we have focused on Hermitian self-orthogonal codes.…

Information Theory · Computer Science 2017-10-16 Somphong Jitman , Todsapol Mankean

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

A natural metric on the space of all almost hermitian structures on a given manifold is investigated.

Differential Geometry · Mathematics 2008-02-03 Olga Gil-Medrano , Peter W. Michor

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

Information Theory · Computer Science 2023-03-22 Cornelia Ott , Sven Puchinger , Martin Bossert

We investigate degenerate special-Hermitian metrics on compact complex manifolds, in particular, degenerate K\"ahler and locally conformally K\"ahler metrics on special classes of non-K\"ahler manifolds.

Differential Geometry · Mathematics 2018-02-20 Daniele Angella , Adriano Tomassini

The space of full-ranked one-forms on a smooth, orientable, compact manifold (possibly with boundary) is metrically incomplete with respect to the induced geodesic distance of the generalized Ebin metric. We show a distance equality between…

Differential Geometry · Mathematics 2023-08-01 Nicola Cavallucci , Zhe Su

We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed…

Combinatorics · Mathematics 2025-04-10 Matteo Bonini , Martino Borello , Eimear Byrne