Gilles Zémor

According to our database1, Gilles Zémor authored at least 108 papers between 1989 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography.
IEEE Trans. Information Theory, 2019

Towards local testability for quantum coding.
CoRR, 2019

Localisation-Resistant Random Words with Small Alphabets.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2018
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel.
IEEE Trans. Information Theory, 2018

Efficient Encryption From Random Quasi-Cyclic Codes.
IEEE Trans. Information Theory, 2018

Durandal: a rank metric based signature scheme.
IACR Cryptology ePrint Archive, 2018

Revisiting Kneser's Theorem for Field Extensions.
Combinatorica, 2018

Geometric shaping: low-density coding of Gaussian-like constellations.
Proceedings of the IEEE Information Theory Workshop, 2018

2017
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel.
CoRR, 2017

Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes.
IEEE Trans. Information Theory, 2016

Perfectly Secure Message Transmission in Two Rounds.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Universally Secure Network Coding with feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2016

2015
Critical Pairs for the Product Singleton Bound.
IEEE Trans. Information Theory, 2015

Squares of Random Linear Codes.
IEEE Trans. Information Theory, 2015

An analogue of Vosper's Theorem for Extension Fields.
CoRR, 2015

Quantum Expander Codes.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength.
IEEE Trans. Information Theory, 2014

Upper Bounds on the Size of Grain-Correcting Codes.
IEEE Trans. Information Theory, 2014

On powers of codes.
IACR Cryptology ePrint Archive, 2014

New Results for Rank-Based Cryptography.
Proceedings of the Progress in Cryptology - AFRICACRYPT 2014, 2014

2013
Constructions of Rank Modulation Codes.
IEEE Trans. Information Theory, 2013

A Construction of Quantum LDPC Codes From Cayley Graphs.
IEEE Trans. Information Theory, 2013

Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel.
Quantum Information & Computation, 2013

RankSign : an efficient signature algorithm based on the rank metric.
IACR Cryptology ePrint Archive, 2013

A structure theorem for small sumsets in nonabelian groups.
Eur. J. Comb., 2013

Yahya Ould Hamidoune's mathematical journey: A critical review of his work.
Eur. J. Comb., 2013

Preface.
Eur. J. Comb., 2013

New results on low-density integer lattices.
Proceedings of the 2013 Information Theory and Applications Workshop, 2013

New results on Construction A lattices based on very sparse parity-check matrices.
Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

High-order Masking by Using Coding Theory and Its Application to AES.
Proceedings of the Cryptography and Coding - 14th IMA International Conference, 2013

2012
Integer low-density lattices based on construction A.
Proceedings of the 2012 IEEE Information Theory Workshop, 2012

2011
Full Cryptanalysis of the Chen Identification Protocol.
Proceedings of the Post-Quantum Cryptography - 4th International Workshop, 2011

List decoding of product codes by the MinSum algorithm.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Parameters of rank modulation codes: Examples.
Proceedings of the 49th Annual Allerton Conference on Communication, 2011

2010
Low-density parity-check codes for nonergodic block-fading channels.
IEEE Trans. Information Theory, 2010

Bounds for binary codes relative to pseudo-distances of k points.
Adv. in Math. of Comm., 2010

Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane.
Proceedings of the 2010 IEEE Information Theory Workshop, 2010

2009
Cycle codes of graphs and MDS array codes.
Electron. Notes Discret. Math., 2009

Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}
CoRR, 2009

Quantum LDPC codes with positive rate and minimum distance proportional to n½.
Proceedings of the IEEE International Symposium on Information Theory, 2009

Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security.
Proceedings of the Topics in Cryptology, 2009

On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction.
Proceedings of the Coding and Cryptology, Second International Workshop, 2009

2008
Asymptotic Improvement of the Gilbert-Varshamov Bound for Linear Codes.
IEEE Trans. Information Theory, 2008

Theoretical and Practical Boundaries of Binary Secure Sketches.
IEEE Trans. Information Forensics and Security, 2008

Codes on hypergraphs
CoRR, 2008

On the critical pair theory in abelian groups: Beyond Chowla's Theorem.
Combinatorica, 2008

Weight distribution and decoding of codes on hypergraphs.
Adv. in Math. of Comm., 2008

Full-diversity product codes for block erasure and block fading channels.
Proceedings of the 2008 IEEE Information Theory Workshop, 2008

Multidimensional reconciliation for continuous-variable quantum key distribution.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Generalized low-density codes with BCH constituents for full-diversity near-outage performance.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Codes on hypergraphs.
Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Witness Sets.
Proceedings of the Coding Theory and Applications, Second International Castle Meeting, 2008

Collisions for the LPS Expander Graph Hash Function.
Proceedings of the Advances in Cryptology, 2008

