Related papers: New Constructions of Optimal $(r,\delta)$-LRCs via…
The length function $\ell_2(r,R)$ is the smallest length of a binary linear code with codimension (redundancy) $r$ and covering radius $R$. We obtain the following new upper bounds on $\ell_2(r,R)$, which yield a decrease $\Delta(r,R)$…
This is a first part of a series of papers in which we develop explicit computational methods for automorphic forms for GL(3) and PGL(3) over elliptic function fields. In this first part, we determine explicit formulas for the action of the…
We consider those two-dimensional rational conformal field theories (RCFTs) whose chiral algebras, when maximally extended, are isomorphic to the current algebra formed from some affine non-twisted Kac--Moody algebra at fixed level. In this…
Linear codes are widely studied due to their applications in communication, cryptography, quantum codes, distributed storage and many other fields. In this paper, we use the trace and norm functions over finite fields to construct a family…
Solomon and Stiffler constructed infinitely many families of linear codes meeting the Griesmer bound in 1965. It is well-known in 1990's that certain Griesmer codes (codes with the zero Griesmer defect) are equivalent to Solomon-Stiffler…
Classical locally recoverable codes (LRCs) have become indispensable in distributed storage systems. They provide efficient recovery in terms of localized errors. Quantum LRCs have very recently been introduced for their potential…
Rank-metric codes, defined as sets of matrices over a finite field with the rank distance, have gained significant attention due to their applications in network coding and connections to diverse mathematical areas. Initially studied by…
Given a graph $G = (V,E)$, an $(\alpha, \beta)$-ruling set is a subset $S \subseteq V$ such that the distance between any two vertices in $S$ is at least $\alpha$, and the distance between any vertex in $V$ and the closest vertex in $S$ is…
We construct a 1-parameter family of Ramond-Ramond fluxes supporting the elliptic $\mathrm{AdS}_3 \times \mathrm{S}^3 \times \mathrm{T}^4$ metric with constant dilaton and preserving 8 of the 16 supercharges of the undeformed background. On…
Locally repairable codes have been investigated extensively in recent years due to practical application in distributed storage as well as theoretical interest. However, not much work on asymptotical behavior of locally repairable codes has…
A class of optimal three-weight cyclic codes of dimension 3 over any finite field was presented by Vega [Finite Fields Appl., 42 (2016) 23-38]. Shortly thereafter, Heng and Yue [IEEE Trans. Inf. Theory, 62(8) (2016) 4501-4513] generalized…
Binary self-dual codes with large minimum distances, such as the extended Hamming code and the Golay code, are fascinating objects in the coding theory. They are closely related to sporadic simple groups, lattices and invariant theory. A…
We prove uniform $L^p$ estimates for resolvents of higher order elliptic self-adjoint differential operators on compact manifolds without boundary, generalizing a corresponding resul of [3] in the case of Laplace-- Beltrami operators on…
It is shown that exact renormalization group (RG) equations (including rescaling and field-renormalization) for respectively the scale-dependent full action $S[\phi,t]$ and the scale-dependent full effective action $\Gamma[\Phi,t]$ --in…
We use class field theory, specifically Drinfeld modules of rank 1, to construct a family of asymptotically good algebraic-geometric (AG) codes over fixed alphabets. Over a field of size $\ell^2$, these codes are within $2/(\sqrt{\ell}-1)$…
In 1999, Xing, Niederreiter and Lam introduced a generalization of AG codes using the evaluation at non-rational places of a function field. In this paper, we show that one can obtain a locality parameter $r$ in such codes by using only…
We construct new families of elliptic curves over \(\FF_{p^2}\) with efficiently computable endomorphisms, which can be used to accelerate elliptic curve-based cryptosystems in the same way as Gallant-Lambert-Vanstone (GLV) and…
The current paper studies the problem of agnostic $Q$-learning with function approximation in deterministic systems where the optimal $Q$-function is approximable by a function in the class $\mathcal{F}$ with approximation error $\delta \ge…
We address the problem of constructing elliptic polytopes in R^d, which are convex hulls of finitely many two-dimensional ellipses with a common center. Such sets arise in the study of spectral properties of matrices, asymptotics of long…
Sum-rank metric codes, as a generalization of Hamming codes and rank metric codes, have important applications in fields such as multi-shot linear network coding, space-time coding and distributed storage systems. The purpose of this study…