Residual error rate of binary linear block codes (Corresp.). - Gérard D. Cohen; Philippe Godlewski (IEEE Trans. Inf. Theory, 1976)

Coding with Permutations - Ian F. Blake; Gérard D. Cohen; Mikhail Deza (Inf. Control., 1979)

On tilings of the binary vector space. - Gérard D. Cohen; Peter Frankl (Discret. Math., 1980)

On the minimum distance of some BCH codes (Corresp.). - Gérard D. Cohen (IEEE Trans. Inf. Theory, 1980)

A nonconstructive upper bound on covering radius. - Gérard D. Cohen (IEEE Trans. Inf. Theory, 1983)

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

Some Cryptographic Aspects of Womcodes. - Philippe Godlewski; Gérard D. Cohen (CRYPTO, 1985)

Authorized Writing for "Write-Once" Memories. - Philippe Godlewski; Gérard D. Cohen (EUROCRYPT, 1985)

Good coverings of Hamming spaces with spheres. - Gérard D. Cohen; Peter Frankl (Discret. Math., 1985)

Linear intersecting codes. - Gérard D. Cohen; Abraham Lempel (Discret. Math., 1985)

Covering radius - Survey and recent results. - Gérard D. Cohen; Mark G. Karpovsky; H. F. Mattson Jr.; James R. Schatz (IEEE Trans. Inf. Theory, 1985)

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

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

Composite permutation coding of speech waveforms. - Luzheng Lu; Gérard D. Cohen; Philippe Godlewski (ICASSP, 1986)

Linear binary code for write-once memories. - Gérard D. Cohen; Philippe Godlewski; Frans Merkx (IEEE Trans. Inf. Theory, 1986)

Further results on the covering radius of codes. - Gérard D. Cohen; Antoine Lobstein; Neil J. A. Sloane (IEEE Trans. Inf. Theory, 1986)

Non Linear Covering Codes: A Few Results and Conjectures. - Gérard D. Cohen (AAECC, 1987)

Sur La Complexité D'un Problème De Codage. - Antoine Lobstein; Gérard D. Cohen (RAIRO Theor. Informatics Appl., 1987)

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

Coding for write-unidirectional memories and conflict resolution. - Gérard D. Cohen; Gábor Simonyi (Discret. Appl. Math., 1989)

Covering Radius and Writing on Memories. - Gérard D. Cohen (AAECC, 1990)

Unidirectional error-detecting codes. - Gérard D. Cohen; Luisa Gargano; Ugo Vaccaro (EUROCODE, 1990)

Applications of coding theory to communication combinatorial problems. - Gérard D. Cohen (Discret. Math., 1990)

Error-Correction for WIMs and WUMs. - C. van Eijl; Gérard D. Cohen; Gilles Zémor (AAECC, 1991)

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

DC-constrained error-correcting codes with small running digital sum. - Gérard D. Cohen; Simon Litsyn (IEEE Trans. Inf. Theory, 1991)

A note on perfect multiple covetings of the Hamming space. - Gerhard J. M. van Wee; Gérard D. Cohen; Simon Litsyn (IEEE Trans. Inf. Theory, 1991)

Error-correcting WOM-codes. - Gilles Zémor; Gérard D. Cohen (IEEE Trans. Inf. Theory, 1991)

Application of Coding Theory to Interconnection Networks. - Gilles Zémor; Gérard D. Cohen (Discret. Appl. Math., 1992)

On the covering radius of Reed-Muller codes. - Gérard D. Cohen; Simon Litsyn (Discret. Math., 1992)

Bounds on generalized weights. - Gérard D. Cohen; Llorenç Huguet i Rotger; Gilles Zémor (Algebraic Coding, 1993)

Write-isolated memories (WIMs). - Gérard D. Cohen; Gilles Zémor (Discret. Math., 1993)

Upper bounds on generalized distances. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1994)

Intersecting codes and independent families. - Gérard D. Cohen; Gilles Zémor (IEEE Trans. Inf. Theory, 1994)

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

