相关论文: On the parameters of Algebraic Geometry codes rela…

In this paper we study spread codes: a family of constant-dimension codes for random linear network coding. In other words, the codewords are full-rank matrices of size (k x n) with entries in a finite field F_q. Spread codes are a family…

In this note we generalise some of the work of Klarner on free semigroups of affine maps acting on the real line by using a classical approach from geometric group theory (the Ping-Pong lemma). We also investigate the boundaries within…

In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…

Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear codes. In practice, one often uses codes with additional…

In this note, a class of error-correcting codes is associated to a toric variety associated to a fan defined over a finite field $\fff_q$, analogous to the class of Goppa codes associated to a curve. For such a ``toric code'' satisfying…

Let $M$ be a finite von Neumann algebra. In the first part, we give asymptotic results about $M$-stable sequences of weak*-continuous mappings which are related with operators belonging to $M$. In the second part, we extend, by a shorter…

Distances between probability distributions that take into account the geometry of their sample space,like the Wasserstein or the Maximum Mean Discrepancy (MMD) distances have received a lot of attention in machine learning as they can, for…

Numerical semigroups have been extensively studied throughout the literature, and many of their invariants have been characterized. In this work, we generalize some of the most important results about symmetry, pseudo-symmetry, or…

The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…

In this paper, we study configurations of three rational points on the Hermitian curve over $\mathbb{F}_{q^2}$ and classify them according to their Weierstrass semigroups. For $q>3$, we show that the number of distinct semigroups of this…

Let $p$ be a prime integer, $k$ be a $p$-closed field of characteristic $\neq p$, $T$ be a torus defined over $k$, $F$ be a finite $p$-group, and $1\to T \to G \to F \to 1$ be an exact sequence of algebraic groups. Extending earlier work of…

Codes in finite projective spaces equipped with the subspace distance have been proposed for error control in random linear network coding. The resulting so-called \emph{Main Problem of Subspace Coding} is to determine the maximum size…

Motivated by the construction of optimal locally repairable codes, we introduce the new finite geometric concept of a \emph{local arc} which is defined as a collection $\mathcal{S}$ of disjoint point sets $S_{i}$ in $\mathrm{PG}(2,q)$ such…

For any affine-variety code we show how to construct an ideal whose solutions correspond to codewords with any assigned weight. We classify completely the intersections of the Hermitian curve with lines and parabolas (in the…

This work introduces a new kind of semigroup of $\N^p$ called proportionally modular affine semigroup. These semigroups are defined by modular Diophantine inequalities and they are a generalization of proportionally modular numerical…

Suppose that $\Omega$ is a lattice in the complex plane and let $\sigma$ be the corresponding Weierstrass $\sigma$-function. Assume that the point $\tau$ associated to $\Omega$ in the standard fundamental domain has imaginary part at most…

A structure theorem of the group codes which are relative projective for the subgroup $\lbrace 1 \rbrace$ of $G$ is given. With this, we show that all such relative projective group codes in a fixed group algebra $RG$ are in bijection to…

Galois self-orthogonal (SO) codes are generalizations of Euclidean and Hermitian SO codes. Algebraic geometry (AG) codes are the first known class of linear codes exceeding the Gilbert-Varshamov bound. Both of them have attracted much…

Let $\Omega\subset\R^N$ be an arbitrary open set and denote by $(e^{-t(-\Delta)_{\RR^N}^s})_{t\ge 0}$ (where $0<s<1$) the semigroup on $L^2(\RR^N)$ generated by the fractional Laplace operator. In the first part of the paper we show that if…

We improve the previously best known lower and upper bounds on the number n_g of numerical semigroups of genus g. Starting from a known recursive description of the tree T of numerical semigroups, we analyze some of its properties and use…