1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.IT2018
Codes with hierarchical locality from covering maps of curves
Sean Ballentine, Alexander Barg, Serge Vladuts
Locally recoverable (LRC) codes provide ways of recovering erased coordinates of the codeword without having to access each of the remaining coordinates. A subfamily of LRC codes w…
math.NT2017★ 1 cited
Isogenies for point counting on genus two hyperelliptic curves with maximal real multiplication
Sean Ballentine, Aurore Guillevic, Elisa Lorenzo García +4
Schoof's classic algorithm allows point-counting for elliptic curves over finite fields in polynomial time. This algorithm was subsequently improved by Atkin, using factorizations…