Related papers: Improvement on Parameters of Algebraic-Geometry Co…
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…
Let $C$ be a hyperelliptic curve over $\mathbb Q$ described by $y^2=a_0x^n+a_1x^{n-1}+\ldots+a_n$, $a_i\in\mathbb Q$. The points $P_{i}=(x_{i},y_{i})\in C(\mathbb{Q})$, $i=1,2,...,k,$ are said to be in a geometric progression of length $k$…
By using the notion of $d$-embedding $\Gamma$ of a (canonical) subgeometry $\Sigma$ and of exterior set with respect to the $h$-secant variety $\Omega_{h}(\mathcal{A})$ of a subset $\mathcal{A}$, $ 0 \leq h \leq n-1$, in the finite…
The iterated Johnson bound is the best known upper bound on a size of an error-correcting code in the Grassmannian $\mathcal{G}_q(n,k)$. The iterated Sch\"{o}nheim bound is the best known lower bound on the size of a covering code in…
Linear complementary dual codes (LCD) intersect trivially with their dual. In this paper, we develop a new characterization for LCD codes, which allows us to judge the complementary duality of linear codes from the codeword level. Further,…
Asymmetric quantum error-correcting codes (AQCs) may offer some advantage over their symmetric counterparts by providing better error-correction for the more frequent error types. The well-known CSS construction of $q$-ary AQCs is extended…
Error correcting codes are defined and important parameters for a code are explained. Parameters of new codes constructed on algebraic surfaces are studied. In particular, codes resulting from blowing up points in $\proj^2$ are briefly…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
The Grassmannian is an important object in Algebraic Geometry. One of the many techniques used to study the Grassmannian is to build a vector space from its points in the projective embedding and study the properties of the resulting linear…
Locally recoverable codes are error correcting codes with the additional property that every symbol of any codeword can be recovered from a small set of other symbols. This property is particularly desirable in cloud storage applications. A…
Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…
We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
We give a bound on embedding dimensions of geometric generic fibers in terms of the dimension of the base, for fibrations in positive characteristic. This generalizes the well-known fact that for fibrations over curves, the geometric…
We apply quantum Construction X on quasi-cyclic codes with large Hermitian hulls over $\mathbb{F}_4$ and $\mathbb{F}_9$ to derive good qubit and qutrit stabilizer codes, respectively. In several occasions we obtain quantum codes with…
Codes over trees were introduced recently to bridge graph theory and coding theory with diverse applications in computer science and beyond. A central challenge lies in determining the maximum number of labelled trees over $n$ nodes with…
This paper introduces a class of Hermitian LCD $2$-quasi-abelian codes over finite fields and presents a comprehensive enumeration of these codes in which relative minimum weights are small. We show that such codes are asymptotically good…
The number A(q) shows the asymptotic behaviour of the quotient of the number of rational points over the genus of non-singular absolutely irreducible curves over a finite field Fq. Research on bounds for A(q) is closely connected with the…
We give new positive and negative results (some conditional) on speeding up computational algebraic geometry over the reals: (1) A new and sharper upper bound on the number of connected components of a semialgebraic set. Our bound is novel…
The Hasse-Weil bound is a deep result in mathematics and has found wide applications in mathematics, theoretical computer science, information theory etc. In general, the bound is tight and cannot be improved. However, for some special…