English
Related papers

Related papers: On a class of twisted elliptic curve codes

200 papers

A two-dimensional grid with dots is called a \emph{configuration with distinct differences} if any two lines which connect two dots are distinct either in their length or in their slope. These configurations are known to have many…

Combinatorics · Mathematics 2009-10-08 Simon R. Blackburn , Tuvi Etzion , Keith M. Martin , Maura B. Paterson

The parameters of a $q$-ary MDS Euclidean self-dual codes are completely determined by its length and the construction of MDS Euclidean self-dual codes with new length has been widely investigated in recent years. In this paper, we give a…

Information Theory · Computer Science 2020-06-02 Weijun Fang , Shu-Tao Xia , Fang-Wei Fu

Let $p$ be a prime and let $q$ be a power of $p$. In this paper, by using generalized Reed-Solomon (GRS for short) codes and extended GRS codes, we construct two new classes of quantum maximum-distance- separable (MDS) codes with parameters…

Information Theory · Computer Science 2018-07-17 Weijun Fang , Fang-Wei Fu

Maximum distance separable (MDS) and near maximum distance separable (NMDS) codes have been widely used in various fields such as communication systems, data storage, and quantum codes due to their algebraic properties and excellent…

Information Theory · Computer Science 2024-12-16 Yujie Zhi , Shixin Zhu

The relation between parity-check matrices of quasi-cyclic (QC) low-density parity-check (LDPC) codes and biadjacency matrices of bipartite graphs supports searching for powerful LDPC block codes. Using the principle of tailbiting, compact…

Information Theory · Computer Science 2011-11-17 Irina E. Bocharova , Florian Hug , Rolf Johannesson , Boris D. Kudryashov , Roman V. Satyukov

In this paper, we introduce the study of minimal torsion curves within a fixed geometric isogeny class. For a $\overline{\mathbb{Q}}$-isogeny class $\mathcal{E}$ of elliptic curves and $N \in \mathbb{Z}^+$, we wish to determine the least…

Number Theory · Mathematics 2026-04-22 Abbey Bourdon , Nina Ryalls , Lori D. Watson

Low-depth parity check (LDPC) codes are a paradigm of error correction that allow for spatially non-local interactions between (qu)bits, while still enforcing that each (qu)bit interacts only with finitely many others. On expander graphs,…

Quantum Physics · Physics 2023-10-25 Tibor Rakovszky , Vedika Khemani

Let $\ell$ and $p \geq 3$ be different primes. Let $E/\mathbb{Q}_\ell$ and $E'/\mathbb{Q}_\ell$ be elliptic curves with isomorphic $p$-torsion. Assume that $E$ has potentially multiplicative reduction. We classify when all…

Number Theory · Mathematics 2025-10-15 Alain Kraus , Nuno Freitas , Ignasi Sánchez-Rodríguez

Consider the elliptic curve $E$ given by the Weierstrass equation $y^2 = x^3 - 11x - 14$, which has complex multiplication by the order of conductor $2$ inside $\mathbb{Z}[i]$. It was recently observed in a paper of Daniels and…

Number Theory · Mathematics 2023-01-05 Nathan Jones

Self-orthogonal codes are a subclass of linear codes that are contained within their dual codes. Since self-orthogonal codes are widely used in quantum codes, lattice theory and linear complementary dual (LCD) codes, they have received…

Information Theory · Computer Science 2024-11-12 Yaozong Zhang , Dabin Zheng , Xiaoqiang Wang

We present a definition of {\em twisted motivic Chern classes} for singular pairs $(X,\Delta)$ consisting of a singular space $X$ and a $\mathbb Q$-Cartier divisor containing the singularities of $X$. The definition is a mixture of the…

Algebraic Geometry · Mathematics 2022-03-31 Jakub Koncki , Andrzej Weber

Let $E:y^2=x^3+ax+b$ be an elliptic curve defined over $\mathbb{Q}$. We compute certain twists of the classical modular curves $X(8)$. Searching for rational points on these twists enables us to find non-trivial pairs of $8$-congruent…

Number Theory · Mathematics 2014-12-23 Zexiang Chen

We study moduli of semistable twisted sheaves on smooth proper morphisms of algebraic spaces. In the case of a relative curve or surface, we prove results on the structure of these spaces. For curves, they are essentially isomorphic to…

Algebraic Geometry · Mathematics 2018-06-18 Max Lieblich

We study earthquake deformations on Teichm\"uller space associated with simple closed curves of the once-punctured torus. We describe two methods to get an explicit form of the earthquake deformation for any simple closed curve. The first…

Geometric Topology · Mathematics 2023-02-28 Grace S. Garden

For a linear code $\cC$ of length $n$ and dimension $k$, Wolf noticed that the trellis state complexity $s(\cC)$ of $\cC$ is upper bounded by $w(\cC):=\min(k,n-k)$. In this paper we point out some new lower bounds for $s(\cC)$. In…

Algebraic Geometry · Mathematics 2007-07-16 Carlos Munuera , Fernando Torres

We investigate two classes of extended codes and provide necessary and sufficient conditions for these codes to be non-GRS MDS codes. We also determine the parity check matrices for these codes. Using the connection of MDS codes with arcs…

Information Theory · Computer Science 2025-06-16 Kanat Abdukhalikov , Cunsheng Ding , Gyanendra K. Verma

Elliptic divisibility sequences (EDSs) are generalizations of a class of integer divisibility sequences called Lucas sequences. There has been much interest in cases where the terms of Lucas sequences are squares or cubes. In this work,…

Number Theory · Mathematics 2011-09-26 Betül Gezer

We investigate the geometry of a twisting non-shearing congruence of null geodesics on a conformal manifold of even dimension greater than four and Lorentzian signature. We give a necessary and sufficient condition on the Weyl tensor for…

Differential Geometry · Mathematics 2021-09-01 Arman Taghavi-Chabert

The matrix representations of linear codes have been well-studied for use as disjunct matrices. However, no connection has previously been made between the properties of disjunct matrices and the parity-check codes obtained from them. This…

Information Theory · Computer Science 2024-07-30 Kathryn Haymaker , Emily McMillon

We present algorithms for computing the squared Weil and Tate pairings on elliptic curves and the squared Tate pairing for hyperelliptic curves. The squared pairings introduced in this paper have the advantage that our algorithms for…

Number Theory · Mathematics 2007-05-23 Kirsten Eisentraeger , Kristin Lauter , Peter L. Montgomery
‹ Prev 1 4 5 6 7 8 10 Next ›