default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugues Randriambololona
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j12]Hugues Randriam
:
Gaps between prime numbers and tensor rank of multiplication in finite fields. Des. Codes Cryptogr. 87(2-3): 627-645 (2019)- [j11]Minjia Shi, Yan Liu, Hugues Randriam, Lin Sok, Patrick Solé:
Trace codes over Z4, and Boolean functions. Des. Codes Cryptogr. 87(6): 1447-1455 (2019) - 2018
- [j10]Luca De Feo, Hugues Randriambololona, Édouard Rousseau:
Lattices of compatibly embedded finite fields in nemo/flint. ACM Commun. Comput. Algebra 52(2): 38-41 (2018) - 2017
- [j9]Hugues Randriambololona:
On metric convexity, the discrete Hahn-Banach theorem, separating systems and sets of points forming only acute angles. Int. J. Inf. Coding Theory 4(2/3): 159-169 (2017) - 2016
- [j8]Gérard D. Cohen, Sihem Mesnager, Hugues Randriam:
Yet another variation on minimal linear codes. Adv. Math. Commun. 10(1): 53-61 (2016) - 2015
- [j7]Hugues Randriam, Lin Sok, Patrick Solé:
Lower bounds on the minimum distance of long codes in the Lee metric. Des. Codes Cryptogr. 74(2): 441-452 (2015) - [j6]Julia Pieltant, Hugues Randriam:
New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields. Math. Comput. 84(294): 2023-2045 (2015) - 2013
- [j5]Hugues Randriambololona:
Asymptotically Good Binary Linear Codes With Asymptotically Good Self-Intersection Spans. IEEE Trans. Inf. Theory 59(5): 3038-3045 (2013) - [j4]Hugues Randriambololona:
An Upper Bound of Singleton Type for Componentwise Products of Linear Codes. IEEE Trans. Inf. Theory 59(12): 7936-7939 (2013) - 2012
- [j3]Jean-Pierre Flori, Hugues Randriam:
On the Number of Carries Occurring in an Addition Mod 2k-1. Integers 12: A10 (2012) - [j2]Hugues Randriambololona:
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method. J. Complex. 28(4): 489-517 (2012) - 2010
- [j1]Joseph J. Boutros, Hugues Randriambololona:
Le code spatio-temporel d'Aladin-Pythagore. Traitement du Signal 27(2): 147-160 (2010)
Conference and Workshop Papers
- 2022
- [c11]Sarah Bordage, Mathieu Lhotel, Jade Nardi, Hugues Randriam:
Interactive Oracle Proofs of Proximity to Algebraic Geometry Codes. CCC 2022: 30:1-30:45 - 2020
- [c10]Hugues Randriambololona, Édouard Rousseau:
Trisymmetric Multiplication Formulae in Finite Fields. WAIFI 2020: 92-111 - 2019
- [c9]Luca De Feo, Hugues Randriam, Édouard Rousseau:
Standard Lattices of Compatibly Embedded Finite Fields. ISSAC 2019: 122-130 - 2015
- [c8]Hugues Randriambololona:
Linear independence of rank 1 matrices and the dimension of *-products of codes. ISIT 2015: 196-200 - [c7]Gérard D. Cohen, Sihem Mesnager, Hugues Randriam:
Yet another variation on minimal linear codes. ITA 2015: 329-330 - 2010
- [c6]Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi:
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. CRYPTO 2010: 237-254 - [c5]Hugues Randriam:
Hecke operators with odd determinant and binary frameproof codes beyond the probabilistic bound? ITW 2010: 1-5 - [c4]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a Conjecture about Binary Strings Distribution. SETA 2010: 346-358 - 2009
- [c3]Joseph Jean Boutros, Hugues Randriambololona:
The Aladdin-Pythagoras space-time code. ISIT 2009: 2823-2827 - 2008
- [c2]Gérard D. Cohen, Hugues Randriam, Gilles Zémor:
Witness Sets. ICMCTA 2008: 37-45 - 2006
- [c1]Francis N. Castro, Ivelisse Rubio, Hugues Randriam, Oscar Moreno, Harold F. Mattson:
An Elementary Approach to Ax-Katz, McEliece's Divisibility and Applications to Quasi-Perfect Binary 2-Error Correcting Codes. ISIT 2006: 1905-1908
Informal and Other Publications
- 2024
- [i21]Hugues Randriambololona:
The syzygy distinguisher. CoRR abs/2407.15740 (2024) - [i20]Hugues Randriambololona:
The syzygy distinguisher. IACR Cryptol. ePrint Arch. 2024: 1193 (2024) - 2020
- [i19]Alain Couvreur, Hugues Randriambololona:
Algebraic geometry codes and some applications. CoRR abs/2009.01281 (2020) - 2019
- [i18]Régis Blache, Alain Couvreur, Emmanuel Hallouin, David Madore, Jade Nardi, Matthieu Rambaud, Hugues Randriam:
Anticanonical codes from del Pezzo surfaces with Picard rank one. CoRR abs/1903.09397 (2019) - [i17]Luca De Feo, Hugues Randriam, Édouard Rousseau:
Standard Lattices of Compatibly Embedded Finite Fields. CoRR abs/1906.00870 (2019) - [i16]Hugues Randriambololona:
The quadratic hull of a code and the geometric view on multiplication algorithms. CoRR abs/1912.06627 (2019) - 2018
- [i15]Hugues Randriam:
Gaps between prime numbers and tensor rank of multiplication in finite fields. CoRR abs/1801.01055 (2018) - 2017
- [i14]Minjia Shi, Yan Liu, Hugues Randriam, Lin Sok, Patrick Solé:
Trace codes over $\Z_4$ and Boolean function. CoRR abs/1707.00153 (2017) - 2016
- [i13]Hugues Randriambololona:
Harder-Narasimhan theory for linear codes. CoRR abs/1609.00738 (2016) - 2015
- [i12]Hugues Randriambololona:
Linear independence of rank 1 matrices and the dimension of *-products of codes. CoRR abs/1501.05978 (2015) - 2013
- [i11]Hugues Randriam, Lin Sok, Patrick Solé:
Lower bounds on the minimum distance of long codes in the Lee metric. CoRR abs/1302.2246 (2013) - [i10]Hugues Randriambololona:
An upper bound of Singleton type for the componentwise product of two linear codes. CoRR abs/1305.4840 (2013) - [i9]Hugues Randriambololona:
On products and powers of linear codes under componentwise multiplication. CoRR abs/1312.0022 (2013) - 2012
- [i8]Hugues Randriambololona:
Asymptotically good binary linear codes with asymptotically good self-intersection spans. CoRR abs/1204.3057 (2012) - 2011
- [i7]Hugues Randriam:
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 abs/1103.4335 (2011) - [i6]Laurent Decreusefond, Eduardo Ferraz, Hugues Randriam:
Simplicial Homology of Random Configurations. CoRR abs/1103.4457 (2011) - [i5]Hugues Randriambololona:
Bilinear complexity of algebras and the Chudnovsky-Chudnovsky interpolation method. CoRR abs/1107.0336 (2011) - [i4]Jean-Pierre Flori, Hugues Randriam:
On the Number of Carries Occuring in an Addition mod 2k-1. IACR Cryptol. ePrint Arch. 2011: 245 (2011) - 2010
- [i3]Hugues Randriambololona:
(2,1)-separating systems beyond the probabilistic bound. CoRR abs/1010.5764 (2010) - [i2]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a conjecture about binary strings distribution. IACR Cryptol. ePrint Arch. 2010: 170 (2010) - 2009
- [i1]Eric Brier, Jean-Sébastien Coron, Thomas Icart, David Madore, Hugues Randriam, Mehdi Tibouchi:
Efficient Indifferentiable Hashing into Ordinary Elliptic Curves. IACR Cryptol. ePrint Arch. 2009: 340 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-20 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
