Search

Quadratic residue patterns modulo a prime are studied since 19th century. In the first part we extend existing results on the number of consecutive $\ell$-tuples of quadratic residues, studying corresponding algebraic curves and their jacobians, which happen to be products of jacobians of hyperelliptic curves. In the second part we state the last unpublished result of Lydia Goncharova on squares such that their differences are also squares, reformulate it in terms of algebraic geometry of a K3 surface, and prove it. The core of this theorem is an unexpected relation between the number of points on the K3 surface and that on a CM elliptic curve., Comment: 24 pages, to be submitted; develops and replaces arXiv:2303.03270

In this paper, we show infinite series of $3$-designs in the extended quadratic residue codes over $\mathbb {F}_{r^2}$ for a prime $r$., Comment: 14 pages. arXiv admin note: text overlap with arXiv:2309.03206; text overlap with arXiv:2305.03285 by other authors

In the present paper, we give proofs of the existence of a 3-design in the extended ternary quadratic residue code of length 14 and the extended quaternary quadratic residue code of length 18., Comment: 15 pages

Quadratic residue patterns modulo a prime are studied since 19th century. We state the last unpublished result of Lydia Goncharova, reformulate it and prior results in terms of algebraic geometry, and prove it. The core of this theorem is an unexpected relation between the number of points on a K3 surface and that on a CM elliptic curve., Comment: 9 pages, highly preliminary

The codewords of weight $10$ of the $[42,21,10]$ extended binary quadratic residue code are shown to hold a design of parameters $3-(42,10,18).$ Its automorphism group is isomorphic to $PSL(2,41)$. Its existence can be explained neither by a transitivity argument, nor by the Assmus-Mattson theorem., Comment: 6 pages. Second version

In this paper, we construct self-dual codes from a construction that involves both block circulant matrices and block quadratic residue circulant matrices. We provide conditions when this construction can yield self-dual codes. We construct self-dual codes of various lengths over F2 and F2 + uF2. Using extensions, neighbours and sequences of neighbours, we construct many new self-dual codes. In particular, we construct one new self-dual code of length 66 and 51 new self-dual codes of length 68.

In this paper, we begin by reviewing some of the known properties of QQR codes and proved that $PSL_2(p)$ acts on the extended QQR code when $p \equiv 3 \pmod 4$. Using this discovery, we then showed their weight polynomials satisfy a strong divisibility condition, namely that they are divisible by $(x^2 + y^2)^{d-1}$, where $d$ is the corresponding minimum distance. Using this result, we were able to construct an efficient algorithm to compute weight polynomials for QQR codes and correct errors in existing results on quadratic residue codes. In the second half, we use the relation between the weight of codewords and the number of points on hyperelliptic curves to prove that the symmetrized distribution of a set of hyperelliptic curves is asymptotically normal., Comment: submitted to AIMS

Let $q > 2$ be a prime number and define $\lambda_q := \left( \frac{\tau}{q} \right)$ where $\tau(n)$ is the number of divisors of $n$ and $\left( \frac{\cdot}{q} \right)$ is the Legendre symbol. When $\tau(n)$ is a quadratic residue modulo $q$, then $\left( \lambda_q \star \mathbf{1} \right) (n)$ could be close to the number of divisors of $n$. This is the aim of this work to compare the mean value of the function $\lambda_q \star \mathbf{1}$ to the well known average order of $\tau$. The proof reveals that the results depend heavily on the value of $\left( \frac{2}{q} \right)$. A bound for short sums in the case $q=5$ is also given, using profound results from the theory of integer points close to certain smooth curves., Comment: 9 pages

Let $m\geq 2$ be any natural number and let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+\cdots+u^{m-1}\mathbb{F}_{p}$ be a finite non-chain ring, where $u^m=u$ and $p$ is a prime congruent to $1$ modulo $(m-1)$. In this paper we study quadratic residue codes over the ring $\mathcal{R}$ and their extensions. A gray map from $\mathcal{R}$ to $\mathbb{F}_{p}^m$ is defined which preserves self duality of linear codes. As a consequence self dual, formally self dual and self orthogonal codes are constructed. To illustrate this several examples of self-dual, self orthogonal and formally self-dual codes are given. Among others a [9,3,6] linear code over $\mathbb{F}_{7}$ is constructed which is self-orthogonal as well as nearly MDS. The best known linear code with these parameters (ref. Magma) is not self orthogonal.

