The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Gilles Zémor: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. C. van Eijl, Gérard D. Cohen, Gilles Zémor
    Error-Correction for WIMs and WUMs. [Citation Graph (0, 0)][DBLP]
    AAECC, 1991, pp:159-170 [Conf]
  2. Jean-Pierre Tillich, Gilles Zémor
    Hashing with SL_2. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1994, pp:40-49 [Conf]
  3. Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor
    How to Improve an Exponentiation Black-Box. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1998, pp:211-220 [Conf]
  4. Gilles Zémor
    Hash Functions And Graphs With Large Girths. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1991, pp:508-511 [Conf]
  5. Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor
    Bounds on generalized weights. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:270-277 [Conf]
  6. Jean-Pierre Tillich, Gilles Zémor
    Group-theoretic hash functions. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:90-110 [Conf]
  7. Gilles Zémor
    An Extremal Problem Related to the Covering Radius of Binary Codes. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:42-51 [Conf]
  8. Gilles Zémor
    Threshold effects in codes. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1993, pp:278-286 [Conf]
  9. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Binary Codes for Collusion-Secure Fingerprinting. [Citation Graph (0, 0)][DBLP]
    ICISC, 2001, pp:178-185 [Conf]
  10. Sabine Leveiller, Joseph Boutros, Philippe Guillot, Gilles Zémor
    Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding. [Citation Graph (0, 0)][DBLP]
    ICISC, 2001, pp:50- [Conf]
  11. Sabine Leveiller, Joseph Boutros, Philippe Guillot, Gilles Zémor
    Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2001, pp:402-414 [Conf]
  12. Jean-Pierre Tillich, Gilles Zémor
    An Overview of the Isoperimetric Method in Coding Theory. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 1999, pp:129-134 [Conf]
  13. Sabine Leveiller, Gilles Zémor, Philippe Guillot, Joseph Boutros
    A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function. [Citation Graph (0, 0)][DBLP]
    Selected Areas in Cryptography, 2002, pp:232-249 [Conf]
  14. Gilles Zémor
    An Upper Bound on the Size of the Snake-In-The-Box. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1997, v:17, n:2, pp:287-298 [Journal]
  15. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    New Bounds for Codes Identifying Vertices in Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 1999, v:6, n:, pp:- [Journal]
  16. Alexander Barg, Gilles Zémor
    Distance properties of expander codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  17. Laurent Decreusefond, Gilles Zémor
    On the Error-Correcting Capabilities of Cycle Codes of Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1997, v:6, n:1, pp:27-38 [Journal]
  18. Jean-Pierre Tillich, Gilles Zémor
    Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2000, v:9, n:5, pp:- [Journal]
  19. Gilles Zémor, Gérard D. Cohen
    Application of Coding Theory to Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:37, n:, pp:553-562 [Journal]
  20. Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor
    Antichain Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:18, n:1/3, pp:71-80 [Journal]
  21. Gérard D. Cohen, Josep Rifà, J. Tena, Gilles Zémor
    On the Characterization of Linear Uniquely Decodable Codes. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1999, v:17, n:1-3, pp:87-96 [Journal]
  22. Gilles Zémor
    Hash Functions and Cayley Graphs. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 1994, v:4, n:4, pp:381-394 [Journal]
  23. Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor
    Codes with forbidden distances. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:3-11 [Journal]
  24. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Binary B2-Sequences : A New Upper Bound. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2001, v:94, n:1, pp:152-155 [Journal]
  25. Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Gregory A. Kabatiansky, Gilles Zémor
    A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:14, n:3, pp:423-431 [Journal]
  26. Alexander Barg, Gilles Zémor
    Error Exponents of Expander Codes under Linear-Complexity Decoding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:17, n:3, pp:426-445 [Journal]
  27. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    Bounds for Codes Identifying Vertices in the Hexagonal Grid. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:4, pp:492-504 [Journal]
  28. Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor
    Tilings of Binary Spaces. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1996, v:9, n:3, pp:393-412 [Journal]
  29. Jean-Pierre Tillich, Gilles Zémor
    Optimal Cycle Codes Constructed From Ramanujan Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1997, v:10, n:3, pp:447-459 [Journal]
  30. Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
    On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 2001, v:50, n:2, pp:174-176 [Journal]
  31. Alexander Barg, Gilles Zémor
    Error exponents of expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:6, pp:1725-1729 [Journal]
  32. Alexander Barg, Gilles Zémor
    Concatenated codes: serial and parallel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:5, pp:1625-1634 [Journal]
  33. Alexander Barg, Gilles Zémor
    Distance properties of expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:1, pp:78-90 [Journal]
  34. Joseph Boutros, Gilles Zémor
    On quasi-cyclic interleavers for parallel turbo codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2006, v:52, n:4, pp:1732-1739 [Journal]
  35. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    Upper bounds on generalized distances. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:2090-0 [Journal]
  36. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    On the traveling salesman problem in binary Hamming spaces. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:4, pp:1274-1276 [Journal]
  37. Gérard D. Cohen, Simon Litsyn, Gilles Zémor
    On greedy algorithms in coding theory. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1996, v:42, n:6, pp:2053-2057 [Journal]
  38. Gérard D. Cohen, Gilles Zémor
    Intersecting codes and independent families. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1994, v:40, n:6, pp:1872-1881 [Journal]
  39. Jean-Pierre Tillich, Gilles Zémor
    The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:2, pp:328-331 [Journal]
  40. Gilles Zémor
    On expander codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2001, v:47, n:2, pp:835-837 [Journal]
  41. Gilles Zémor, Gérard D. Cohen
    Error-correcting WOM-codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:730-734 [Journal]
  42. Gilles Zémor, Gérard D. Cohen
    The threshold probability of a code. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:2, pp:469-477 [Journal]
  43. Julien Bringer, Hervé Chabanne, Gerad Cohen, Bruno Kindarji, Gilles Zémor
    Optimal Iris Fuzzy Sketches [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  44. Joseph Boutros, Gilles Zémor
    On quasi-cyclic interleavers for parallel turbo codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  45. Alexander Barg, Gilles Zémor
    Multilevel expander codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  46. Philippe Gaborit, Gilles Zémor
    Asymptotic improvement of the Gilbert-Varshamov bound for linear codes [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  47. Joseph Boutros, Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zémor
    Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  48. Gérard D. Cohen, Gilles Zémor
    Write-isolated memories (WIMs). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:114, n:1-3, pp:105-113 [Journal]
  49. Gilles Zémor
    A generalization to noncommutative groups of a theorem of Mann. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:126, n:1-3, pp:365-372 [Journal]

  50. Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. [Citation Graph (, )][DBLP]


  51. Collisions for the LPS Expander Graph Hash Function. [Citation Graph (, )][DBLP]


  52. Witness Sets. [Citation Graph (, )][DBLP]


  53. On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction. [Citation Graph (, )][DBLP]


  54. On the critical pair theory in abelian groups: Beyond Chowla's Theorem. [Citation Graph (, )][DBLP]


  55. Codes on hypergraphs [Citation Graph (, )][DBLP]


  56. Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2} [Citation Graph (, )][DBLP]


  57. Bounds for binary codes relative to pseudo-distances of k points [Citation Graph (, )][DBLP]


  58. On positive and negative atoms of Cayley digraphs. [Citation Graph (, )][DBLP]


Search in 0.686secs, Finished in 0.691secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002