Gérard D. Cohen

Hervé Chabanne, Gérard D. Cohen, Alain Patey: Secure network coding and non-malleable codes: Protection against linear tampering. ISIT 2012: 2546-2550

Graham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth: Permutation Capacities and Oriented Infinite Paths. Electronic Notes in Discrete Mathematics 38: 195-199 (2011)

Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten: On Bounded Weight Codes. IEEE Transactions on Information Theory 57(10): 6780-6787 (2011)

Gérard D. Cohen, Emanuela Fachini, János Körner: Skewincidence. IEEE Transactions on Information Theory 57(11): 7313-7316 (2011)

Gérard D. Cohen, Sihem Mesnager: Generalized Witness Sets. CCP 2011: 255-256

Sihem Mesnager, Gérard D. Cohen: On the Link of Some Semi-bent Functions with Kloosterman Sums. IWCC 2011: 263-272

Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen: Binary Kloosterman Sums with Value 4. IMA Int. Conf. 2011: 61-78

Gérard D. Cohen, Carlos Munuera, Patrick Solé: The average radius of codes: Survey and new results. ISIT 2011: 1792-1795

Hervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey: Non-Malleable Codes from the Wire-Tap Channel. CoRR abs/1105.3879 (2011)

Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen: The Value 4 of Binary Kloosterman Sums. IACR Cryptology ePrint Archive 2011: 364 (2011)

Gérard D. Cohen, Jean-Pierre Flori: On a generalized combinatorial conjecture involving addition mod 2^k-1. IACR Cryptology ePrint Archive 2011: 400 (2011)

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: New identifying codes in the binary Hamming space. Eur. J. Comb. 31(2): 491-501 (2010)

Graham Brightwell, Gérard D. Cohen, Emanuela Fachini, Marianne Fairthorne, János Körner, Gábor Simonyi, Ágnes Tóth: Permutation Capacities of Families of Oriented Infinite Paths. SIAM J. Discrete Math. 24(2): 441-456 (2010)

Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten: Heavy weight codes. ISIT 2010: 1120-1124

Bruno Kindarji, Gérard D. Cohen, Hervé Chabanne: On the threshold of Maximum-Distance Separable codes. ISIT 2010: 1163-1167

Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager: On a Conjecture about Binary Strings Distribution. SETA 2010: 346-358

Bruno Kindarji, Gérard D. Cohen, Hervé Chabanne: On the Threshold of Maximum-Distance Separable Codes. CoRR abs/1001.2463 (2010)

Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji: RFID Key Establishment Against Active Adversaries. CoRR abs/1001.4992 (2010)

Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten: On Bounded Weight Codes. CoRR abs/1009.3657 (2010)

Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager: On a conjecture about binary strings distribution. IACR Cryptology ePrint Archive 2010: 170 (2010)

Gérard D. Cohen: Separation and Witnesses. IWCC 2009: 12-21

Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji: Private Interrogation of Devices via Identification Codes. INDOCRYPT 2009: 272-289

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: Discriminating codes in (bipartite) planar graphs. Eur. J. Comb. 29(5): 1353-1364 (2008)

Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor: Theoretical and Practical Boundaries of Binary Secure Sketches. IEEE Transactions on Information Forensics and Security 3(4): 673-683 (2008)

Gérard D. Cohen, Hugues Randriam, Gilles Zémor: Witness Sets. ICMCTA 2008: 37-45

Gérard D. Cohen, Emanuela Fachini, János Körner: On the permutation capacity of digraphs. CoRR abs/0809.1522 (2008)

Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein: Links Between Discriminating and Identifying Codes in the Binary Hamming Space. AAECC 2007: 267-270

Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor: Optimal Iris Fuzzy Sketches. CoRR abs/0705.3740 (2007)

E. Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry: Discriminating codes in bipartite graphs. Electronic Notes in Discrete Mathematics 26: 29-35 (2006)

