Related papers: Functional codes arising from rank $n$ Hermitian v…

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…

Let $C$ be the rational normal curve of degree $e$ in $\mathbb{P}^n$, and let $X\subset \mathbb{P}^n$ be a degree $d\ge 2$ hypersurface containing $C$. In previous work, I. Coskun and E. Riedl showed that the normal bundle $N_{C/X}$ is…

We give an upper bound on the number of rational points of an arbitrary Zariski closed subset of a projective space over a finite field. This bound depends only on the dimensions and degrees of the irreducible components and holds for very…

Let $d$ and $n$ be positive integers, and $E/F$ be a separable field extension of degree $m=\binom{n+d}{n}$. We show that if $|F| > 2$, then there exists a point $P\in \mathbb{P}^n(E)$ which does not lie on any degree $d$ hypersurface…

We extend our previous work on hypergeometric point count formulas by proving that we can express the number of points on families of Dwork hypersurfaces $$X_{\lambda}^d: \hspace{.1in} x_1^d+x_2^d+\ldots+x_d^d=d\lambda x_1x_2\cdots x_d$$…

Let $X^n$ be a nonsingular hypersurface of degree $d\geq 2$ in the projective space $\mathbb{P}^{n+1}$ defined over a finite field $\mathbb{F}_q$ of $q$ elements. We prove a Homma-Kim conjecture on a upper bound about the number of…

The surface code is a promising platform for a quantum memory, but its threshold under coherent errors remains incompletely understood. We study maximum-likelihood decoding of the square-lattice surface code in the presence of single-qubit…

We introduce the concepts of complex Grassmannian codes and designs. Let G(m,n) denote the set of m-dimensional subspaces of C^n: then a code is a finite subset of G(m,n) in which few distances occur, while a design is a finite subset of…

We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…

In a recent work, quantum locally recoverable codes (qLRCs) have been introduced for their potential application in large-scale quantum data storage and implication for quantum LDPC codes. This work focuses on the bounds and constructions…

Pfender \textit{[J. Combin. Theory Ser. A, 2007]} provided a one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes, which offers an upper bound for the celebrated…

We investigate the structure of intersecting error-correcting codes, with a particular focus on their connection to matroid theory. We establish properties and bounds for intersecting codes with the Hamming metric and illustrate how these…

We consider complex projective schemes $X\subset\Bbb{P}^{r}$ defined by quadratic equations and satisfying a technical hypothesis on the fibres of the rational map associated to the linear system of quadrics defining $X$. Our assumption is…

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…

Let $\mathcal W$ be a non-empty set of points of a finite Desarguesian projective space $\mathrm{PG}(n,q)$. A collection of varieties of $\mathrm{PG}(n,q)$ is \emph{mutually $\mu$-intersecting (relatively to $\mathcal W$)} if its elements…

Constructing quantum LDPC codes with a minimum distance that grows faster than a square root of the length has been a major challenge of the field. With this challenge in mind, we investigate constructions that come from high-dimensional…

In this paper, two classes of quantum MDS codes are constructed. The main tools are multiplicative structures on finite fields. Carefully choosing different cosets can make the corresponding generalized Reed-Solomon codes Hermitian…

Cyclic and self-dual codes are important classes of codes in coding theory. Jia, Ling and Xing \cite{Jia} as well as Kai and Zhu \cite{Kai} proved that Euclidean self-dual cyclic codes of length $n$ over $\mathbb{F}_q$ exist if and only if…

We study integration and $L^2$-approximation of functions of infinitely many variables in the following setting: The underlying function space is the countably infinite tensor product of univariate Hermite spaces and the probability measure…

In $R^d$, define a maximal function in the directions $v\in \directions\subset\{x \mid \abs x=1\}$ by $$ M^\directions f(x)=\sup_{v\in\directions} \sup_{\zve} \int_{-\ze}^\ze \abs{f(x-vy)} dy. $$ For a function $f$ on $\ZR^d$, let $S_\zw f$…