Weighted coverings and packings. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; H. F. Mattson Jr. (IEEE Trans. Inf. Theory, 1995)

The threshold probability of a code. - Gilles Zémor; Gérard D. Cohen (IEEE Trans. Inf. Theory, 1995)

Tilings of Binary Spaces. - Gérard D. Cohen; Simon Litsyn; Alexander Vardy; Gilles Zémor (SIAM J. Discret. Math., 1996)

On the traveling salesman problem in binary Hamming spaces. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1996)

On greedy algorithms in coding theory. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (IEEE Trans. Inf. Theory, 1996)

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

Long packing and covering codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Patrick Solé (IEEE Trans. Inf. Theory, 1997)

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

On the State Complexities of Ternary Codes. - Sylvia B. Encheva; Gérard D. Cohen (AAECC, 1999)

On identifying codes. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (Codes and Association Schemes, 1999)

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

Antichain Codes. - Gérard D. Cohen; Sylvia B. Encheva; Gilles Zémor (Des. Codes Cryptogr., 1999)

On the Characterization of Linear Uniquely Decodable Codes. - Gérard D. Cohen; Josep Rifà; J. Tena; Gilles Zémor (Des. Codes Cryptogr., 1999)

On Linear Projective Codes Which Satisfy the Chain Condition. - Sylvia B. Encheva; Gérard D. Cohen (Inf. Sci., 1999)

On binary constructions of quantum codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn (IEEE Trans. Inf. Theory, 1999)

Constructions of Intersecting Codes. - Sylvia B. Encheva; Gérard D. Cohen (IEEE Trans. Inf. Theory, 1999)

Tracing and Proving Ownership of Digital Objects. - Sylvia B. Encheva; Gérard D. Cohen (ITCC, 2000)

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

Linear Codes and Their Coordinate Ordering. - Sylvia B. Encheva; Gérard D. Cohen (Des. Codes Cryptogr., 2000)

Codes with forbidden distances. - Leonid A. Bassalygo; Gérard D. Cohen; Gilles Zémor (Discret. Math., 2000)

A hypergraph approach to digital fingerprinting. - Gérard D. Cohen; Sylvia B. Encheva; Gilles Zémor (Electron. Notes Discret. Math., 2000)

Copyright protection for digital data. - Gérard D. Cohen; Sylvia B. Encheva; Gilles Zémor (IEEE Commun. Lett., 2000)

On self-dual ternary codes and their coordinate ordering. - Sylvia B. Encheva; Gérard D. Cohen (Inf. Sci., 2000)

Bounds for Codes Identifying Vertices in the Hexagonal Grid. - Gérard D. Cohen; Iiro S. Honkala; Antoine Lobstein; Gilles Zémor (SIAM J. Discret. Math., 2000)

Partially Identifying Codes for Copyright Protection. - Sylvia B. Encheva; Gérard D. Cohen (AAECC, 2001)

Binary Codes for Collusion-Secure Fingerprinting. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (ICISC, 2001)

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

A hypergraph approach to the identifying parent property: the case of multiple parents. - Alexander Barg; Gérard D. Cohen; Sylvia B. Encheva; Grigory Kabatiansky; Gilles Zémor (Electron. Notes Discret. Math., 2001)

Intersecting codes and partially identifying codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn (Electron. Notes Discret. Math., 2001)

Binary B2-Sequences : A New Upper Bound. - Gérard D. Cohen; Simon Litsyn; Gilles Zémor (J. Comb. Theory A, 2001)

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

Frameproof codes against limited coalitions of pirates. - Sylvia B. Encheva; Gérard D. Cohen (Theor. Comput. Sci., 2002)

More on (2,2)-separating systems. - Gérard D. Cohen; Sylvia B. Encheva; Hans Georg Schaathun (IEEE Trans. Inf. Theory, 2002)

Copyright Control and Separating Systems. - Sylvia B. Encheva; Gérard D. Cohen (AAECC, 2003)