Hans Georg Schaathun, Gérard D. Cohen: Nested Codes for Constrained Memory and for Dirty Paper. AAECC 2006: 307-316

Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn: Bounds on distance distributions in codes of known size. IEEE Transactions on Information Theory 51(1): 250-258 (2005)

Hans Georg Schaathun, Gérard D. Cohen: A Trellis-Based Bound on (2, 1)-Separating Codes. IMA Int. Conf. 2005: 59-67

Gérard D. Cohen, Alexander Vardy: Duality between Packings and Coverings of the Hamming Space. CoRR abs/cs/0507015 (2005)

Gérard D. Cohen, Hans Georg Schaathun: Upper Bounds on Separating Codes. IEEE Transactions on Information Theory 50(6): 1291-1295 (2004)

Gérard D. Cohen, Hans Georg Schaathun: Separating Codes: Constructions and Bounds. LATIN 2004: 322-328

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun: Intersecting Codes and Separating Codes. Discrete Applied Mathematics 128(1): 75-83 (2003)

Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn: Generalized hashing and parent-identifying codes. J. Comb. Theory, Ser. A 104(1): 207-215 (2003)

Sylvia B. Encheva, Gérard D. Cohen: Copyright Control and Separating Systems. AAECC 2003: 79-86

Sylvia B. Encheva, Gérard D. Cohen: Frameproof codes against limited coalitions of pirates. Theor. Comput. Sci. 273(1-2): 295-304 (2002)

Gérard D. Cohen, Sylvia B. Encheva, Hans Georg Schaathun: More on (2,2)-separating systems. IEEE Transactions on Information Theory 48(9): 2606-2609 (2002)

Sylvia B. Encheva, Gérard D. Cohen: Some new p-ary two-secure frameproof codes. Appl. Math. Lett. 14(2): 177-182 (2001)

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. Electronic Notes in Discrete Mathematics 6: 1-3 (2001)

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn: Intersecting codes and partially identifying codes. Electronic Notes in Discrete Mathematics 6: 211-219 (2001)

Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Binary B₂-Sequences : A New Upper Bound. J. Comb. Theory, Ser. A 94(1): 152-155 (2001)

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. SIAM J. Discrete Math. 14(3): 423-431 (2001)

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: On Codes Identifying Vertices in the Two-Dimensional Square Lattice with Diagonals. IEEE Trans. Computers 50(2): 174-176 (2001)

Sylvia B. Encheva, Gérard D. Cohen: Partially Identifying Codes for Copyright Protection. AAECC 2001: 260-267

Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Binary Codes for Collusion-Secure Fingerprinting. ICISC 2001: 178-185

Sylvia B. Encheva, Gérard D. Cohen: Projective codes which satisfy the chain condition. Appl. Math. Lett. 13(4): 109-113 (2000)

Sylvia B. Encheva, Gérard D. Cohen: Linear Codes and Their Coordinate Ordering. Des. Codes Cryptography 20(3): 229-250 (2000)

Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor: Codes with forbidden distances. Discrete Mathematics 213(1-3): 3-11 (2000)

Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor: A hypergraph approach to digital fingerprinting. Electronic Notes in Discrete Mathematics 5: 67-70 (2000)

Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor: Copyright protection for digital data. IEEE Communications Letters 4(5): 158-160 (2000)

Sylvia B. Encheva, Gérard D. Cohen: On self-dual ternary codes and their coordinate ordering. Inf. Sci. 126(1-4): 277-286 (2000)

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM J. Discrete Math. 13(4): 492-504 (2000)

Sylvia B. Encheva, Gérard D. Cohen: Tracing and Proving Ownership of Digital Objects. ITCC 2000: 184-189

Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor: New Bounds for Codes Identifying Vertices in Graphs. Electr. J. Comb. 6 (1999)

