Related papers: Groups of linear isometries on weighted poset bloc…
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…
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…
The weight distribution of the cosets of maximum distance separable (MDS) codes is considered. In 1990, P.G. Bonneau proposed a relation to obtain the full weight distribution of a coset of an MDS code with minimum distance $d$ using the…
Block codes, which correct asymmetric errors with limited-magnitude, are studied. These codes have been applied recently for error correction in flash memories. The codes will be represented by lattices and the constructions will be based…
Gleason's 1970 theorem on weight enumerators of self-dual codes has played a crucial role for research in coding theory during the last four decades. Plenty of generalizations have been proved but, to our knowledge, they are all based on…
Which integer sequences are sequences of generalized weights of a linear code? In this paper, we answer this question for linear block codes, rank-metric codes, and more generally for sum-rank metric codes. We do so under an existence…
In recent work, generalized persistence modules have proved useful in distinguishing noise from the legitimate topological features of a data set. Algebraically, generalized persistence modules can be viewed as representations for the poset…
Our purpose in this paper is to study isometries and isometric embeddings of the $p$-Wasserstein space $\mathcal{W}_p(\mathbb{H}^n)$ over the Heisenberg group $\mathbb{H}^n$ for all $p>1$ and for all $n\geq 1$. First, we create a link…
We develop a self-contained theory of log-Euclidean Lie groups: smooth manifolds diffeomorphic to finite-dimensional vector spaces, equipped with the pullback of a constant Euclidean metric. This framework encompasses symmetric…
We introduce a new weight and corresponding metric over finite extension fields for asymmetric error correction. The weight distinguishes between elements from the base field and the ones outside of it, which is motivated by asymmetric…
We generalize the example of linear set presented by the last two authors in "Vertex properties of maximum scattered linear sets of $\mathrm{PG}(1,q^n)$" (2019) to a more general family, proving that such linear sets are maximum scattered…
We consider distance functions on a quotient module $M/K$ induced by distance functions on a module $M$. We define error-correction for codes in $M/K$ with respect to induced distance functions. For the case that the metric is induced by a…
A new construction for moderate density parity-check (MDPC) codes using finite geometry is proposed. We design a parity-check matrix for this family of binary codes as the concatenation of two matrices: the incidence matrix between points…
Let V be an n-dimensional vector space over a finite field F_q. We consider on V the $\pi$-metric recently introduced by K. Feng, L. Xu and F. J. Hickernell. In this short note we give a complete description of the group of symmetries of V…
The code equivalence problem is central in coding theory and cryptography. While classical invariants are effective for Hamming and rank metrics, the sum-rank metric, which unifies both, introduces new challenges. This paper introduces new…
Metric embedding has become a common technique in the design of algorithms. Its applicability is often dependent on how high the embedding's distortion is. For example, embedding finite metric space into trees may require linear distortion…
A barcode is a finite multiset of intervals on the real line, $B = \{ (b_i, d_i)\}_{i=1}^n$. Barcodes are important objects in topological data analysis, where they serve as summaries of the persistent homology groups of a filtration. The…
The definition of weighted distance measure involves weights. The paper proposes a weighted distance measure without the help of weights. Here, weights are intrinsically added to the measure, and for this, the concept of metric space is…
We prove a simple formula for arbitrary cluster variables in the marked surfaces model. As part of the formula, we associate a labeled poset to each tagged arc, such that the associated $F$-polynomial is a weighted sum of order ideals. Each…
For a bounded metric space X, we define a metric on the set of all finite subsets of X. This generalizes the sequence-subset distance introduced by Wentu Song, Kui Cai and Kees A. Schouhamer Immink to study error correcting codes for DNA…