Homepage

Édouard Rousseau. Arithmétique efficace des extensions de corps finis. Number Theory [math.NT]. Institut Polytechnique de Paris, 2021. English. ⟨NNT : 2021IPPAT013⟩. ⟨tel-03299466⟩
Sourour Elloumi, Olivier Hudry, Estel Marie, Agathe Martin, Agnès Plateau, et al.. Optimization of wireless sensor networks deployment with coverage and connectivity constraints. Annals of Operations Research, Springer Verlag, 2021, 298 (1-2), pp.183-206. ⟨10.1007/s10479-018-2943-7⟩. ⟨hal-03189488⟩
David Madore. Exact solutions and analysis of an SIR variant with constant-time recovery. 2020. ⟨hal-02537265⟩
Régis Blache, Alain Couvreur, Emmanuel Hallouin, David Madore, Jade Nardi, et al.. Anticanonical codes from del Pezzo surfaces with Picard rank one. Transactions of the American Mathematical Society, American Mathematical Society, 2020, ⟨10.1090/tran/8119⟩. ⟨hal-02075926⟩
Olivier Hudry, Antoine Lobstein. Some Rainbow Problems in Graphs Have Complexity Equivalent to Satisfiability Problems. International Transactions in Operational Research, Wiley, In press. ⟨hal-02916921⟩
Antoine Lobstein, Olivier Hudry, Irène Charon. Locating-Domination and Identification. T. Haynes, S. Hedetniemi & M. Henning. Topics in Domination in Graphs, pp.251-299, 2020. ⟨hal-02916929⟩
Olivier Hudry, Antoine Lobstein. The Compared Costs of Domination, Location-Domination and Identification. Discussiones Mathematicae Graph Theory, University of Zielona Góra, 2020, 40 (1), pp.127-147. ⟨10.7151/dmgt.2129⟩. ⟨hal-01702966⟩
Wei Cheng, Sylvain Guilley, Claude Carlet, Sihem Mesnager, Jean-Luc Danger. Optimizing Inner Product Masking Scheme by A Coding Theory Approach. IEEE Transactions on Information Forensics and Security, Institute of Electrical and Electronics Engineers, 2020, 16, pp.220-235. ⟨10.1109/TIFS.2020.3009609⟩. ⟨hal-02919657⟩
Luca de Feo, Hugues Randriambololona, Édouard Rousseau. Standard Lattices of Compatibly Embedded Finite Fields. ISSAC 2019, Jul 2019, Beijing, China. ⟨10.1145/3326229.3326251⟩. ⟨hal-02136976⟩
Olivier Hudry, Antoine Lobstein. Complexity of Unique (Optimal) Solutions in Graphs: Vertex Cover and Domination. Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, 2019, 110, pp.217-240. ⟨hal-01613388⟩
Minjia Shi, Yan Liu, Hugues Randriambololona, Lin Sok, Patrick Sole. Trace codes over Z 4 , and Boolean functions. Designs, Codes and Cryptography, Springer Verlag, 2019, 87, pp.1447 - 1455. ⟨10.1007/s10623-018-0542-x⟩. ⟨hal-02411617⟩
Olivier Hudry, Antoine Lobstein. Unique (Optimal) Solutions: Complexity Results for Identifying and Locating-Dominating Codes. Theoretical Computer Science, Elsevier, 2019, 767, pp.83-102. ⟨10.1016/j.tcs.2018.09.034⟩. ⟨hal-01884809⟩
Olivier Hudry, Antoine Lobstein. Some Results About a Conjecture on Identifying Codes in Complete Suns. International Transactions in Operational Research, Wiley, 2019, 26 (2), pp.732-746. ⟨hal-01613344⟩
Hugues Randriambololona. Harder-Narasimhan theory for linear codes (with an appendix on Riemann-Roch theory). J. Pure Appl. Algebra, 2019. ⟨hal-03022588⟩
Olivier Hudry, Antoine Lobstein. On the Complexity of Determining Whether there is a Unique Hamiltonian Cycle or Path. Journal of Combinatorial Mathematics and Combinatorial Computing, Charles Babbage Research Centre, In press. ⟨hal-01680709⟩
Amine Mrabet, Nadia El-Mrabet, Ronan Lashermes, Jean-Baptiste Rigaud, Belgacem Bouallegue, et al.. High-performance Elliptic Curve Cryptography by Using the CIOS Method for Modular Multiplication. CRiSIS 2016, Sep 2016, Roscoff, France. ⟨hal-01383162⟩
Julia Pieltant, Hugues Randriambololona. New uniform and asymptotic upper bounds on the tensor rank of multiplication in extensions of finite fields. Mathematics of Computation, American Mathematical Society, 2015, 84 (294), pp.2023-2045. ⟨10.1090/S0025-5718-2015-02921-4⟩. ⟨hal-00828153⟩
Laurent Decreusefond, Eduardo Ferraz, Hugues Randriambololona, Anaïs Vergne. Simplicial Homology of Random Configurations. Advances in Applied Probability, Applied Probability Trust, 2014, 46 (2), pp.1-23. ⟨hal-00578955v4⟩
Irène Charon, Iiro Honkala, Olivier Hudry, Antoine Lobstein. Minimum Sizes of Identifying Codes in Graphs Differing by One Edge or One Vertex. 2012. ⟨hal-00731811⟩
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein. Maximum Size of a Minimum Watching System and the Graphs Achieving the Bound. 2012. ⟨hal-00680690⟩
Irene Charon, Olivier Hudry, Antoine Lobstein. Taille minimum des codes identifiants dans les graphes différant par un sommet ou une arête. 2011. ⟨hal-00623981⟩
Jean-Pierre Flori, Sihem Mesnager. An efficient characterization of a family of hyperbent functions with multiple trace terms. 2011. ⟨hal-00642289⟩
Jean-Pierre Flori, Sihem Mesnager, Gérard Cohen. The Value $4$ of Binary Kloosterman Sums. 2011. ⟨hal-00642290⟩
Jean-Pierre Flori, Hugues Randriambololona. On the Number of Carries Occuring in an Addition $\mod 2^k-1$. 2011. ⟨hal-00642291⟩
Olivier Hudry, Bernard Monjardet. Consensus theories: an oriented survey. 2010. ⟨halshs-00504974⟩
David Auger, Irène Charon, Olivier Hudry, Antoine Lobstein. Watching systems in graphs: an extension of identifying codes. 2010. ⟨hal-00481469⟩
Laurent Decreusefond, Eduardo Ferraz, Hugues Randriambololona. Poisson point processes applied to sensors networks. Spatial Networks Models for Wirelles Communications, Apr 2010, Cambridge, United Kingdom. ⟨hal-00472487⟩
Jean-Pierre Flori, Hugues Randriambololona, Gérard Cohen, Sihem Mesnager. On a conjecture about binary strings distribution. 2010. ⟨hal-00642292⟩
Gerard Cohen, Hugues Randriambololona, Gilles Zemor. Witness sets. Coding theory and applications, Sep 2008, Spain. pp.37-45. ⟨hal-00358468⟩
I. Charon, G. Cohen, O. Hudry, A. Lobstein. Links between discriminating and identifying codes in the binary Hamming space. Applicable Algebra in Engineering, Communication and Computing, 2007, Bangalore, India. pp.267-270. ⟨hal-00477681⟩

Equipe Mathématiques discrètes, codage et cryptographie collection

Homepage

Latest publications