Filter your results
- 70
- 14
- 1
- 38
- 35
- 6
- 4
- 1
- 1
- 56
- 49
- 16
- 3
- 1
- 5
- 2
- 4
- 4
- 5
- 7
- 4
- 6
- 5
- 10
- 1
- 5
- 4
- 5
- 11
- 4
- 1
- 1
- 84
- 1
- 81
- 19
- 9
- 7
- 6
- 5
- 4
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 85
- 9
- 9
- 9
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
85 Results
|
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent SecurityCT-RSA 2009, Apr 2009, San Francisco, United States. pp.182--194, ⟨10.1007/978-3-642-00862-7_12⟩
Conference papers
hal-00386479v1
|
||
|
On the Hardness of the Decoding and the Minimum Distance Problems for Rank CodesIEEE Transactions on Information Theory, 2016, ⟨10.1109/TIT.2016.2616127⟩
Journal articles
hal-01443111v1
|
||
|
Squares of Random Linear CodesIEEE Transactions on Information Theory, 2015, 61 (3), pp.1159-1173. ⟨10.1109/TIT.2015.2393251⟩
Journal articles
hal-01261390v1
|
||
|
Critical Pairs for the Product Singleton BoundWCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France
Conference papers
hal-01276221v1
|
||
|
Towards local testability for quantum codingQuantum, 2022, 6, pp.661. ⟨10.22331/q-2022-02-24-661⟩
Journal articles
hal-03926985v1
|
||
|
Constructions of Rank Modulation CodesIEEE International Symposium on Information Theory 2011, 2011, Saint-Petersbourg, Russia. pp.869--873, ⟨10.1109/ISIT.2011.6034261⟩
Conference papers
hal-00776308v1
|
||
|
Yahya Ould Hamidoune’s mathematical journey: A critical review of his workEuropean Journal of Combinatorics, 2013, 34 (8), pp.1207-1222. ⟨10.1016/j.ejc.2013.05.005⟩
Journal articles
hal-01079152v1
|
||
|
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane2011
Preprints, Working Papers, ...
hal-00632255v1
|
||
Localisation-Resistant Random Words with Small AlphabetsCombinatorics on Words, pp.193-206, 2019, ⟨10.1007/978-3-030-28796-2_15⟩
Book sections
hal-02480563v1
|
|||
|
Multidimensional reconciliation for continuous-variable quantum key distributionPhysical Review A : Atomic, molecular, and optical physics [1990-2015], 2008, 77 (4), pp.042325. ⟨10.1103/PhysRevA.77.042325⟩
Journal articles
hal-00270517v1
|
||
Hamming Quasi-Cyclic (HQC)2017, https://pqc-hqc.org/
Other publications
hal-01946880v1
|
|||
Upper bounds on the size of grain-correcting codesIEEE International Symposium on Information Theory 2013 (ISIT 2013), 2013, Istanbul, Turkey. pp.136 - 140, ⟨10.1109/ISIT.2013.6620203⟩
Conference papers
hal-00947694v1
|
|||
Durandal: A Rank Metric Based Signature SchemeAdvances in Cryptology - EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19-23, 2019, Proceedings, Part III, 2019, Darmstadt, Germany. pp.728--758, ⟨10.1007/978-3-030-17659-4\_25⟩
Conference papers
hal-02307141v1
|
|||
|
Perfectly Secure Message Transmission in Two RoundsTheory of Cryptography -- 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I, Oct 2016, Beijing, China. pp.286--304
Conference papers
hal-01413463v1
|
||
|
Optimal Iris Fuzzy SketchesBiometrics: Theory, Applications, and Systems, 2007. BTAS 2007. First IEEE International Conference on, Sep 2007, Washington DC, United States. pp.1--6, ⟨10.1109/BTAS.2007.4401904⟩
Conference papers
hal-00270547v1
|
||
|
Optimal Iris Fuzzy SketchesBiometrics: Theory, Applications, and Systems, 2007. BTAS 2007. First IEEE International Conference on, Sep 2007, Washington DC, United States. pp.1--6, ⟨10.1109/BTAS.2007.4401904⟩
Conference papers
hal-00269913v1
|
||
|
Coding Constructions for Efficient Oblivious Transfer From Noisy ChannelsIEEE Transactions on Information Theory, 2022, 68 (4), pp.2719-2734. ⟨10.1109/tit.2022.3143310⟩
Journal articles
hal-03931978v1
|
||
|
Linear-time maximum likelihood decoding of surface codes over the quantum erasure channelPhysical Review Research, 2020, 2 (3), pp.033042. ⟨10.1103/physrevresearch.2.033042⟩
Journal articles
hal-03932022v1
|
||
|
High-Rate Storage Codes on Triangle-Free GraphsIEEE Transactions on Information Theory, 2022, 68 (12), pp.7787-7797. ⟨10.1109/tit.2022.3191309⟩
Journal articles
hal-03931581v1
|
||
|
Preface [Special issue in memory of Yahya Ould Hamidoune]European Journal of Combinatorics, 2013, 34 (8), pp.1205-1206. ⟨10.1016/j.ejc.2013.05.004⟩
Journal articles
hal-01079151v1
|
||
Integer Low-Density Lattices based on Construction AInformation Theory Workshop (ITW) 2012 IEEE, 2012, Lausanne, Switzerland. pp.422--426, ⟨10.1109/ITW.2012.6404707⟩
Conference papers
hal-00781525v1
|
|||
|
Upper bounds on the size of grain-correcting codesIEEE Transactions on Information Theory, 2014, 60 (8), pp.4699--4709. ⟨10.1109/TIT.2014.2329008⟩
Journal articles
hal-01059623v1
|
||
|
Witness setsCoding theory and applications, Sep 2008, Spain. pp.37-45
Conference papers
hal-00358468v1
|
||
|
Bounds for binary codes relative to pseudo-distances of k points2010
Preprints, Working Papers, ...
hal-00456568v1
|
||
|
An analogue of Vosper's Theorem for Extension FieldsMath. Proc. Cambridge Phil. Soc., 2017, ⟨10.1017/S0305004117000044⟩
Journal articles
hal-01455884v1
|
||
|
A Construction of Quantum LDPC Codes from Cayley GraphsIEEE International Symposium on Information Theory 2011, 2011, Saint-Petersbourg, Russia. pp.643--647, ⟨10.1109/ISIT.2011.6034209⟩
Conference papers
hal-00776318v1
|
||
|
Constructions of Rank Modulation CodesIEEE Transactions on Information Theory, 2013, 59 (2), pp.1018--1029. ⟨10.1109/TIT.2012.2221121⟩
Journal articles
hal-01049464v1
|
||
Theoretical and Practical Boundaries of Binary Secure SketchesIEEE Transactions on Information Forensics and Security, 2008, 3 (4), pp.673--683. ⟨10.1109/TIFS.2008.2002937⟩
Journal articles
hal-00346970v1
|
|||
|
Weight distribution and decoding of codes on hypergraphsAdvances in Mathematics of Communications, 2008, 2 (4), pp.433 - 450. ⟨10.3934/amc.2008.2.433⟩
Journal articles
hal-00346971v1
|
||
Codes on hypergraphsIEEE International Symposium on Information Theory 2008, ISIT 2008, Jul 2008, Toronto, Canada. pp.156-160, ⟨10.1109/ISIT.2008.4594967⟩
Conference papers
hal-00311841v1
|