Person:916664: Difference between revisions

From MaRDI portal
Person:916664
Created automatically from import230924090903
 
m AuthorDisambiguator moved page Gérard D. Cohen to Gérard D. Cohen: Duplicate
 
(No difference)

Latest revision as of 21:10, 8 December 2023

Available identifiers

zbMath Open cohen.gerard-denisWikidataQ29387077 ScholiaQ29387077MaRDI QIDQ916664

List of research outcomes

PublicationDate of PublicationType
Interlocked Permutations2019-09-16Paper
On \(q\)-ary plateaued functions over \(\mathbb{F}_q\) and their explicit characterizations2019-07-10Paper
How many weights can a linear code have?2019-01-11Paper
On a generalised combinatorial conjecture involving addition mod \(2^k-1\)2018-08-24Paper
Skewincidence2017-07-12Paper
On Bounded Weight Codes2017-07-12Paper
Path Separation by Short Cycles2017-06-30Paper
Fast algebraic immunity of Boolean functions2017-05-22Paper
Zero-Error Capacity of Binary Channels With Memory2017-04-28Paper
https://portal.mardi4nfdi.de/entity/Q28160702016-07-01Paper
Yet another variation on minimal linear codes2016-03-11Paper
https://portal.mardi4nfdi.de/entity/Q34645372016-01-27Paper
On Existence (Based on an Arithmetical Problem) and Constructions of Bent Functions2016-01-12Paper
Variations on Minimal Linear Codes2016-01-07Paper
Bounds on Distance Distributions in Codes of Given Size2015-10-27Paper
Towards Secure Two-Party Computation from the Wire-Tap Channel2015-10-16Paper
Connector families of graphs2015-01-20Paper
Sphere coverings and identifying codes2014-02-25Paper
On Minimal and Quasi-minimal Linear Codes2014-01-17Paper
https://portal.mardi4nfdi.de/entity/Q28573432013-11-01Paper
Binary Kloosterman Sums with Value 42011-12-16Paper
On the Link of Some Semi-bent Functions with Kloosterman Sums2011-06-08Paper
Permutation Capacities of Families of Oriented Infinite Paths2011-04-15Paper
On a Conjecture about Binary Strings Distribution2010-09-08Paper
New identifying codes in the binary Hamming space2010-04-27Paper
Private Interrogation of Devices via Identification Codes2009-12-17Paper
Separation and Witnesses2009-07-23Paper
LATIN 2004: Theoretical Informatics2009-05-07Paper
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity2009-02-19Paper
Bounds on Distance Distributions in Codes of Known Size2008-12-21Paper
Upper Bounds on Separating Codes2008-12-21Paper
Witness Sets2008-11-25Paper
Discriminating codes in (bipartite) planar graphs2008-05-29Paper
Links Between Discriminating and Identifying Codes in the Binary Hamming Space2008-04-17Paper
Discriminating codes in bipartite graphs2007-05-29Paper
Duality between packings and coverings of the Hamming space2007-04-05Paper
Applied Algebra, Algebraic Algorithms and Error-Correcting Codes2007-02-12Paper
On codes identifying vertices in the two-dimensional square lattice with diagonals2007-01-09Paper
Cryptography and Coding2006-11-01Paper
More on (2,2)-separating systems2005-05-11Paper
https://portal.mardi4nfdi.de/entity/Q44742612004-08-04Paper
Generalized hashing and parent-identifying codes.2004-01-06Paper
https://portal.mardi4nfdi.de/entity/Q44266872003-09-16Paper
https://portal.mardi4nfdi.de/entity/Q45366482002-11-23Paper
https://portal.mardi4nfdi.de/entity/Q45026522002-08-05Paper
Frameproof codes against limited coalitions of pirates2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45107952002-07-10Paper
Codes with forbidden distances2001-11-19Paper
A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents2001-11-11Paper
Binary \(B_2\)-sequences: a new upper bound2001-10-29Paper
https://portal.mardi4nfdi.de/entity/Q27413882001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q27414122001-10-14Paper
https://portal.mardi4nfdi.de/entity/Q27171972001-09-18Paper
Some new \(p\)-ary two-secure frameproof codes2001-08-07Paper
Bounds for Codes Identifying Vertices in the Hexagonal Grid2001-03-19Paper
Antichain codes2001-01-01Paper
Projective codes which satisfy the chain condition2000-12-04Paper
On self-dual ternary codes and their coordinate ordering.2000-10-15Paper
Linear codes and their coordinate ordering.2000-10-10Paper
On binary constructions of quantum codes2000-09-07Paper
https://portal.mardi4nfdi.de/entity/Q45009872000-09-03Paper
https://portal.mardi4nfdi.de/entity/Q49504462000-03-30Paper
On linear projective codes which satisfy the chain condition.2000-01-30Paper
On the characterization of linear uniquely decodable codes2000-01-24Paper
Constructions of intersecting codes1999-11-21Paper
https://portal.mardi4nfdi.de/entity/Q42564931999-07-13Paper
https://portal.mardi4nfdi.de/entity/Q42496391999-06-17Paper
New bounds for codes identifying vertices in graphs1999-03-31Paper
Long packing and covering codes1998-11-04Paper
Covering radius 1985-19941997-10-20Paper
https://portal.mardi4nfdi.de/entity/Q43424971997-06-22Paper
On greedy algorithms in coding theory1997-04-27Paper
https://portal.mardi4nfdi.de/entity/Q48861301997-04-09Paper
Weighted coverings and packings1997-03-25Paper
On the traveling salesman problem in binary Hamming spaces1996-12-12Paper
Tilings of Binary Spaces1996-11-20Paper
https://portal.mardi4nfdi.de/entity/Q48584291996-02-06Paper
The threshold probability of a code1995-12-17Paper
Intersecting codes and independent families1995-10-09Paper
Upper bounds on generalized distances1995-10-09Paper
https://portal.mardi4nfdi.de/entity/Q42763231994-01-27Paper
Write-isolated memories (WIMs)1993-10-24Paper
https://portal.mardi4nfdi.de/entity/Q40233771993-01-23Paper
Application of coding theory to interconnection networks1993-01-16Paper
On the covering radius of Reed-Muller codes1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q39775871992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q33562411991-01-01Paper
A note on perfect multiple coverings of the Hamming space1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33601231991-01-01Paper
Applications of coding theory to communication combinatorial problems1990-01-01Paper
Coding for write-unidirectional memories and conflict resolution1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38294811989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38137511988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47239561987-01-01Paper
Sur la complexité d'un problème de codage1987-01-01Paper
Partitions and fuzziness1986-01-01Paper
Further results on the covering radius of codes1986-01-01Paper
Linear binary code for write-once memories (Corresp.)1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37640511986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37986661986-01-01Paper
Good coverings of Hamming spaces with spheres1985-01-01Paper
Linear intersecting codes1985-01-01Paper
Covering radius---Survey and recent results1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37481991985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33137791984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37604461984-01-01Paper
On Generalized Perfect Codes and Steiner Systems1983-01-01Paper
A nonconstructive upper bound on covering radius1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47498341982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33203801982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39397221981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39429741981-01-01Paper
On tilings of the binary vector space1980-01-01Paper
On the minimum distance of some BCH codes (Corresp.)1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39211391980-01-01Paper
Some Metrical Problems on Sn1980-01-01Paper
Coding with permutations1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38521101979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38677241979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949741979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39413361978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41919601978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41190921977-01-01Paper
Residual error rate of binary linear block codes (Corresp.)1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41496481975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41455761974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41496451974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41496461974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41496471974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Gérard D. Cohen