Related papers: Codes and modular curves
Given a prime power q, for every pair of positive integers m and n with m dividing the GCD of n and q-1, we construct a modular curve over F_q that parametrizes elliptic curves over F_q along with F_q-defined points P and Q of order m and…
Special functions, coding theory and $t$-designs have close connections and interesting interplay. A standard approach to constructing $t$-designs is the use of linear codes with certain regularity. The Assmus-Mattson Theorem and the…
Cyclic codes with a few weights are very useful in the design of frequency hopping sequences and the development of secret sharing schemes. In this paper, we mainly use Gauss sums to represent the Hamming weights of a general construction…
We construct a class of $\mathbb{Z}_2\mathbb{Z}_4$-additive cyclic codes generated by pairs of polynomials, study their algebraic structures, and obtain the generator matrix of any code in the class. Using a probabilistic method, we prove…
Since Massey introduced linear complementary dual (LCD) codes in 1992 and Bhasin et al. later formalized linear complementary pairs (LCPs) of codes - structures with important cryptographic applications - these code families have attracted…
There are many results on the minimum distance of a cyclic code of the form that if a certain set T is a subset of the defining set of the code, then the minimum distance of the code is greater than some integer t. This includes the BCH,…
We study the real components of modular curves. Our main result is an abstract group-theoretic description of the real components of a modular curve defined by a congruence subgroup of level N in terms of the corresponding subgroup of…
We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…
Recent work has introduced the study of graphical properties of cyclic supercharacters, functions $\mathbb{Z}/n\mathbb{Z}\to \mathbb{C}$ whose values are exponential sums with close connections to Gauss sums and Gaussian periods. Plots of…
A curve X over the field Q of rational numbers is modular if it is dominated by X_1(N) for some N; if in addition the image of its jacobian in J_1(N) is contained in the new subvariety of J_1(N), then X is called a new modular curve. We…
In this thesis we expand upon the results that led to the paper of Lee et al., arXiv:2105.01114 (2021). In particular, we give more details on the oracular formulation of variational quantum algorithms, and the relationship between…
Let $n \in \mathbb{Z}_{>0}$. We prove that there exist a finite set $V$ and finitely many algebraic curves $T_1, \ldots, T_k$ with the following property: if $(x_1, \ldots, x_n, y)$ is an $(n+1)$-tuple of pairwise distinct singular moduli…
Arithmetic circuits (AC) are circuits over the real numbers with 0/1-valued input variables whose gates compute the sum or the product of their inputs. Positive AC -- that is, AC representing non-negative functions -- subsume many…
Let $q$ be an odd prime, and let $T_{q}:\mathbb{Z}\rightarrow\mathbb{Z}$ be the Shortened $qx+1$ map, defined by $T_{q}\left(n\right)=n/2$ if $n$ is even and $T_{q}\left(n\right)=\left(qn+1\right)/2$ if $n$ is odd. The study of the dynamics…
In coding theory, constructing codes with good parameters is one of the most important and fundamental problems. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes equal to prime powers.…
Two classes of turbo codes over high-order finite fields are introduced. The codes are derived from a particular protograph sub-ensemble of the (dv=2,dc=3) low-density parity-check code ensemble. A first construction is derived as a…
Modules over affine Lie superalgebras ${\cal G}$ are studied, in particular, for ${\cal G}=\hat{OSP(1,2)}$. It is shown that on studying Verma modules, much of the results in Kac-Moody algebra can be generalized to the super case. Of most…
A finite group with a cyclic normal subgroup N such that G/N is cyclic is said to be metacyclic. A code over a finite field F is a metacyclic code if it is a left ideal in the group algebra FG for G a metacyclic group. Metacyclic codes are…
Universal quantum computation requires the implementation of a logical non-Clifford gate. In this paper, we characterize all stabilizer codes whose code subspaces are preserved under physical $T$ and $T^{-1}$ gates. For example, this could…
Green and Tao famously proved in a 2008 paper that there are arithmetic progressions of prime numbers of arbitrary lengths. Soon after, analogous statements were proved by Tao for the ring of Gaussian integers and by L\^e for the polynomial…