Gérard D. Cohen

	2009
85		Gérard D. Cohen: Separation and Witnesses. IWCC 2009: 12-21
	2008
84		Gérard D. Cohen, Hugues Randriam, Gilles Zémor: Witness Sets. ICMCTA 2008: 37-45
83		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)
82		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)
	2007
81		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
80		Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor: Optimal Iris Fuzzy Sketches CoRR abs/0705.3740: (2007)
	2006
79		Hans Georg Schaathun, Gérard D. Cohen: Nested Codes for Constrained Memory and for Dirty Paper. AAECC 2006: 307-316
78		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)
	2005
77		Hans Georg Schaathun, Gérard D. Cohen: A Trellis-Based Bound on (2, 1)-Separating Codes. IMA Int. Conf. 2005: 59-67
76		Gérard D. Cohen, Alexander Vardy: Duality between Packings and Coverings of the Hamming Space CoRR abs/cs/0507015: (2005)
75		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)
	2004
74		Gérard D. Cohen, Hans Georg Schaathun: Separating Codes: Constructions and Bounds. LATIN 2004: 322-328
73		Gérard D. Cohen, Hans Georg Schaathun: Upper Bounds on Separating Codes. IEEE Transactions on Information Theory 50(6): 1291-1295 (2004)
	2003
72		Sylvia B. Encheva, Gérard D. Cohen: Copyright Control and Separating Systems. AAECC 2003: 79-86
71		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)
70		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)
	2002
69		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)
68		Sylvia B. Encheva, Gérard D. Cohen: Frameproof codes against limited coalitions of pirates. Theor. Comput. Sci. 273(1-2): 295-304 (2002)
	2001
67		Sylvia B. Encheva, Gérard D. Cohen: Partially Identifying Codes for Copyright Protection. AAECC 2001: 260-267
66		Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Binary Codes for Collusion-Secure Fingerprinting. ICISC 2001: 178-185
65		Sylvia B. Encheva, Gérard D. Cohen: Some new p-ary two-secure frameproof codes. Appl. Math. Lett. 14(2): 177-182 (2001)
64		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)
63		Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn: Intersecting codes and partially identifying codes. Electronic Notes in Discrete Mathematics 6: 211-219 (2001)
62		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)
61		Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Binary B2-Sequences : A New Upper Bound. J. Comb. Theory, Ser. A 94(1): 152-155 (2001)
60		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)
	2000
59		Sylvia B. Encheva, Gérard D. Cohen: Tracing and Proving Ownership of Digital Objects. ITCC 2000: 184-189
58		Sylvia B. Encheva, Gérard D. Cohen: Linear Codes and Their Coordinate Ordering. Des. Codes Cryptography 20(3): 229-250 (2000)
57		Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor: Codes with forbidden distances. Discrete Mathematics 213(1-3): 3-11 (2000)
56		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)
55		Sylvia B. Encheva, Gérard D. Cohen: On self-dual ternary codes and their coordinate ordering. Inf. Sci. 126(1-4): 277-286 (2000)
54		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)
	1999
53		Sylvia B. Encheva, Gérard D. Cohen: On the State Complexities of Ternary Codes. AAECC 1999: 454-461
52		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)
51		Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor: Antichain Codes. Des. Codes Cryptography 18(1/3): 71-80 (1999)
50		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)
49		Sylvia B. Encheva, Gérard D. Cohen: Constructions of Intersecting Codes. IEEE Transactions on Information Theory 45(4): 1234-1237 (1999)
48		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)
47		Sylvia B. Encheva, Gérard D. Cohen: On Linear Projective Codes Which Satisfy the Chain Condition. Inf. Sci. 118(1-4): 213-222 (1999)
	1998
46		Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor: How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220
	1997
45		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)
44		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)
	1996
43		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)
42		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)
41		Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor: Tilings of Binary Spaces. SIAM J. Discrete Math. 9(3): 393-412 (1996)
	1995
