Related papers: Lattices from elliptic curves over finite fields

A Lattice is a partially ordered set where both least upper bound and greatest lower bound of any pair of elements are unique and exist within the set. K\"{o}tter and Kschischang proved that codes in the linear lattice can be used for error…

We study genus one curves that arise as 2-, 3- and 4-coverings of elliptic curves. We describe efficient algorithms for testing local solubility and modify the classical formulae for the covering maps so that they work in all…

This article is a short introduction to the theory of the groups of points of elliptic curves over finite fields. It is concerned with the elementary theory and practice of elliptic curves cryptography, the new generation of public key…

We prove quantitative upper bounds for the number of quadratic twists of a given elliptic curve $E/\Fp_q(C)$ over a function field over a finite field that have rank $\geq 2$, and for their average rank. The main tools are constructions and…

Given a pair of elliptic curves $E_1,E_2$ over a field $k$, we have a natural map $\text{CH}^1(E_1)_0\otimes\text{CH}^1(E_2)_0\to\text{CH}^2(E_1\times E_2)$, and a conjecture due to Beilinson predicts that the image of this map is finite…

We construct pairs of elliptic curves over number fields with large intersection of projective torsion points.

The well-known analogies between number fields and function fields have led to the transposition of many problems from one domain to the other. In this paper, we will discuss traffic of this sort, in both directions, in the theory of…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

In this paper, we construct four families of linear codes over finite fields from the complements of either the union of subfields or the union of cosets of a subfield, which can produce infinite families of optimal linear codes, including…

We study the collection of points on the modular surface obtained from the logarithm embeddings of the groups of units in totally real cubic number fields. We conjecture that this set is dense and show that its closure contains countably…

For a large class of isotrivial rational elliptic surfaces (with section), we show that the set of rational points is dense for the Zariski topology, by carefully studying variations of root numbers among the fibers of these surfaces. We…

We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…

In this article, we will show the existence of lattice packings in a sparse family of dimensions. This construction will be a generalisation of Venkatesh's lattice packing result. In our construction, we replace the appearance of the…

We describe the digraphs that are dual representations of finite lattices satisfying conditions related to meet-distributivity and modularity. This is done using the dual digraph representation of finite lattices by Craig, Gouveia and…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

It is well-known that if $E$ is an elliptic curve over the finite field $\mathbb{F}_p$, then $E(\mathbb{F}_p)\simeq\mathbb{Z}/m\mathbb{Z}\times\mathbb{Z}/mk\mathbb{Z}$ for some positive integers $m, k$. Let $S(M,K)$ denote the set of pairs…

We study ideal lattices in $\mathbb{R}^2$ coming from real quadratic fields, and give an explicit method for computing all well-rounded twists of any such ideal lattice. We apply this to ideal lattices coming from Markoff numbers to…

This article introduces and studies the tight approximation property, a property of algebraic varieties defined over the function field of a complex or real curve that refines the weak approximation property (and the known cohomological…

The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…

This work investigates linear precoding over non-singular linear channels with additive white Gaussian noise, with lattice-type inputs. The aim is to maximize the minimum distance of the received lattice points, where the precoder is…