activity
20102021
most citedOn the Decoding Complexity of Cyclic Codes Up to the BCH Bound

23 citations · 48 across the 16 of their papers we have counts for

collaborators
Showing math.NTShow all

11 papers · 1 filter

math.NT2021

Continued Fractions, Quadratic Fields, and Factoring: Some Computational Aspects

Michele Elia

Legendre discovered that the continued fraction expansion of having odd period leads directly to an explicit representation of as the sum of two squares. In this vein…

math.NT2021

On the Fiber Characters of and related Polynomial Algebras

Michele Elia

Let be a prime, be a positive integer ( , and if ), and be a multiplicative complex character on with order …

math.NT2020

Point-groups over singular cubics

Emanuele Bellini, Nadir Murru, Antonio J. Di Scala +1

In this paper, we highlight that the point group structure of elliptic curves over finite or infinite fields, may be also observed on singular cubics with a quadratic component. St…

math.NT2019★ 4 cited

Continued Fractions and Factoring

Michele Elia

Legendre found that the continued fraction expansion of having odd period leads directly to an explicit representation of as the sum of two squares. Similarly, it is…

math.NT2019

On a problem of Perron

Michele Elia

It is shown that a partition of the set , with , is the separation into squares…

math.NT2016

On the Representation of Primes by Binary Quadratic Forms, and Elliptic Curves

Michele Elia, Federico Pintore

It is shown that, under some mild technical conditions, representations of prime numbers by binary quadratic forms can be computed in polynomial complexity by exploiting Schoof's a…