Jean-Pierre Tillich

Harold Ollivier

IEEE Trans. Inf. Theory, 2009

On Linear Cryptanalysis with Many Linear Approximations.

[BibT_eX]

[DOI]

Benoît Gérard

IACR Cryptol. ePrint Arch., 2009

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

[BibT_eX]

[DOI]

CoRR, 2009

Quantum LDPC codes with positive rate and minimum distance proportional to n<sup>½</sup>.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Christophe Petit

Jean-Jacques Quisquater

Proceedings of the Topics in Cryptology, 2009

2008

On the code reverse engineering problem.

[BibT_eX]

[DOI]

Mathieu Cluzeau

Proceedings of the 2008 IEEE International Symposium on Information Theory, 2008

Collisions for the LPS Expander Graph Hash Function.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2008

2007

On the Minimum Distance of Generalized LDPC Codes.

[BibT_eX]

[DOI]

Ayoub Otmani

Proceedings of the IEEE International Symposium on Information Theory, 2007

A class of quantum LDPC codes: construction and performances under iterative decoding.

[BibT_eX]

[DOI]

Thomas Camara

Harold Ollivier

Proceedings of the IEEE International Symposium on Information Theory, 2007

A family of non-binary TLDPC codes: density evolution, convergence and thresholds.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Spectral estimates for Abelian Cayley graphs.

[BibT_eX]

[DOI]

Joel Friedman

Ram Murty

J. Comb. Theory B, 2006

On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

A new family of codes with high iterative decoding performances.

[BibT_eX]

[DOI]

Jean-Claude Carlach

Proceedings of IEEE International Conference on Communications, 2006

Computing the Algebraic Immunity Efficiently.

[BibT_eX]

[DOI]

Frédéric Didier

Proceedings of the Fast Software Encryption, 13th International Workshop, 2006

2005

Generalized Alon--Boppana Theorems and Error-Correcting Codes.

[BibT_eX]

[DOI]

Joel Friedman

SIAM J. Discret. Math., 2005

Asymptotically good codes with high iterative decoding performances.

[BibT_eX]

[DOI]

Jean-Claude Carlach

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2004

New spectral lower bounds on the bisection width of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Calculus on Graphs

[BibT_eX]

[DOI]

Joel Friedman

CoRR, 2004

The average weight distribution of Tanner code ensembles and a way to modify them to improve their weight distribution.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2001

Automatic Detection of a Watermarked Document Using a Private Key.

[BibT_eX]

[DOI]

Julien P. Stern

Proceedings of the Information Hiding, 4th International Workshop, 2001

Low Complexity Tail-Biting Trellises of Self-dual codes of Length 24, 32 and 40 over GF(2) and Z<sub>4</sub> of Large Minimum Distance.

[BibT_eX]

[DOI]

Proceedings of the Applied Algebra, 2001

2000

Edge isoperimetric inequalities for product graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2000

1999

An Overview of the Isoperimetric Method in Coding Theory.

[BibT_eX]

[DOI]

Proceedings of the Cryptography and Coding, 1999

1998

The action of a few permutations on r-tuples is quickly transitive.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 1998

The Spectrum of de Bruijn and Kautz Graphs.

[BibT_eX]

[DOI]

Charles Delorme

Eur. J. Comb., 1998

On the dual distance and the gap of a binary code.

[BibT_eX]

[DOI]

Patrick Solé

Discret. Math., 1998

1997

Optimal Cycle Codes Constructed From Ramanujan Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

Eigenvalues, eigenspaces and distances to subsets.

[BibT_eX]

[DOI]

Charles Delorme

Discret. Math., 1997

1996

The Action of a Few Random Permutations on r-Tuples and an Application to Cryptography.

[BibT_eX]

[DOI]

Proceedings of the STACS 96, 1996

1995

Block Codes for Dyadic Phase Shift Keying.

[BibT_eX]

[DOI]

Patrick Solé

Proceedings of the Combinatorics and Computer Science, 1995

1994

Hashing with SL_2.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 1994

1993

Group-theoretic hash functions.

[BibT_eX]

[DOI]