Let $\mathcal{R}=\mathbb{F}_{p}+u\mathbb{F}_{p}+u^2\mathbb{F}_{p}+u^3\mathbb{F}_{p}$ with $u^4=u$ be a finite non-chain ring, where $p$ is a prime congruent to $1$ modulo $3$. In this paper we study $(1-2u^3)$-constacyclic codes over the ring $\mathcal{R}$, their equivalence to cyclic codes and find their Gray images. To illustrate this, examples of $(1-2u^3)$-constacyclic codes of lengths $2^m$ for $p=7$ and of lengths $3^m$ for $p=19$ are given. We also discuss quadratic residue codes over the ring $\mathcal{R}$ and their extensions. A Gray map from $\mathcal{R}$ to $\mathbb{F}_{p}^4$ is defined which preserves self duality and gives self-dual and formally self-dual codes over $\mathbb{F}_{p}$ from extended quadratic residue codes.

Let p be a rational prime. Let F be a totally real number field such that F is unramified over p and the residue degree of any prime ideal of F dividing p is 1 or 2. In this paper, we show that the eigenvariety for Res_{F/Q}(GL_2), constructed by Andreatta-Iovita-Pilloni, is proper at integral weights for p>=3. We also prove a weaker result for p=2., Comment: 105 pages

In this paper, the performance of quadratic residue (QR) codes of lengths within 100 is given and analyzed when the hard decoding, soft decoding, and linear programming decoding algorithms are utilized. We develop a simple method to estimate the soft decoding performance, which avoids extensive simulations. Also, a simulation-based algorithm is proposed to obtain the maximum likelihood decoding performance of QR codes of lengths within 100. Moreover, four important theorems are proposed to predict the performance of the hard decoding and the maximum-likelihood decoding in which they can explore some internal properties of QR codes. It is shown that such four theorems can be applied to the QR codes with lengths less than 100 for predicting the decoding performance. In contrast, they can be straightforwardly generalized to longer QR codes. The result is never seen in the literature, to our knowledge. Simulation results show that the estimated hard decoding performance is very accurate in the whole signal-to-noise ratio (SNR) regimes, whereas the derived upper bounds of the maximum likelihood decoding are only tight for moderate to high SNR regions. For each of the considered QR codes, the soft decoding is approximately 1.5 dB better than the hard decoding. By using powerful redundant parity-check cuts, the linear programming-based decoding algorithm, i.e., the ACG-ALP decoding algorithm performs very well for any QR code. Sometimes, it is even superior to the Chase-based soft decoding algorithm significantly, and hence is only a few tenths of dB away from the maximum likelihood decoding., Comment: submitted to IEEE Transactions on Information Theory

In this paper, we introduce a new definitions of the Gray weight and the Gray map for linear codes over $\mathbb{Z}_9+u\mathbb{Z}_9$ with $u^2=u$. Some results on self-dual codes over this ring are investigated. Further, the structural properties of quadratic residue codes are also considered. Two self-dual codes with parameters $[22,11,5]$ and $[24,12,9]$ over $\mathbb{Z}_9$ are obtained., Comment: 12 pages. arXiv admin note: substantial text overlap with arXiv:1402.6771

Quantum synchronizable codes are quantum error-correcting codes designed to correct the effects of both quantum noise and block synchronization errors. While it is known that quantum synchronizable codes can be constructed from cyclic codes that satisfy special properties, only a few classes of cyclic codes have been proved to give promising quantum synchronizable codes. In this paper, using quadratic residue codes and their supercodes, we give a simple construction for quantum synchronizable codes whose synchronization capabilities attain the upper bound. The method is applicable to cyclic codes of prime length.