Intersecting Codes and Separating Codes. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn; Hans Georg Schaathun (Discret. Appl. Math., 2003)

Erratum to "Intersecting codes and separating codes": [Discrete Applied Mathematics 128 (2003) 75-83]. - Gérard D. Cohen; Sylvia B. Encheva; Simon Litsyn; Hans Georg Schaathun (Discret. Appl. Math., 2003)

Generalized hashing and parent-identifying codes. - Noga Alon; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (J. Comb. Theory A, 2003)

The rate of regular LDPC codes. - G. Miller; Gérard D. Cohen (IEEE Trans. Inf. Theory, 2003)

Bounds on distance distributions in codes of known size. - Alexei Ashikhmin; Gérard D. Cohen; Michael Krivelevich; Simon Litsyn (ISIT, 2004)

Separating Codes: Constructions and Bounds. - Gérard D. Cohen; Hans Georg Schaathun (LATIN, 2004)

Upper Bounds on Separating Codes. - Gérard D. Cohen; Hans Georg Schaathun (IEEE Trans. Inf. Theory, 2004)

Covering Codes. - Gérard D. Cohen; Iiro S. Honkala; Simon Litsyn; Antoine Lobstein (North-Holland, 2005)

A Trellis-Based Bound on (2, 1)-Separating Codes. - Hans Georg Schaathun; Gérard D. Cohen (IMACC, 2005)

Duality between packings and coverings of the Hamming space. - Gérard D. Cohen; Alexander Vardy (ITW, 2005)

Nested Codes for Constrained Memory and for Dirty Paper. - Hans Georg Schaathun; Gérard D. Cohen (AAECC, 2006)

Discriminating codes in bipartite graphs. - Emmanuel Charbit; Irène Charon; Gérard D. Cohen; Olivier Hudry (Electron. Notes Discret. Math., 2006)

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

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

Witness Sets. - Gérard D. Cohen; Hugues Randriam; Gilles Zémor (ICMCTA, 2008)

Convolutional Tanner structures for non-ergodic wireless channels. - Joseph Jean Boutros; Emanuele Viterbo; Gérard D. Cohen (ISIT, 2008)

Discriminating codes in bipartite graphs: bounds, extremal cardinalities, complexity. - Emmanuel Charbit; Irène Charon; Gérard D. Cohen; Olivier Hudry; Antoine Lobstein (Adv. Math. Commun., 2008)

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

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

Theoretical and Practical Boundaries of Binary Secure Sketches. - Julien Bringer; Hervé Chabanne; Gérard D. Cohen; Bruno Kindarji; Gilles Zémor (IEEE Trans. Inf. Forensics Secur., 2008)

Separation and Witnesses. - Gérard D. Cohen (IWCC, 2009)

Private Interrogation of Devices via Identification Codes. - Julien Bringer; Hervé Chabanne; Gérard D. Cohen; Bruno Kindarji (INDOCRYPT, 2009)

RFID key establishment against active adversaries. - Julien Bringer; Hervé Chabanne; Gérard D. Cohen; Bruno Kindarji (WIFS, 2009)

Heavy weight codes. - Gérard D. Cohen; Patrick Solé; Aslan Tchamkerten (ISIT, 2010)

On the threshold of Maximum-Distance Separable codes. - Bruno Kindarji; Gérard D. Cohen; Hervé Chabanne (ISIT, 2010)

Identification codes in cryptographic protocols. - Julien Bringer; Hervé Chabanne; Gérard D. Cohen; Bruno Kindarji (ITW, 2010)

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

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

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

Generalized Witness Sets. - Gérard D. Cohen; Sihem Mesnager (CCP, 2011)

On the Link of Some Semi-bent Functions with Kloosterman Sums. - Sihem Mesnager; Gérard D. Cohen (IWCC, 2011)

Binary Kloosterman Sums with Value 4. - Jean-Pierre Flori; Sihem Mesnager; Gérard D. Cohen (IMACC, 2011)

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