40		Gérard D. Cohen, Marc Giusti, Teo Mora: Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, 11th International Symposium, AAECC-11, Paris, France, July 17-22, 1995, Proceedings Springer 1995
39		Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger: Variations on Minimal Codewords in Linear Codes. AAECC 1995: 96-105
38		Gilles Zémor, Gérard D. Cohen: The threshold probability of a code. IEEE Transactions on Information Theory 41(2): 469-477 (1995)
37		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)
	1994
36		Gérard D. Cohen, Gilles Zémor: Intersecting codes and independent families. IEEE Transactions on Information Theory 40(6): 1872-1881 (1994)
35		Gérard D. Cohen, Simon Litsyn, Gilles Zémor: Upper bounds on generalized distances. IEEE Transactions on Information Theory 40(6): 2090- (1994)
	1993
34		Gérard D. Cohen, Teo Mora, Oscar Moreno: 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 Springer 1993
33		Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor: Algebraic Coding, First French-Israeli Workshop, Paris, France, July 19-21, 1993, Proceedings Springer 1993
32		Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor: Bounds on generalized weights. Algebraic Coding 1993: 270-277
31		Gérard D. Cohen, Gilles Zémor: Write-isolated memories (WIMs). Discrete Mathematics 114(1-3): 105-113 (1993)
	1992
30		Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor: Algebraic Coding, First French-Soviet Workshop, Paris, France, July 22-24, 1991, Proceedings Springer 1992
29		Gilles Zémor, Gérard D. Cohen: Application of Coding Theory to Interconnection Networks. Discrete Applied Mathematics 37/38: 553-562 (1992)
28		Gérard D. Cohen, Simon Litsyn: On the covering radius of Reed-Muller codes. Discrete Mathematics 106-107: 147-155 (1992)
	1991
27		Gérard D. Cohen, Pascale Charpin: EUROCODE '90, International Symposium on Coding Theory and Applications, Udine, Italy, November 5-9, 1990, Proceedings Springer 1991
26		C. van Eijl, Gérard D. Cohen, Gilles Zémor: Error-Correction for WIMs and WUMs. AAECC 1991: 159-170
25		Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.: On Perfect Weighted Coverings with Small Radius. Algebraic Coding 1991: 32-41
24		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- (1991)
23		Gilles Zémor, Gérard D. Cohen: Error-correcting WOM-codes. IEEE Transactions on Information Theory 37(3): 730-734 (1991)
22		Gérard D. Cohen, Simon Litsyn: DC-constrained error-correcting codes with small running digital sum. IEEE Transactions on Information Theory 37(3): 949- (1991)
	1990
21		Gérard D. Cohen: Covering Radius and Writing on Memories. AAECC 1990: 1-10
20		Gérard D. Cohen, Luisa Gargano, Ugo Vaccaro: Unidirectional error-detecting codes. EUROCODE 1990: 94-105
19		Gérard D. Cohen: Applications of coding theory to communication combinatorial problems. Discrete Mathematics 83(2-3): 237-248 (1990)
	1989
18		Gérard D. Cohen, Jacques Wolfmann: Coding Theory and Applications, 3rd International Colloquium, Toulon, France, November 2-4, 1988, Proceedings Springer 1989
17		Gérard D. Cohen, Gábor Simonyi: Coding for write-unidirectional memories and conflict resolution. Discrete Applied Mathematics 24(1-3): 103-114 (1989)
	1988
16		Gérard D. Cohen, Philippe Godlewski: Coding Theory and Applications, 2nd International Colloquium, Cachan-Paris, France, November 24-26, 1986, Proceedings Springer 1988
15		Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang: Generating codewords in real space: Application to decoding. Coding Theory and Applications 1988: 114-122
	1987
14		Gérard D. Cohen: Non Linear Covering Codes: A Few Results and Conjectures. AAECC 1987: 225-229
13		Antoine Lobstein, Gérard D. Cohen: Sur La Complexité D'un Problème De Codage. ITA 21(1): 25-32 (1987)
	1986