Gérard D. Cohen, Josep Rifà, J. Tena, Gilles Zémor: On the Characterization of Linear Uniquely Decodable Codes. Des. Codes Cryptography 17(1-3): 87-96 (1999)

Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor: Antichain Codes. Des. Codes Cryptography 18(1/3): 71-80 (1999)

Sylvia B. Encheva, Gérard D. Cohen: On Linear Projective Codes Which Satisfy the Chain Condition. Inf. Sci. 118(1-4): 213-222 (1999)

Sylvia B. Encheva, Gérard D. Cohen: Constructions of Intersecting Codes. IEEE Transactions on Information Theory 45(4): 1234-1237 (1999)

Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn: On binary constructions of quantum codes. IEEE Transactions on Information Theory 45(7): 2495-2498 (1999)

Sylvia B. Encheva, Gérard D. Cohen: On the State Complexities of Ternary Codes. AAECC 1999: 454-461

Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor: How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, H. F. Mattson Jr.: Covering Radius 1985-1994. Appl. Algebra Eng. Commun. Comput. 8(3): 173-239 (1997)

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé: Long packing and covering codes. IEEE Transactions on Information Theory 43(5): 1617-1619 (1997)

Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor: Tilings of Binary Spaces. SIAM J. Discrete Math. 9(3): 393-412 (1996)

Gérard D. Cohen, Simon Litsyn, Gilles Zémor: On the traveling salesman problem in binary Hamming spaces. IEEE Transactions on Information Theory 42(4): 1274-1276 (1996)

Gérard D. Cohen, Simon Litsyn, Gilles Zémor: On greedy algorithms in coding theory. IEEE Transactions on Information Theory 42(6): 2053-2057 (1996)

Gilles Zémor, Gérard D. Cohen: The threshold probability of a code. IEEE Transactions on Information Theory 41(2): 469-477 (1995)

Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.: Weighted coverings and packings. IEEE Transactions on Information Theory 41(6): 1856-1867 (1995)

Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger: Variations on Minimal Codewords in Linear Codes. AAECC 1995: 96-105

Gérard D. Cohen, Marc Giusti, Teo Mora (Eds.): Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings. Lecture Notes in Computer Science 948, Springer 1995, isbn 3-540-60114-7

Gérard D. Cohen, Gilles Zémor: Intersecting codes and independent families. IEEE Transactions on Information Theory 40(6): 1872-1881 (1994)

Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Upper bounds on generalized distances. IEEE Transactions on Information Theory 40(6): 2090-2092 (1994)

Gérard D. Cohen, Gilles Zémor: Write-isolated memories (WIMs). Discrete Mathematics 114(1-3): 105-113 (1993)

Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor: Bounds on generalized weights. Algebraic Coding 1993: 270-277

Gérard D. Cohen, Teo Mora, Oscar Moreno (Eds.): Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 10th International Symposium, AAECC-10, San Juan de Puerto Rico, Puerto Rico, May 10-14, 1993, Proceedings. Lecture Notes in Computer Science 673, Springer 1993, isbn 3-540-56686-4

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor (Eds.): Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings. Lecture Notes in Computer Science 781, Springer 1993, isbn 3-540-57843-9

Gilles Zémor, Gérard D. Cohen: Application of Coding Theory to Interconnection Networks. Discrete Applied Mathematics 37/38: 553-562 (1992)

Gérard D. Cohen, Simon Litsyn: On the covering radius of Reed-Muller codes. Discrete Mathematics 106-107: 147-155 (1992)

Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor (Eds.): Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings. Lecture Notes in Computer Science 573, Springer 1992, isbn 3-540-55130-1

Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn: A note on perfect multiple covetings of the Hamming space. IEEE Transactions on Information Theory 37(3): 678-682 (1991)

Gilles Zémor, Gérard D. Cohen: Error-correcting WOM-codes. IEEE Transactions on Information Theory 37(3): 730-734 (1991)

Gérard D. Cohen, Simon Litsyn: DC-constrained error-correcting codes with small running digital sum. IEEE Transactions on Information Theory 37(3): 949-955 (1991)

