Hugues Randriambololona

Orcid: 0000-0002-0079-6155

According to our database1, Hugues Randriambololona authored at least 33 papers between 2006 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes.
Proceedings of the 37th Computational Complexity Conference, 2022

2020
Algebraic geometry codes and some applications.
CoRR, 2020

Trisymmetric Multiplication Formulae in Finite Fields.
Proceedings of the Arithmetic of Finite Fields - 8th International Workshop, 2020

2019
Trace codes over Z<sub>4</sub>, and Boolean functions.
Des. Codes Cryptogr., 2019

Gaps between prime numbers and tensor rank of multiplication in finite fields.
Des. Codes Cryptogr., 2019

The quadratic hull of a code and the geometric view on multiplication algorithms.
CoRR, 2019

Anticanonical codes from del Pezzo surfaces with Picard rank one.
CoRR, 2019

Standard Lattices of Compatibly Embedded Finite Fields.
Proceedings of the 2019 on International Symposium on Symbolic and Algebraic Computation, 2019

2018
Lattices of compatibly embedded finite fields in nemo/flint.
ACM Commun. Comput. Algebra, 2018

2017
On metric convexity, the discrete Hahn-Banach theorem, separating systems and sets of points forming only acute angles.
Int. J. Inf. Coding Theory, 2017

Trace codes over $\Z_4$ and Boolean function.
CoRR, 2017

2016
Harder-Narasimhan theory for linear codes.
CoRR, 2016

Yet another variation on minimal linear codes.
Adv. Math. Commun., 2016

2015
New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields.
Math. Comput., 2015

Lower bounds on the minimum distance of long codes in the Lee metric.
Des. Codes Cryptogr., 2015

Linear independence of rank 1 matrices and the dimension of *-products of codes.
Proceedings of the IEEE International Symposium on Information Theory, 2015

2013
An Upper Bound of Singleton Type for Componentwise Products of Linear Codes.
IEEE Trans. Inf. Theory, 2013

Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans.
IEEE Trans. Inf. Theory, 2013

An upper bound of Singleton type for the componentwise product of two linear codes
CoRR, 2013

On products and powers of linear codes under componentwise multiplication.
CoRR, 2013

2012
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method.
J. Complex., 2012

On the Number of Carries Occurring in an Addition Mod 2k-1.
Integers, 2012

2011
On the Number of Carries Occuring in an Addition mod 2<sup>k</sup>-1.
IACR Cryptol. ePrint Arch., 2011

Simplicial Homology of Random Configurations
CoRR, 2011

Diviseurs de la forme 2D-G sans sections et rang de la multiplication dans les corps finis (Divisors of the form 2D-G without sections and bilinear complexity of multiplication in finite fields)
CoRR, 2011

2010
Le code spatio-temporel d'Aladin-Pythagore.
Traitement du Signal, 2010

On a conjecture about binary strings distribution.
IACR Cryptol. ePrint Arch., 2010

(2,1)-separating systems beyond the probabilistic bound
CoRR, 2010

Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound?
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves.
IACR Cryptol. ePrint Arch., 2009

The Aladdin-Pythagoras space-time code.
Proceedings of the IEEE International Symposium on Information Theory, 2009

2008
Witness Sets.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

2006
An Elementary Approach to Ax-Katz, McEliece's Divisibility and Applications to Quasi-Perfect Binary 2-Error Correcting Codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006


  Loading...