Related papers: Two-Point Codes for the Generalized GK curve
Let $G$ be a 2-connected graph of order $n$ and let $c$ be the circumference - the order of a longest cycle in $G$. In this paper we present a sharp lower bound for the circumference based on minimum degree $\delta$ and $p$ - the order of a…
Consider a hyperelliptic curve of genus $g$ over a field $K$ of characteristic zero. After extending $K$ we can view it as a marked curve with its $2g+2$ Weierstrass points. We prove some general properties of the stable reduction of this…
Grothendieck constants $K_G(d)$ bound the advantage of $d$-dimensional strategies over $1$-dimensional ones in a specific optimisation task. They have applications ranging from approximation algorithms to quantum nonlocality. However, apart…
We introduce a new type of distinct distances result: a lower bound on the number of distances between points on a line and points on a two-dimensional strip. This can be seen as a generalization of the well-studied problems of distances…
We revisit the well-known Gilbert-Varshamov (GV) bound for constrained systems. In 1991, Kolesnik and Krachkovsky showed that GV bound can be determined via the solution of some optimization problem. Later, Marcus and Roth (1992) modified…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
We introduce Generalized Skew Multivariate Goppa codes relying on the theory of multivariate Ore polynomials. These codes contain, as a particular case, the Generalized Skew Goppa codes. By providing a new parity check matrix for the…
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.
Quantum maximum-distance-separable (MDS for short) codes are an important class of quantum codes. In this paper, by using Hermitian self-orthogonal generalized Reed-Solomon (GRS for short) codes, we construct five new classes of $q$-ary…
The weight hierarchy of one-point algebraic geometry codes can be estimated by means of the generalized order bounds, which are described in terms of a certain Weierstrass semigroup. The asymptotical behaviour of such bounds for r > 1…
We consider linear codes over a field in which the error values are restricted to a subgroup of its unit group. This scenario captures Lee distance codes as well as codes over the Gaussian or Eisenstein integers. Codes correcting restricted…
We introduce a random coding technique for transmission over discrete memoryless channels, reminiscent of the basic construction attaining the Gilbert-Varshamov bound for codes in Hamming spaces. The code construction is based on drawing…
We consider the problem of designing optimal linear codes (in terms of having the largest minimum distance) subject to a support constraint on the generator matrix. We show that the largest minimum distance can be achieved by a subcode of a…
For $d\in\{5,6\}$, we classify arrangements of $d + 2$ points in $\mathbf{RP}^{d-1}$ for which the minimum distance is as large as possible. To do so, we leverage ideas from matrix and convex analysis to determine the best possible codes…
This paper characterizes Goppa codes of certain maximal curves over finite fields defined by equations of the form $y^n = x^m + x$. We investigate Algebraic Geometric and quantum stabilizer codes associated with these maximal curves and…
We study the Singleton-type bound that provides an upper limit on the minimum distance of locally repairable codes. We present an improved bound by carefully analyzing the combinatorial structure of the repair sets. Thus, we show the…
This largely expository paper first gives an introduction to Hilbert stability and its use in Gieseker's GIT construction of $\overline{M}_g$. Then I review recent work in this area--variants for unpointed curves that arise in Hassett's log…
We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are…
Analytic combinatorics in several variables refers to a suite of tools that provide sharp asymptotic estimates for certain combinatorial quantities. In this paper, we apply these tools to determine the Gilbert--Varshamov lower bound on the…