C. van Eijl, Gérard D. Cohen, Gilles Zémor: Error-Correction for WIMs and WUMs. AAECC 1991: 159-170

Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.: On Perfect Weighted Coverings with Small Radius. Algebraic Coding 1991: 32-41

Gérard D. Cohen, Pascale Charpin (Eds.): EUROCODE '90, International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990, Proceedings. Lecture Notes in Computer Science 514, Springer 1991, isbn 3-540-54303-1

Gérard D. Cohen: Applications of coding theory to communication combinatorial problems. Discrete Mathematics 83(2-3): 237-248 (1990)

Gérard D. Cohen: Covering Radius and Writing on Memories. AAECC 1990: 1-10

Gérard D. Cohen, Luisa Gargano, Ugo Vaccaro: Unidirectional error-detecting codes. EUROCODE 1990: 94-105

Gérard D. Cohen, Gábor Simonyi: Coding for write-unidirectional memories and conflict resolution. Discrete Applied Mathematics 24(1-3): 103-114 (1989)

Gérard D. Cohen, Jacques Wolfmann (Eds.): Coding Theory and Applications, 3rd International Colloquium, Toulon, France, November 2-4, 1988, Proceedings. Lecture Notes in Computer Science 388, Springer 1989, isbn 3-540-51643-3

Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang: Generating codewords in real space: Application to decoding. Coding Theory and Applications 1988: 114-122

Gérard D. Cohen, Philippe Godlewski (Eds.): Coding Theory and Applications, 2nd International Colloquium, Cachan-Paris, France, November 24-26, 1986, Proceedings. Lecture Notes in Computer Science 311, Springer 1988, isbn 3-540-19368-5

Antoine Lobstein, Gérard D. Cohen: Sur La Complexité D'un Problème De Codage. ITA 21(1): 25-32 (1987)

Gérard D. Cohen: Non Linear Covering Codes: A Few Results and Conjectures. AAECC 1987: 225-229

Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane: Further results on the covering radius of codes. IEEE Transactions on Information Theory 32(5): 680-694 (1986)

Gérard D. Cohen, Philippe Godlewski, Frans Merkx: Linear binary code for write-once memories. IEEE Transactions on Information Theory 32(5): 697-700 (1986)

M. Beveraggi, Gérard D. Cohen: On the Density of Best Coverings in Hamming Spaces. Coding Theory and Applications 1986: 39-44

J. Fang, Gérard D. Cohen, Philippe Godlewski, Gerard Battail: On the Inherent Intractability of Soft Decision Decoding of Linear Codes. Coding Theory and Applications 1986: 141-149

Gérard D. Cohen, Abraham Lempel: Linear intersecting codes. Discrete Mathematics 56(1): 35-43 (1985)

Gérard D. Cohen, Peter Frankl: Good coverings of Hamming spaces with spheres. Discrete Mathematics 56(2-3): 125-131 (1985)

Gérard D. Cohen, Mark G. Karpovsky, H. F. Mattson Jr., James R. Schatz: Covering radius - Survey and recent results. IEEE Transactions on Information Theory 31(3): 328-343 (1985)

Philippe Godlewski, Gérard D. Cohen: Some Cryptographic Aspects of Womcodes. CRYPTO 1985: 458-467

Philippe Godlewski, Gérard D. Cohen: Authorized Writing for "Write-Once" Memories. EUROCRYPT 1985: 111-115

Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane: On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89

Gérard D. Cohen: A nonconstructive upper bound on covering radius. IEEE Transactions on Information Theory 29(3): 352-353 (1983)

Ian F. Blake, Gérard D. Cohen, Mikhail Deza: Coding with Permutations. Information and Control 43(1): 1-19 (1979)

Gérard D. Cohen, Philippe Godlewski: Residual error rate of binary linear block codes (Corresp.). IEEE Transactions on Information Theory 22(4): 483-485 (1976)