The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gérard D. Cohen: [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. Sylvia B. Encheva, Gérard D. Cohen
    Partially Identifying Codes for Copyright Protection. [Citation Graph (0, 0)][DBLP]
    AAECC, 2001, pp:260-267 [Conf]
  3. Sylvia B. Encheva, Gérard D. Cohen
    Copyright Control and Separating Systems. [Citation Graph (0, 0)][DBLP]
    AAECC, 2003, pp:79-86 [Conf]
  4. Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger
    Variations on Minimal Codewords in Linear Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1995, pp:96-105 [Conf]
  5. Gérard D. Cohen
    Non Linear Covering Codes: A Few Results and Conjectures. [Citation Graph (0, 0)][DBLP]
    AAECC, 1987, pp:225-229 [Conf]
  6. Gérard D. Cohen
    Covering Radius and Writing on Memories. [Citation Graph (0, 0)][DBLP]
    AAECC, 1990, pp:1-10 [Conf]
  7. Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
    On a conjecture concerning coverings of Hamming space. [Citation Graph (0, 0)][DBLP]
    AAECC, 1984, pp:79-89 [Conf]
  8. Sylvia B. Encheva, Gérard D. Cohen
    On the State Complexities of Ternary Codes. [Citation Graph (0, 0)][DBLP]
    AAECC, 1999, pp:454-461 [Conf]
  9. Hans Georg Schaathun, Gérard D. Cohen
    Nested Codes for Constrained Memory and for Dirty Paper. [Citation Graph (0, 0)][DBLP]
    AAECC, 2006, pp:307-316 [Conf]
  10. M. Beveraggi, Gérard D. Cohen
    On the Density of Best Coverings in Hamming Spaces. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:39-44 [Conf]
  11. Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang
    Generating codewords in real space: Application to decoding. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1988, pp:114-122 [Conf]
  12. J. Fang, Gérard D. Cohen, Philippe Godlewski, Gerard Battail
    On the Inherent Intractability of Soft Decision Decoding of Linear Codes. [Citation Graph (0, 0)][DBLP]
    Coding Theory and Applications, 1986, pp:141-149 [Conf]
  13. Philippe Godlewski, Gérard D. Cohen
    Some Cryptographic Aspects of Womcodes. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:458-467 [Conf]
  14. Gérard D. Cohen, Luisa Gargano, Ugo Vaccaro
    Unidirectional error-detecting codes. [Citation Graph (0, 0)][DBLP]
    EUROCODE, 1990, pp:94-105 [Conf]
  15. 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]
  16. Philippe Godlewski, Gérard D. Cohen
    Authorized Writing for "Write-Once" Memories. [Citation Graph (0, 0)][DBLP]
    EUROCRYPT, 1985, pp:111-115 [Conf]
  17. Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.
    On Perfect Weighted Coverings with Small Radius. [Citation Graph (0, 0)][DBLP]
    Algebraic Coding, 1991, pp:32-41 [Conf]
  18. 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]
  19. 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]
  20. Hans Georg Schaathun, Gérard D. Cohen
    A Trellis-Based Bound on (2, 1)-Separating Codes. [Citation Graph (0, 0)][DBLP]
    IMA Int. Conf., 2005, pp:59-67 [Conf]
  21. Sylvia B. Encheva, Gérard D. Cohen
    Tracing and Proving Ownership of Digital Objects. [Citation Graph (0, 0)][DBLP]
    ITCC, 2000, pp:184-189 [Conf]
  22. Gérard D. Cohen, Hans Georg Schaathun
    Separating Codes: Constructions and Bounds. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:322-328 [Conf]
  23. Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.
    Covering Radius 1985-1994. [Citation Graph (0, 0)][DBLP]
    Appl. Algebra Eng. Commun. Comput., 1997, v:8, n:3, pp:173-239 [Journal]
  24. Sylvia B. Encheva, Gérard D. Cohen
    Some new p-ary two-secure frameproof codes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2001, v:14, n:2, pp:177-182 [Journal]
  25. 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]
  26. Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun
    Intersecting Codes and Separating Codes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:128, n:1, pp:75-83 [Journal]
  27. 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]
  28. 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]
  29. 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]
  30. Sylvia B. Encheva, Gérard D. Cohen
    Linear Codes and Their Coordinate Ordering. [Citation Graph (0, 0)][DBLP]
    Des. Codes Cryptography, 2000, v:20, n:3, pp:229-250 [Journal]
  31. 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]
  32. Ian F. Blake, Gérard D. Cohen, Mikhail Deza
    Coding with Permutations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1979, v:43, n:1, pp:1-19 [Journal]
  33. Sylvia B. Encheva, Gérard D. Cohen
    On self-dual ternary codes and their coordinate ordering. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 2000, v:126, n:1-4, pp:277-286 [Journal]
  34. Sylvia B. Encheva, Gérard D. Cohen
    On Linear Projective Codes Which Satisfy the Chain Condition. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1999, v:118, n:1-4, pp:213-222 [Journal]
  35. Antoine Lobstein, Gérard D. Cohen
    Sur La Complexité D'un Problème De Codage. [Citation Graph (0, 0)][DBLP]
    ITA, 1987, v:21, n:1, pp:25-32 [Journal]
  36. Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Generalized hashing and parent-identifying codes. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2003, v:104, n:1, pp:207-215 [Journal]
  37. 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]
  38. 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]
  39. 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]
  40. 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]
  41. 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]
  42. Sylvia B. Encheva, Gérard D. Cohen
    Frameproof codes against limited coalitions of pirates. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:273, n:1-2, pp:295-304 [Journal]
  43. Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn
    Bounds on distance distributions in codes of known size. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2005, v:51, n:1, pp:250-258 [Journal]
  44. Gérard D. Cohen
    A nonconstructive upper bound on covering radius. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1983, v:29, n:3, pp:352-353 [Journal]
  45. Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn
    On binary constructions of quantum codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:7, pp:2495-2498 [Journal]
  46. Gérard D. Cohen, Sylvia B. Encheva, Hans Georg Schaathun
    More on (2,2)-separating systems. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2002, v:48, n:9, pp:2606-2609 [Journal]
  47. Gérard D. Cohen, Philippe Godlewski, Frans Merkx
    Linear binary code for write-once memories. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:697-0 [Journal]
  48. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.
    Weighted coverings and packings. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1995, v:41, n:6, pp:1856-1867 [Journal]
  49. Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé
    Long packing and covering codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1997, v:43, n:5, pp:1617-1619 [Journal]
  50. Gérard D. Cohen, Mark G. Karpovsky, H. F. Mattson Jr., James R. Schatz
    Covering radius - Survey and recent results. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1985, v:31, n:3, pp:328-343 [Journal]
  51. Gérard D. Cohen, Simon Litsyn
    DC-constrained error-correcting codes with small running digital sum. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:949-0 [Journal]
  52. Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane
    Further results on the covering radius of codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1986, v:32, n:5, pp:680-694 [Journal]
  53. 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]
  54. 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]
  55. 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]
  56. Gérard D. Cohen, Hans Georg Schaathun
    Upper Bounds on Separating Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 2004, v:50, n:6, pp:1291-1295 [Journal]
  57. 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]
  58. Sylvia B. Encheva, Gérard D. Cohen
    Constructions of Intersecting Codes. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1999, v:45, n:4, pp:1234-1237 [Journal]
  59. Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn
    A note on perfect multiple covetings of the Hamming space. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1991, v:37, n:3, pp:678-0 [Journal]
  60. 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]
  61. 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]
  62. 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]
  63. Gérard D. Cohen, Peter Frankl
    Good coverings of Hamming spaces with spheres. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:2-3, pp:125-131 [Journal]
  64. Gérard D. Cohen, Abraham Lempel
    Linear intersecting codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:56, n:1, pp:35-43 [Journal]
  65. Gérard D. Cohen
    Applications of coding theory to communication combinatorial problems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:83, n:2-3, pp:237-248 [Journal]
  66. Gérard D. Cohen, Simon Litsyn
    On the covering radius of Reed-Muller codes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:106, n:, pp:147-155 [Journal]
  67. 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]

  68. Links Between Discriminating and Identifying Codes in the Binary Hamming Space. [Citation Graph (, )][DBLP]


  69. Private Interrogation of Devices via Identification Codes. [Citation Graph (, )][DBLP]


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


  71. Separation and Witnesses. [Citation Graph (, )][DBLP]


  72. Duality between Packings and Coverings of the Hamming Space [Citation Graph (, )][DBLP]


  73. On the permutation capacity of digraphs [Citation Graph (, )][DBLP]


  74. On the Threshold of Maximum-Distance Separable Codes [Citation Graph (, )][DBLP]


  75. RFID Key Establishment Against Active Adversaries [Citation Graph (, )][DBLP]


  76. Coding for write-unidirectional memories and conflict resolution. [Citation Graph (, )][DBLP]


  77. Discriminating codes in (bipartite) planar graphs. [Citation Graph (, )][DBLP]


  78. New identifying codes in the binary Hamming space. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.012secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002