Filtrer vos résultats
- 70
- 15
- 1
- 39
- 35
- 6
- 4
- 1
- 1
- 57
- 49
- 16
- 3
- 1
- 6
- 2
- 4
- 4
- 5
- 7
- 5
- 5
- 5
- 10
- 1
- 5
- 4
- 5
- 11
- 4
- 1
- 1
- 85
- 1
- 82
- 19
- 10
- 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
- 86
- 10
- 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
86 résultats
|
Critical pairs for the Product Singleton BoundIEEE Transactions on Information Theory, 2015, 61 (9), pp.4928-4937. ⟨10.1109/TIT.2015.2450207⟩
Article dans une revue
hal-01261399v1
|
||
Revisiting Kneser’s Theorem for Field ExtensionsCombinatorica, 2018, 38 (4), pp.759-777
Article dans une revue
hal-01951358v1
|
|||
Recension de "La déesse des petites victoires" Yannick Grannec (Editions Anne Carrière, 2012)Gazette des Mathématiciens, 2014, pp.113-116
Article dans une revue
hal-01009778v1
|
|||
RankSign : an efficient signature algorithm based on the rank metricPQCrypto 2014, 2014, Waterloo, Canada
Communication dans un congrès
hal-01261425v1
|
|||
LAKE - Low rAnk parity check codes Key Exchange2017, http://nicolas-aragon.fr/lake
Autre publication scientifique
hal-01946967v1
|
|||
|
A construction of quantum LDPC codes from Cayley graphsIEEE Transactions on Information Theory, 2013, 59 (9), pp.6087-6098. ⟨10.1109/TIT.2013.2261116⟩
Article dans une revue
hal-00632257v4
|
||
|
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codesSODA 2023 - ACM-SIAM Symposium on Discrete Algorithms, Jan 2023, Florence, Italy. pp.1216-1244, ⟨10.1137/1.9781611977554.ch45⟩
Communication dans un congrès
hal-04022061v1
|
||
LDA Lattices Without Dithering Achieve Capacity on the Gaussian ChannelIEEE Transactions on Information Theory, 2018, 64 (3), pp.1561-1594
Article dans une revue
hal-01951340v1
|
|||
|
Linear-Time Erasure List-Decoding of Expander CodesIEEE Transactions on Information Theory, 2021, 67 (9), pp.5827 - 5839. ⟨10.1109/TIT.2021.3086805⟩
Article dans une revue
hal-03931983v1
|
||
New results for rank-based cryptographyAFRICACRYPT'2014, 2014, Marrakesh, Morocco. pp.1--12
Communication dans un congrès
hal-01261421v1
|
|||
|
Decodable Quantum LDPC Codes beyond the $\sqrt{n}$ Distance Barrier Using High-Dimensional ExpandersSIAM Journal on Computing, 2022, pp.FOCS20-276-FOCS20-316. ⟨10.1137/20m1383689⟩
Article dans une revue
hal-03931971v1
|
||
Cycle codes of graphs and MDS array codesEurocomb 2009, 2009, Bordeaux, France. pp.95--99
Communication dans un congrès
hal-00776276v1
|
|||
|
Large sets with small doubling modulo p are well covered by an arithmetic progressionAnnales de l'Institut Fourier, 2009, 59 (5), pp.2043--2060
Article dans une revue
hal-00271197v1
|
||
Multidimensional reconciliation for continuous-variable quantum key distributionIEEE International Symposium on Information Theory, 2008. ISIT 2008., Jul 2008, Toronto, Canada. pp.1020-1024, ⟨10.1109/ISIT.2008.4595141⟩
Communication dans un congrès
hal-00316160v1
|
|||
Ouroboros-R2017, https://pqc-ouroborosr.org/
Autre publication scientifique
hal-01946902v1
|
|||
|
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels2007
Pré-publication, Document de travail
hal-00270543v1
|
||
|
Low-density Parity Check Codes for Nonergodic Block-Fading ChannelsIEEE Transactions on Information Theory, 2010, 56, pp.4286-4300. ⟨10.1109/TIT.2010.2053890⟩
Article dans une revue
hal-00776170v1
|
||
Universally Secure Network Coding with FeedbackIEEE International Symposium on Information Theory, ISIT 2016, Barcelona, Spain, July 10-15 2016, IEEE - Institute of Electrical and Electronics Engineers, Jul 2016, Barcelona, Spain. pp.2339--2343
Communication dans un congrès
hal-01413344v1
|
|||
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic planeIEEE Information Theory Workshop, 2010, Dublin, Ireland. pp.1--5, ⟨10.1109/CIG.2010.5592863⟩
Communication dans un congrès
hal-00776284v1
|
|||
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error CorrectionInternational Workshop on Coding and Cryptology, Jun 2009, Zhangjiajie, China. pp.259-273
Communication dans un congrès
hal-00387084v1
|
|||
New results on Construction A lattices based on very sparse parity-check matricesIEEE International Symposium on Information Theory 2013 (ISIT 2013), 2013, Istanbul, Turkey. pp.1675 - 1679, ⟨10.1109/ISIT.2013.6620512⟩
Communication dans un congrès
hal-00947701v1
|
|||
Rank Quasi-Cyclic (RQC)2017, https://pqc-rqc.org/
Autre publication scientifique
hal-01946894v1
|
|||
|
Rank based Cryptography: a credible post-quantum alternative to classical cryptographyNIST 2015: Workshop on Cybersecurity in a Post-Quantum World 2015, Apr 2015, Gaithersburg, United States. pp.1-13
Communication dans un congrès
hal-01354877v1
|
||
Durandal: a rank metric based signature schemeCryptology ePrint Archive, 2018, 2018, pp.1192
Article dans une revue
hal-02307147v1
|
|||
|
On the critical pair theory in abelian groups : Beyond Chowla's TheoremCombinatorica, 2008, 28 (4), pp.441-467. ⟨10.1007/s00493-008-2262-8⟩
Article dans une revue
hal-00181453v1
|
||
|
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⟩
Communication dans un congrès
hal-00386479v1
|
||
|
Squares of Random Linear CodesIEEE Transactions on Information Theory, 2015, 61 (3), pp.1159-1173. ⟨10.1109/TIT.2015.2393251⟩
Article dans une revue
hal-01261390v1
|
||
|
Critical Pairs for the Product Singleton BoundWCC2015 - 9th International Workshop on Coding and Cryptography 2015, Apr 2015, Paris, France
Communication dans un congrès
hal-01276221v1
|
||
|
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane2011
Pré-publication, Document de travail
hal-00632255v1
|
||
|
Constructions of Rank Modulation CodesIEEE International Symposium on Information Theory 2011, 2011, Saint-Petersbourg, Russia. pp.869--873, ⟨10.1109/ISIT.2011.6034261⟩
Communication dans un congrès
hal-00776308v1
|