![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Gérard D. Cohen
Person information
- affiliation: Telecom-Paris, France
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j77]Minjia Shi
, Hongwei Zhu
, Patrick Solé, Gérard D. Cohen:
How many weights can a linear code have? Des. Codes Cryptogr. 87(1): 87-95 (2019) - [j76]Sihem Mesnager, Ferruh Özbudak
, Ahmet Sinak
, Gérard D. Cohen:
On q-ary plateaued functions over Fq and their explicit characterizations. Eur. J. Comb. 80: 71-81 (2019) - [j75]Gérard D. Cohen, Emanuela Fachini, János Körner:
Interlocked Permutations. SIAM J. Discret. Math. 33(3): 1662-1668 (2019) - 2018
- [i14]Minjia Shi, Hongwei Zhu, Patrick Solé, Gérard D. Cohen:
How many weights can a linear code have? CoRR abs/1802.00148 (2018) - [i13]Gérard D. Cohen, Ludo Tolhuizen:
Maximum weight spectrum codes with reduced length. CoRR abs/1806.05427 (2018) - 2017
- [j74]Sihem Mesnager, Gérard D. Cohen:
Fast algebraic immunity of Boolean functions. Adv. Math. Commun. 11(2): 373-377 (2017) - [j73]Jean-Pierre Flori, Gérard D. Cohen:
On a generalised combinatorial conjecture involving addition mod 2k - 1. Int. J. Inf. Coding Theory 4(2/3): 107-115 (2017) - [j72]Gérard D. Cohen, Emanuela Fachini, János Körner:
Path Separation by Short Cycles. J. Graph Theory 85(1): 107-114 (2017) - 2016
- [j71]Gérard D. Cohen, Sihem Mesnager, Hugues Randriam:
Yet another variation on minimal linear codes. Adv. Math. Commun. 10(1): 53-61 (2016) - [j70]Gérard D. Cohen, Emanuela Fachini, János Körner
:
Zero-Error Capacity of Binary Channels With Memory. IEEE Trans. Inf. Theory 62(1): 3-7 (2016) - 2015
- [c50]Sihem Mesnager, Gérard D. Cohen, David Madore:
On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions. IMACC 2015: 3-19 - [c49]Gérard D. Cohen, Sihem Mesnager, Hugues Randriam:
Yet another variation on minimal linear codes. ITA 2015: 329-330 - [c48]Sihem Mesnager, Gérard D. Cohen:
Cyclic codes and algebraic immunity of Boolean functions. ITW 2015: 1-5 - 2014
- [j69]David Auger, Gérard D. Cohen, Sihem Mesnager:
Sphere coverings and identifying codes. Des. Codes Cryptogr. 70(1-2): 3-7 (2014) - [j68]Gérard D. Cohen, Emanuela Fachini, János Körner:
Connector Families of Graphs. Graphs Comb. 30(6): 1417-1425 (2014) - [c47]Gérard D. Cohen, Sihem Mesnager:
Variations on Minimal Linear Codes. ICMCTA 2014: 125-131 - [i12]Gérard D. Cohen, Emanuela Fachini, János Körner:
Zero-error capacity of binary channels with memory. CoRR abs/1402.0349 (2014) - 2013
- [j67]Gérard D. Cohen, Claudia Malvenuto:
Cyclic colliding permutations. Electron. Notes Discret. Math. 40: 223-227 (2013) - [j66]Gérard D. Cohen, Emanuela Fachini, János Körner:
More on Connector Families. Electron. Notes Discret. Math. 44: 23-29 (2013) - [c46]Gérard D. Cohen, Sihem Mesnager:
On constructions of semi-bent functions from bent functions. Discrete Geometry and Algebraic Combinatorics 2013 - [c45]Hervé Chabanne
, Gérard D. Cohen, Alain Patey:
Towards Secure Two-Party Computation from the Wire-Tap Channel. ICISC 2013: 34-46 - [c44]Gérard D. Cohen, Sihem Mesnager, Alain Patey:
On Minimal and Quasi-minimal Linear Codes. IMACC 2013: 85-98 - [c43]Hervé Chabanne, Gérard D. Cohen, Alain Patey:
Public-key Cryptography from Different Assumptions - A Multi-bit Version. SECRYPT 2013: 561-567 - [i11]Hervé Chabanne, Gérard D. Cohen, Alain Patey:
Towards Secure Two-Party Computation from the Wire-Tap Channel. CoRR abs/1306.6265 (2013) - 2012
- [c42]Hervé Chabanne
, Gérard D. Cohen, Alain Patey:
Secure network coding and non-malleable codes: Protection against linear tampering. ISIT 2012: 2546-2550 - 2011
- [j65]Graham R. 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. Electron. Notes Discret. Math. 38: 195-199 (2011) - [j64]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. IEEE Trans. Inf. Theory 57(10): 6780-6787 (2011) - [j63]Gérard D. Cohen, Emanuela Fachini, János Körner:
Skewincidence. IEEE Trans. Inf. Theory 57(11): 7313-7316 (2011) - [c41]Gérard D. Cohen, Sihem Mesnager:
Generalized Witness Sets. CCP 2011: 255-256 - [c40]Sihem Mesnager, Gérard D. Cohen:
On the Link of Some Semi-bent Functions with Kloosterman Sums. IWCC 2011: 263-272 - [c39]Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen:
Binary Kloosterman Sums with Value 4. IMACC 2011: 61-78 - [c38]Gérard D. Cohen, Carlos Munuera
, Patrick Solé:
The average radius of codes: Survey and new results. ISIT 2011: 1792-1795 - [c37]Hervé Chabanne, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey:
Non-malleable codes from the wire-tap channel. ITW 2011: 55-59 - [i10]Hervé Chabanne
, Gérard D. Cohen, Jean-Pierre Flori, Alain Patey:
Non-Malleable Codes from the Wire-Tap Channel. CoRR abs/1105.3879 (2011) - [i9]Jean-Pierre Flori, Sihem Mesnager, Gérard D. Cohen:
The Value 4 of Binary Kloosterman Sums. IACR Cryptol. ePrint Arch. 2011: 364 (2011) - [i8]Gérard D. Cohen, Jean-Pierre Flori:
On a generalized combinatorial conjecture involving addition mod 2k-1. IACR Cryptol. ePrint Arch. 2011: 400 (2011) - 2010
- [j62]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) - [j61]Graham R. 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. Discret. Math. 24(2): 441-456 (2010) - [c36]Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
Heavy weight codes. ISIT 2010: 1120-1124 - [c35]Bruno Kindarji, Gérard D. Cohen, Hervé Chabanne:
On the threshold of Maximum-Distance Separable codes. ISIT 2010: 1163-1167 - [c34]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
Identification codes in cryptographic protocols. ITW 2010: 1-5 - [c33]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a Conjecture about Binary Strings Distribution. SETA 2010: 346-358 - [i7]Bruno Kindarji, Gérard D. Cohen, Hervé Chabanne:
On the Threshold of Maximum-Distance Separable Codes. CoRR abs/1001.2463 (2010) - [i6]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
RFID Key Establishment Against Active Adversaries. CoRR abs/1001.4992 (2010) - [i5]Christine Bachoc, Venkat Chandar, Gérard D. Cohen, Patrick Solé, Aslan Tchamkerten:
On Bounded Weight Codes. CoRR abs/1009.3657 (2010) - [i4]Jean-Pierre Flori, Hugues Randriam, Gérard D. Cohen, Sihem Mesnager:
On a conjecture about binary strings distribution. IACR Cryptol. ePrint Arch. 2010: 170 (2010)
2000 – 2009
- 2009
- [c32]Gérard D. Cohen:
Separation and Witnesses. IWCC 2009: 12-21 - [c31]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
Private Interrogation of Devices via Identification Codes. INDOCRYPT 2009: 272-289 - [c30]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji:
RFID key establishment against active adversaries. WIFS 2009: 186-190 - 2008
- [j60]Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry, Antoine Lobstein:
Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. Adv. Math. Commun. 2(4): 403-420 (2008) - [j59]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) - [j58]Julien Bringer, Hervé Chabanne
, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor
:
Theoretical and Practical Boundaries of Binary Secure Sketches. IEEE Trans. Inf. Forensics Secur. 3(4): 673-683 (2008) - [c29]Gérard D. Cohen, Hugues Randriam, Gilles Zémor
:
Witness Sets. ICMCTA 2008: 37-45 - [c28]Joseph Jean Boutros, Emanuele Viterbo
, Gérard D. Cohen:
Convolutional Tanner structures for non-ergodic wireless channels. ISIT 2008: 1163-1167 - [i3]Gérard D. Cohen, Emanuela Fachini, János Körner:
On the permutation capacity of digraphs. CoRR abs/0809.1522 (2008) - 2007
- [j57]Gérard D. Cohen, Alexander Vardy:
Duality between packings and coverings of the Hamming space. Adv. Math. Commun. 1(1): 93-97 (2007) - [c27]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 - [i2]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor:
Optimal Iris Fuzzy Sketches. CoRR abs/0705.3740 (2007) - 2006
- [j56]Emmanuel Charbit, Irène Charon, Gérard D. Cohen, Olivier Hudry:
Discriminating codes in bipartite graphs. Electron. Notes Discret. Math. 26: 29-35 (2006) - [c26]Hans Georg Schaathun, Gérard D. Cohen:
Nested Codes for Constrained Memory and for Dirty Paper. AAECC 2006: 307-316 - 2005
- [b1]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Antoine Lobstein:
Covering Codes. North-Holland mathematical library 54, North-Holland 2005, ISBN 978-0-444-82511-7, pp. I-XXI, 1-542 - [j55]Alexei E. Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. IEEE Trans. Inf. Theory 51(1): 250-258 (2005) - [c25]Hans Georg Schaathun, Gérard D. Cohen:
A Trellis-Based Bound on (2, 1)-Separating Codes. IMACC 2005: 59-67 - [c24]Gérard D. Cohen, Alexander Vardy
:
Duality between packings and coverings of the Hamming space. ITW 2005: 26-28 - [i1]Gérard D. Cohen, Alexander Vardy:
Duality between Packings and Coverings of the Hamming Space. CoRR abs/cs/0507015 (2005) - 2004
- [j54]Gérard D. Cohen, Hans Georg Schaathun:
Upper Bounds on Separating Codes. IEEE Trans. Inf. Theory 50(6): 1291-1295 (2004) - [c23]Alexei Ashikhmin, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Bounds on distance distributions in codes of known size. ISIT 2004: 486 - [c22]Gérard D. Cohen, Hans Georg Schaathun:
Separating Codes: Constructions and Bounds. LATIN 2004: 322-328 - 2003
- [j53]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Intersecting Codes and Separating Codes. Discret. Appl. Math. 128(1): 75-83 (2003) - [j52]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn, Hans Georg Schaathun:
Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. Discret. Appl. Math. 131(3): 689-690 (2003) - [j51]Noga Alon, Gérard D. Cohen, Michael Krivelevich, Simon Litsyn:
Generalized hashing and parent-identifying codes. J. Comb. Theory A 104(1): 207-215 (2003) - [j50]G. Miller, Gérard D. Cohen:
The rate of regular LDPC codes. IEEE Trans. Inf. Theory 49(11): 2989-2992 (2003) - [c21]Sylvia B. Encheva, Gérard D. Cohen:
Copyright Control and Separating Systems. AAECC 2003: 79-86 - 2002
- [j49]Sylvia B. Encheva, Gérard D. Cohen:
Frameproof codes against limited coalitions of pirates. Theor. Comput. Sci. 273(1-2): 295-304 (2002) - [j48]Gérard D. Cohen, Sylvia B. Encheva, Hans Georg Schaathun:
More on (2,2)-separating systems. IEEE Trans. Inf. Theory 48(9): 2606-2609 (2002) - 2001
- [j47]Sylvia B. Encheva, Gérard D. Cohen:
Some new p-ary two-secure frameproof codes. Appl. Math. Lett. 14(2): 177-182 (2001) - [j46]Alexander Barg, Gérard D. Cohen, Sylvia B. Encheva, Grigory Kabatiansky, Gilles Zémor
:
A hypergraph approach to the identifying parent property: the case of multiple parents. Electron. Notes Discret. Math. 6: 1-3 (2001) - [j45]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn:
Intersecting codes and partially identifying codes. Electron. Notes Discret. Math. 6: 211-219 (2001) - [j44]Gérard D. Cohen, Simon Litsyn, Gilles Zémor
:
Binary B2-Sequences : A New Upper Bound. J. Comb. Theory A 94(1): 152-155 (2001) - [j43]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. Discret. Math. 14(3): 423-431 (2001) - [j42]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) - [c20]Sylvia B. Encheva, Gérard D. Cohen:
Partially Identifying Codes for Copyright Protection. AAECC 2001: 260-267 - [c19]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Binary Codes for Collusion-Secure Fingerprinting. ICISC 2001: 178-185 - 2000
- [j41]Sylvia B. Encheva, Gérard D. Cohen:
Projective codes which satisfy the chain condition. Appl. Math. Lett. 13(4): 109-113 (2000) - [j40]Sylvia B. Encheva, Gérard D. Cohen:
Linear Codes and Their Coordinate Ordering. Des. Codes Cryptogr. 20(3): 229-250 (2000) - [j39]Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor
:
Codes with forbidden distances. Discret. Math. 213(1-3): 3-11 (2000) - [j38]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor
:
A hypergraph approach to digital fingerprinting. Electron. Notes Discret. Math. 5: 67-70 (2000) - [j37]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor
:
Copyright protection for digital data. IEEE Commun. Lett. 4(5): 158-160 (2000) - [j36]Sylvia B. Encheva, Gérard D. Cohen:
On self-dual ternary codes and their coordinate ordering. Inf. Sci. 126(1-4): 277-286 (2000) - [j35]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor
:
Bounds for Codes Identifying Vertices in the Hexagonal Grid. SIAM J. Discret. Math. 13(4): 492-504 (2000) - [c18]Sylvia B. Encheva, Gérard D. Cohen:
Tracing and Proving Ownership of Digital Objects. ITCC 2000: 184-189
1990 – 1999
- 1999
- [j34]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
New Bounds for Codes Identifying Vertices in Graphs. Electron. J. Comb. 6 (1999) - [j33]Gérard D. Cohen, Josep Rifà
, J. Tena, Gilles Zémor:
On the Characterization of Linear Uniquely Decodable Codes. Des. Codes Cryptogr. 17(1-3): 87-96 (1999) - [j32]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
Antichain Codes. Des. Codes Cryptogr. 18(1/3): 71-80 (1999) - [j31]Sylvia B. Encheva, Gérard D. Cohen:
On Linear Projective Codes Which Satisfy the Chain Condition. Inf. Sci. 118(1-4): 213-222 (1999) - [j30]Sylvia B. Encheva, Gérard D. Cohen:
Constructions of Intersecting Codes. IEEE Trans. Inf. Theory 45(4): 1234-1237 (1999) - [j29]Gérard D. Cohen, Sylvia B. Encheva, Simon Litsyn:
On binary constructions of quantum codes. IEEE Trans. Inf. Theory 45(7): 2495-2498 (1999) - [c17]Sylvia B. Encheva, Gérard D. Cohen:
On the State Complexities of Ternary Codes. AAECC 1999: 454-461 - [c16]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. Codes and Association Schemes 1999: 97-109 - 1998
- [c15]Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor
:
How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220 - 1997
- [j28]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) - [j27]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, Patrick Solé:
Long packing and covering codes. IEEE Trans. Inf. Theory 43(5): 1617-1619 (1997) - 1996
- [j26]Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor
:
Tilings of Binary Spaces. SIAM J. Discret. Math. 9(3): 393-412 (1996) - [j25]Gérard D. Cohen, Simon Litsyn, Gilles Zémor
:
On the traveling salesman problem in binary Hamming spaces. IEEE Trans. Inf. Theory 42(4): 1274-1276 (1996) - [j24]Gérard D. Cohen, Simon Litsyn, Gilles Zémor
:
On greedy algorithms in coding theory. IEEE Trans. Inf. Theory 42(6): 2053-2057 (1996) - 1995
- [j23]Gilles Zémor
, Gérard D. Cohen:
The threshold probability of a code. IEEE Trans. Inf. Theory 41(2): 469-477 (1995) - [j22]Gérard D. Cohen, Iiro S. Honkala, Simon Litsyn, H. F. Mattson Jr.:
Weighted coverings and packings. IEEE Trans. Inf. Theory 41(6): 1856-1867 (1995) - [c14]Alexei E. Ashikhmin, Alexander Barg, Gérard D. Cohen, Llorenç Huguet i Rotger:
Variations on Minimal Codewords in Linear Codes. AAECC 1995: 96-105 - [e7]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. Lecture Notes in Computer Science 948, Springer 1995, ISBN 3-540-60114-7 [contents] - 1994
- [j21]Gérard D. Cohen, Gilles Zémor
:
Intersecting codes and independent families. IEEE Trans. Inf. Theory 40(6): 1872-1881 (1994) - [j20]Gérard D. Cohen, Simon Litsyn, Gilles Zémor
:
Upper bounds on generalized distances. IEEE Trans. Inf. Theory 40(6): 2090-2092 (1994) - 1993
- [j19]Gérard D. Cohen, Gilles Zémor
:
Write-isolated memories (WIMs). Discret. Math. 114(1-3): 105-113 (1993) - [c13]Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor:
Bounds on generalized weights. Algebraic Coding 1993: 270-277 - [e6]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. Lecture Notes in Computer Science 673, Springer 1993, ISBN 3-540-56686-4 [contents] - [e5]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
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 [contents] - 1992
- [j18]Gilles Zémor
, Gérard D. Cohen:
Application of Coding Theory to Interconnection Networks. Discret. Appl. Math. 37/38: 553-562 (1992) - [j17]Gérard D. Cohen, Simon Litsyn:
On the covering radius of Reed-Muller codes. Discret. Math. 106-107: 147-155 (1992) - [e4]Gérard D. Cohen, Simon Litsyn, Antoine Lobstein, Gilles Zémor:
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 [contents] - 1991
- [j16]Gerhard J. M. van Wee, Gérard D. Cohen, Simon Litsyn:
A note on perfect multiple covetings of the Hamming space. IEEE Trans. Inf. Theory 37(3): 678-682 (1991) - [j15]Gilles Zémor
, Gérard D. Cohen:
Error-correcting WOM-codes. IEEE Trans. Inf. Theory 37(3): 730-734 (1991) - [j14]Gérard D. Cohen, Simon Litsyn:
DC-constrained error-correcting codes with small running digital sum. IEEE Trans. Inf. Theory 37(3): 949-955 (1991) - [c12]C. van Eijl, Gérard D. Cohen, Gilles Zémor
:
Error-Correction for WIMs and WUMs. AAECC 1991: 159-170 - [c11]Gérard D. Cohen, Simon Litsyn, H. F. Mattson Jr.:
On Perfect Weighted Coverings with Small Radius. Algebraic Coding 1991: 32-41 - [e3]Gérard D. Cohen, Pascale Charpin:
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 [contents] - 1990
- [j13]Gérard D. Cohen:
Applications of coding theory to communication combinatorial problems. Discret. Math. 83(2-3): 237-248 (1990) - [c10]Gérard D. Cohen:
Covering Radius and Writing on Memories. AAECC 1990: 1-10 - [c9]Gérard D. Cohen, Luisa Gargano
, Ugo Vaccaro:
Unidirectional error-detecting codes. EUROCODE 1990: 94-105
1980 – 1989
- 1989
- [j12]Gérard D. Cohen, Gábor Simonyi:
Coding for write-unidirectional memories and conflict resolution. Discret. Appl. Math. 24(1-3): 103-114 (1989) - [e2]Gérard D. Cohen, Jacques Wolfmann:
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 [contents] - 1988
- [c8]Gérard D. Cohen, Philippe Godlewski, Tai-Yang Hwang:
Generating codewords in real space: Application to decoding. Coding Theory and Applications 1988: 114-122 - [e1]Gérard D. Cohen, Philippe Godlewski:
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 [contents] - 1987
- [j11]Antoine Lobstein, Gérard D. Cohen:
Sur La Complexité D'un Problème De Codage. RAIRO Theor. Informatics Appl. 21(1): 25-32 (1987) - [c7]Gérard D. Cohen:
Non Linear Covering Codes: A Few Results and Conjectures. AAECC 1987: 225-229 - 1986
- [j10]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
Further results on the covering radius of codes. IEEE Trans. Inf. Theory 32(5): 680-694 (1986) - [j9]Gérard D. Cohen, Philippe Godlewski, Frans Merkx:
Linear binary code for write-once memories. IEEE Trans. Inf. Theory 32(5): 697-700 (1986) - [c6]M. Beveraggi, Gérard D. Cohen:
On the Density of Best Coverings in Hamming Spaces. Coding Theory and Applications 1986: 39-44 - [c5]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 - [c4]Luzheng Lu, Gérard D. Cohen, Philippe Godlewski:
Composite permutation coding of speech waveforms. ICASSP 1986: 2359-2362 - 1985
- [j8]Gérard D. Cohen, Abraham Lempel:
Linear intersecting codes. Discret. Math. 56(1): 35-43 (1985) - [j7]Gérard D. Cohen, Peter Frankl:
Good coverings of Hamming spaces with spheres. Discret. Math. 56(2-3): 125-131 (1985) - [j6]Gérard D. Cohen, Mark G. Karpovsky, H. F. Mattson Jr., James R. Schatz:
Covering radius - Survey and recent results. IEEE Trans. Inf. Theory 31(3): 328-343 (1985) - [c3]Philippe Godlewski, Gérard D. Cohen:
Some Cryptographic Aspects of Womcodes. CRYPTO 1985: 458-467 - [c2]Philippe Godlewski, Gérard D. Cohen:
Authorized Writing for "Write-Once" Memories. EUROCRYPT 1985: 111-115 - 1984
- [c1]Gérard D. Cohen, Antoine Lobstein, Neil J. A. Sloane:
On a conjecture concerning coverings of Hamming space. AAECC 1984: 79-89 - 1983
- [j5]Gérard D. Cohen:
A nonconstructive upper bound on covering radius. IEEE Trans. Inf. Theory 29(3): 352-353 (1983) - 1980
- [j4]Gérard D. Cohen, Peter Frankl:
On tilings of the binary vector space. Discret. Math. 31(3): 271-277 (1980) - [j3]Gérard D. Cohen:
On the minimum distance of some BCH codes (Corresp.). IEEE Trans. Inf. Theory 26(3): 363 (1980)
1970 – 1979
- 1979
- [j2]Ian F. Blake, Gérard D. Cohen, Mikhail Deza:
Coding with Permutations. Inf. Control. 43(1): 1-19 (1979) - 1976
- [j1]Gérard D. Cohen, Philippe Godlewski:
Residual error rate of binary linear block codes (Corresp.). IEEE Trans. Inf. Theory 22(4): 483-485 (1976)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint