Skip to Main content Skip to Navigation

tel-00159149v1  Habilitation à diriger des recherches
Daniel Augot. Décodage des codes algébriques et cryptographie
Génie logiciel [cs.SE]. Université Pierre et Marie Curie - Paris VI, 2007
pastel-00759820v1  Theses
Guillaume Quintin. On the Algorithms of Guruswami-Sudan List Decoding over Finite Rings
Information Theory [cs.IT]. Ecole Polytechnique X, 2012. English
hal-00673938v2  Conference papers
Guillaume Quintin. A Lifting Decoding Scheme and its Application to Interleaved Linear Codes
International Symposium on Information Theory, Jul 2012, Cambridge, United States. pp.96-100, ⟨10.1109/ISIT.2012.6284707⟩
hal-00781310v2  Conference papers
Johan Sebastian Rosenkilde NielsenAlexander Zeh. Multi-Trial Guruswami--Sudan Decoding for Generalised Reed--Solomon Codes
International Workshop on Coding and Cryptography (WCC), Apr 2013, Bergen, Norway
inria-00070346v1  Reports
Pierre Loidreau. An Algebraic Attack against Augot-Finiasz Cryptosystem
[Research Report] RR-5662, INRIA. 2005, pp.13
inria-00073356v1  Reports
J.-P. Zanotti. Codage d'un signal audio-numérique
[Rapport de recherche] RR-3333, INRIA. 1998
hal-00647597v1  Conference papers
Alexander ZehWenhui Li. Decoding Reed-Solomon codes up to the Sudan radius with the Euclidean algorithm
IEEE International Symposium on Information Theory and its Applications (ISITA), Oct 2010, Taichung, Taiwan. pp.986-990, ⟨10.1109/ISITA.2010.5649520⟩
pastel-00866134v1  Theses
Alexander Zeh. Algebraic Soft- and Hard-Decision Decoding of Generalized Reed--Solomon and Cyclic Codes
Computational Complexity [cs.CC]. Ecole Polytechnique X, 2013. English
hal-00670004v2  Journal articles
Guillaume QuintinMorgan BarbierChristophe Chabot. On Generalized Reed-Solomon Codes Over Commutative and Noncommutative Rings
IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2013, 59 (9), pp.5882-5897. ⟨10.1109/TIT.2013.2264797⟩
hal-01959617v1  Conference papers
Alain CouvreurMatthieu LequesneJean-Pierre Tillich. Recovering short secret keys of RLCE encryption scheme in polynomial time
PQCrypto 2019 - International Conference on Post-Quantum Cryptography, May 2019, Chongqing, China. ⟨10.1007/978-3-030-25510-7_8⟩
hal-01104078v1  Conference papers
Alain CouvreurAyoub OtmaniJean-Pierre TillichValérie Gauthier-Umana. A Polynomial-Time Attack on the BBCRS Scheme
Practice and Theory in Public-Key Cryptography - PKC 2015, Mar 2015, Washington, United States
hal-02196650v1  Journal articles
Alain CouvreurIsabella Panaccione. Power Error Locating Pairs
Designs, Codes and Cryptography, Springer Verlag, 2020, 88 (8), pp.1561-1593. ⟨10.1007/s10623-020-00774-3⟩
hal-00703119v1  Conference papers
Leonardo Bautista GomezBogdan NicolaeNaoya MaruyamaFranck CappelloSatoshi Matsuoka. Scalable Reed-Solomon-based Reliable Local Storage for HPC Applications on IaaS Clouds
Euro-Par '12: 18th International Euro-Par Conference on Parallel Processing, Aug 2012, Rhodes, Greece. pp.313-324, ⟨10.1007/978-3-642-32820-6_32⟩
hal-02538535v1  Conference papers
Ulysse CoutaudBernard Tourancheau. Channel Coding for Better QoS in LoRa Networks
2018 14th International Conference on Wireless and Mobile Computing, Networking and Communications (WiMob), Oct 2018, Limassol, Cyprus. ⟨10.1109/WiMOB.2018.8589121⟩
tel-01094212v1  Habilitation à diriger des recherches
Clément Pernet. High Performance and Reliable Algebraic Computing
Symbolic Computation [cs.SC]. Université Joseph Fourier, Grenoble 1, 2014