2007
Optimal Iris Fuzzy Sketches
CoRR, 2007

2006
On quasi-cyclic interleavers for parallel turbo codes.
IEEE Trans. Information Theory, 2006

Distance properties of expander codes.
IEEE Trans. Information Theory, 2006

On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codes.
Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005
Concatenated codes: serial and parallel.
IEEE Trans. Information Theory, 2005

Multilevel expander codes.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004
The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel.
IEEE Trans. Information Theory, 2004

Error Exponents of Expander Codes under Linear-Complexity Decoding.
SIAM J. Discrete Math., 2004

Generalized coset schemes for the wire-tap channel: application to biometrics.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

Interleavers for turbo codes that yield a minimum distance growing with blocklength.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2002
Error exponents of expander codes.
IEEE Trans. Information Theory, 2002

A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function.
Proceedings of the Selected Areas in Cryptography, 2002

2001
On expander codes.
IEEE Trans. Information Theory, 2001

On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals.
IEEE Trans. Computers, 2001

Binary B2-Sequences : A New Upper Bound.
J. Comb. Theory, Ser. A, 2001

Performance Limits of Compound Codes with Symbol-Based Iterative Decoding.
Electron. Notes Discret. Math., 2001

A hypergraph approach to the identifying parent property: the case of multiple parents.
Electron. Notes Discret. Math., 2001

Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding.
Proceedings of the Information Security and Cryptology, 2001

Binary Codes for Collusion-Secure Fingerprinting.
Proceedings of the Information Security and Cryptology, 2001

2000
Bounds for Codes Identifying Vertices in the Hexagonal Grid.
SIAM J. Discrete Math., 2000

Copyright protection for digital data.
IEEE Communications Letters, 2000

A hypergraph approach to digital fingerprinting.
Electron. Notes Discret. Math., 2000

Codes with forbidden distances.
Discret. Math., 2000

Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error.
Combinatorics, Probability & Computing, 2000

1999
On the Characterization of Linear Uniquely Decodable Codes.
Des. Codes Cryptogr., 1999

Antichain Codes.
Des. Codes Cryptogr., 1999

New Bounds for Codes Identifying Vertices in Graphs.
Electr. J. Comb., 1999

An Overview of the Isoperimetric Method in Coding Theory.
Proceedings of the Cryptography and Coding, 1999

On identifying codes.
Proceedings of the Codes and Association Schemes, 1999

1998
How to Improve an Exponentiation Black-Box.
Proceedings of the Advances in Cryptology - EUROCRYPT '98, International Conference on the Theory and Application of Cryptographic Techniques, Espoo, Finland, May 31, 1998

1997
Optimal Cycle Codes Constructed From Ramanujan Graphs.
SIAM J. Discrete Math., 1997

On the Error-Correcting Capabilities of Cycle Codes of Graphs.
Combinatorics, Probability & Computing, 1997

An Upper Bound on the Size of the Snake-In-The-Box.
Combinatorica, 1997

1996
On greedy algorithms in coding theory.
IEEE Trans. Information Theory, 1996

On the traveling salesman problem in binary Hamming spaces.
IEEE Trans. Information Theory, 1996

Tilings of Binary Spaces.
SIAM J. Discrete Math., 1996

1995
The threshold probability of a code.
IEEE Trans. Information Theory, 1995

1994
Intersecting codes and independent families.
IEEE Trans. Information Theory, 1994

Upper bounds on generalized distances.
IEEE Trans. Information Theory, 1994

A generalization to noncommutative groups of a theorem of Mann.
Discret. Math., 1994

Hash Functions and Cayley Graphs.
Des. Codes Cryptogr., 1994

Hashing with SL_2.
Proceedings of the Advances in Cryptology, 1994

1993
Write-isolated memories (WIMs).
Discret. Math., 1993

Threshold effects in codes.
Proceedings of the Algebraic Coding, 1993

Group-theoretic hash functions.
Proceedings of the Algebraic Coding, 1993

Bounds on generalized weights.
Proceedings of the Algebraic Coding, 1993

1992
Subset sums in binary spaces.
Eur. J. Comb., 1992

Application of Coding Theory to Interconnection Networks.
Discret. Appl. Math., 1992

1991
Error-correcting WOM-codes.
IEEE Trans. Information Theory, 1991

An Extremal Problem Related to the Covering Radius of Binary Codes.
Proceedings of the Algebraic Coding, 1991

Hash Functions And Graphs With Large Girths.
Proceedings of the Advances in Cryptology, 1991

Error-Correction for WIMs and WUMs.
Proceedings of the Applied Algebra, 1991

1989
On positive and negative atoms of Cayley digraphs.
Discret. Appl. Math., 1989


  Loading...