12		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
11		M. Beveraggi, Gérard D. Cohen: On the Density of Best Coverings in Hamming Spaces. Coding Theory and Applications 1986: 39-44
10		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)
9		Gérard D. Cohen, Philippe Godlewski, Frans Merkx: Linear binary code for write-once memories. IEEE Transactions on Information Theory 32(5): 697- (1986)
	1985
8		Philippe Godlewski, Gérard D. Cohen: Some Cryptographic Aspects of Womcodes. CRYPTO 1985: 458-467
7		Philippe Godlewski, Gérard D. Cohen: Authorized Writing for "Write-Once" Memories. EUROCRYPT 1985: 111-115
6		Gérard D. Cohen, Abraham Lempel: Linear intersecting codes. Discrete Mathematics 56(1): 35-43 (1985)
5		Gérard D. Cohen, Peter Frankl: Good coverings of Hamming spaces with spheres. Discrete Mathematics 56(2-3): 125-131 (1985)
4		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)
	1984
3		Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane: On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89
	1983
2		Gérard D. Cohen: A nonconstructive upper bound on covering radius. IEEE Transactions on Information Theory 29(3): 352-353 (1983)
	1979
1		Ian F. Blake, Gérard D. Cohen, Mikhail Deza: Coding with Permutations Information and Control 43(1): 1-19 (1979)

Coauthor Index

1	Noga Alon	[70]
2	Alexei E. Ashikhmin	[39] [75]
3	Alexander Barg	[39] [60] [64]
4	Leonid A. Bassalygo	[57]
5	Gerard Battail	[12]
6	M. Beveraggi	[11]
7	Ian F. Blake	[1]
8	Julien Bringer	[80] [82]
9	Hervé Chabanne	[80] [82]
10	E. Charbit	[78]
11	Irène Charon	[78] [81] [83]
12	Pascale Charpin	[27]
13	Mikhail Deza	[1]
14	C. van Eijl	[26]
15	Sylvia B. Encheva	[47] [48] [49] [51] [53] [55] [56] [58] [59] [60] [63] [64] [65] [67] [68] [69] [71] [72]
16	J. Fang	[12]
17	Peter Frankl	[5]
18	Luisa Gargano	[20]
19	Marc Giusti	[40]
20	Philippe Godlewski	[7] [8] [9] [12] [15] [16]
21	Iiro S. Honkala	[37] [44] [50] [54] [62]
22	Olivier Hudry	[78] [81] [83]
23	Tai-Yang Hwang	[15]
24	Gregory A. Kabatiansky	[60] [64]
25	Mark G. Karpovsky	[4]
26	Bruno Kindarji	[80] [82]
27	Michael Krivelevich	[70] [75]
28	Abraham Lempel	[6]
29	Simon Litsyn	[22] [24] [25] [28] [30] [33] [35] [37] [41] [42] [43] [44] [45] [48] [61] [63] [66] [70] [71] [75]
30	Antoine Lobstein	[3] [10] [13] [30] [33] [45] [46] [50] [54] [62] [81] [83]
31	H. F. Mattson Jr.	[4] [25] [37] [45]
32	Frans Merkx	[9]
33	Teo Mora	[34] [40]
34	Oscar Moreno	[34]
35	David Naccache	[46]
36	Hugues Randriam	[84]
37	Josep Rifà (Josep Rifà-Coma)	[52]
38	Llorenç Huguet i Rotger	[32] [39]
39	Hans Georg Schaathun	[69] [71] [73] [74] [77] [79]
40	James R. Schatz	[4]
41	Gábor Simonyi	[17]
42	Neil J. A. Sloane (N. J. A. Sloane)	[3] [10]
43	Patrick Solé	[44]
44	J. Tena	[52]
45	Ugo Vaccaro	[20]
46	Alexander Vardy	[41] [76]
47	Gerhard J. M. van Wee	[24]
48	Jacques Wolfmann	[18]
49	Gilles Zémor	[23] [26] [29] [30] [31] [32] [33] [35] [36] [38] [41] [42] [43] [46] [50] [51] [52] [54] [56] [57] [60] [61] [62] [64] [66] [80] [82] [84]

Colors in the list of coauthors