Non-malleable codes from the wire-tap channel. - Hervé Chabanne; Gérard D. Cohen; Jean-Pierre Flori; Alain Patey (ITW, 2011)

Permutation Capacities and Oriented Infinite Paths. - Graham R. Brightwell; Gérard D. Cohen; Emanuela Fachini; Marianne Fairthorne; János Körner; Gábor Simonyi; Ágnes Tóth (Electron. Notes Discret. Math., 2011)

On a generalized combinatorial conjecture involving addition mod 2k-1. - Gérard D. Cohen; Jean-Pierre Flori (IACR Cryptol. ePrint Arch., 2011)

The Value 4 of Binary Kloosterman Sums. - Jean-Pierre Flori; Sihem Mesnager; Gérard D. Cohen (IACR Cryptol. ePrint Arch., 2011)

On Bounded Weight Codes. - Christine Bachoc; Venkat Chandar; Gérard D. Cohen; Patrick Solé; Aslan Tchamkerten (IEEE Trans. Inf. Theory, 2011)

Skewincidence. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2011)

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

On constructions of semi-bent functions from bent functions. - Gérard D. Cohen; Sihem Mesnager (Discrete Geometry and Algebraic Combinatorics, 2013)

Towards Secure Two-Party Computation from the Wire-Tap Channel. - Hervé Chabanne; Gérard D. Cohen; Alain Patey (ICISC, 2013)

On Minimal and Quasi-minimal Linear Codes. - Gérard D. Cohen; Sihem Mesnager; Alain Patey (IMACC, 2013)

Public-key Cryptography from Different Assumptions - A Multi-bit Version. - Hervé Chabanne; Gérard D. Cohen; Alain Patey (SECRYPT, 2013)

More on Connector Families. - Gérard D. Cohen; Emanuela Fachini; János Körner (Electron. Notes Discret. Math., 2013)

Cyclic colliding permutations. - Gérard D. Cohen; Claudia Malvenuto (Electron. Notes Discret. Math., 2013)

Variations on Minimal Linear Codes. - Gérard D. Cohen; Sihem Mesnager (ICMCTA, 2014)

Sphere coverings and identifying codes. - David Auger; Gérard D. Cohen; Sihem Mesnager (Des. Codes Cryptogr., 2014)

Connector Families of Graphs. - Gérard D. Cohen; Emanuela Fachini; János Körner (Graphs Comb., 2014)

On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions. - Sihem Mesnager; Gérard D. Cohen; David Madore (IMACC, 2015)

Yet another variation on minimal linear codes. - Gérard D. Cohen; Sihem Mesnager; Hugues Randriam (ITA, 2015)

Cyclic codes and algebraic immunity of Boolean functions. - Sihem Mesnager; Gérard D. Cohen (ITW, 2015)

Zero-Error Capacity of Binary Channels With Memory. - Gérard D. Cohen; Emanuela Fachini; János Körner (IEEE Trans. Inf. Theory, 2016)

Fast algebraic immunity of Boolean functions. - Sihem Mesnager; Gérard D. Cohen (Adv. Math. Commun., 2017)

On a generalised combinatorial conjecture involving addition mod 2k - 1. - Jean-Pierre Flori; Gérard D. Cohen (Int. J. Inf. Coding Theory, 2017)

Path Separation by Short Cycles. - Gérard D. Cohen; Emanuela Fachini; János Körner (J. Graph Theory, 2017)

Maximum weight spectrum codes with reduced length. - Gérard D. Cohen; Ludo Tolhuizen (CoRR, 2018)

How many weights can a linear code have? - Minjia Shi; Hongwei Zhu; Patrick Solé; Gérard D. Cohen (Des. Codes Cryptogr., 2019)

On q-ary plateaued functions over Fq and their explicit characterizations. - Sihem Mesnager; Ferruh Özbudak; Ahmet Sinak; Gérard D. Cohen (Eur. J. Comb., 2019)

Interlocked Permutations. - Gérard D. Cohen; Emanuela Fachini; János Körner (SIAM J. Discret. Math., 2019)