Related papers: Relative generalized Hamming weights of evaluation…
In order to understand the performance of a code under maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's…
We introduce the sum-rank metric analogue of Reed--Muller codes, which we called linearized Reed--Muller codes, using multivariate Ore polynomials. We study the parameters of these codes, compute their dimension and give a lower bound for…
The purpose of this paper is to investigate the generalized formulation of weighted optimal guidance laws with impact angle constraint. From the generalized formulation, we explicitly find the feasible set of weighting functions that lead…
Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer…
The weight distribution of error correction codes is a critical determinant of their error-correcting performance, making enumeration of utmost importance. In the case of polar codes, the minimum weight $\wm$ (which is equal to minimum…
In this paper, we consider the affine variety codes obtained evaluating the polynomials $by=a_kx^k+\dots+a_1x+a_0$, $b,a_i\in\mathbb{F}_{q^r}$, at the affine $\F_{q^r}$-rational points of the Norm-Trace curve. In particular, we investigate…
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…
We study properties of rank metric and codes in rank metric over finite fields. We show that in rank metric perfect codes do not exist. We derive an existence bound that is the equivalent of the Gilbert--Varshamov bound in Hamming metric.…
Recently, double Toeplitz codes have been introduced as a generalization of double circulant codes. In this paper, we study the average weight enumerators of double Toeplitz codes. As an application, we consider the existence of double…
We give new lower bounds for the (higher) topological complexity of a space, in terms of the Lusternik-Schnirelmann category of a certain auxiliary space. We also give new lower bounds for the rational topological complexity of a space, and…
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 parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
We present methods and explicit formulas for describing simple weight modules over twisted generalized Weyl algebras. When a certain commutative subalgebra is finitely generated over an algebraically closed field we obtain a classification…
Lower bounds for some explicit decision problems over the complex numbers are given.
In this paper we study the algebraic-geometry of any one-point code on the Hermitian curve. Moreover, we characterize the minimum-weight codewords of some of their dual codes and describe many their small-weight codewords.
In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…
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…
We derive a linear programming bound on the maximum cardinality of error-correcting codes in the sum-rank metric. Based on computational experiments on relatively small instances, we observe that the obtained bounds outperform all…
We obtain a graded character formula for certain graded modules for the current algebra over a simple Lie algebra of type E6. For certain values of their highest weight, these modules were conjectured to be isomorphic to the classical limit…
In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…