On Deep Holes of Elliptic Curve Codes

07/26/2022
by   Jun Zhang, et al.
0

We give a method to construct deep holes for elliptic curve codes. For long elliptic curve codes, we conjecture that our construction is complete in the sense that it gives all deep holes. Some evidence and heuristics on the completeness are provided via the connection with problems and results in finite geometry.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/11/2022

New Non-Equivalent (Self-Dual) MDS Codes From Elliptic Curves

It is well known that MDS codes can be constructed as algebraic geometri...
research
12/22/2022

ECM And The Elliott-Halberstam Conjecture For Quadratic Fields

The complexity of the elliptic curve method of factorization (ECM) is pr...
research
04/16/2018

The Subfield Codes of Ovoid Codes

Ovoids in (3, (q)) have been an interesting topic in coding theory, comb...
research
09/15/2021

The Elliptic Net Algorithm Revisited

Pairings have been widely used since their introduction to cryptography....
research
08/20/2020

A Special Conic Associated with the Reuleaux Negative Pedal Curve

The Negative Pedal Curve of the Reuleaux Triangle w.r. to a point M on i...
research
06/26/2018

Elfun18 A collection of Matlab functions for the computation of Elliptical Integrals and Jacobian elliptic functions of real arguments

In the article we outline the set of Matlab functions that enable the co...

Please sign up or login with your details

Forgot password? Click here to reset