The following pages link to Gérard D. Cohen (Q916664):
Displaying 50 items.
- (Q188710) (redirect page) (← links)
- Yet another variation on minimal linear codes (Q259266) (← links)
- Connector families of graphs (Q489306) (← links)
- (Q676005) (redirect page) (← links)
- Covering radius 1985-1994 (Q676007) (← links)
- Write-isolated memories (WIMs) (Q685662) (← links)
- Duality between packings and coverings of the Hamming space (Q874419) (← links)
- Applications of coding theory to communication combinatorial problems (Q916665) (← links)
- Discriminating codes in (bipartite) planar graphs (Q925038) (← links)
- New identifying codes in the binary Hamming space (Q966160) (← links)
- Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641) (← links)
- Good coverings of Hamming spaces with spheres (Q1068057) (← links)
- Linear intersecting codes (Q1072521) (← links)
- Partitions and fuzziness (Q1078152) (← links)
- (Q1148322) (redirect page) (← links)
- On tilings of the binary vector space (Q1148323) (← links)
- Application of coding theory to interconnection networks (Q1199457) (← links)
- On the covering radius of Reed-Muller codes (Q1199595) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- Generalized hashing and parent-identifying codes. (Q1417959) (← links)
- Linear codes and their coordinate ordering. (Q1581790) (← links)
- On self-dual ternary codes and their coordinate ordering. (Q1582648) (← links)
- Projective codes which satisfy the chain condition (Q1588763) (← links)
- Antichain codes (Q1591641) (← links)
- Frameproof codes against limited coalitions of pirates (Q1605345) (← links)
- On a generalised combinatorial conjecture involving addition mod \(2^k-1\) (Q1664081) (← links)
- How many weights can a linear code have? (Q1755995) (← links)
- Coding for write-unidirectional memories and conflict resolution (Q1823916) (← links)
- On linear projective codes which satisfy the chain condition. (Q1961821) (← links)
- On the characterization of linear uniquely decodable codes (Q1963167) (← links)
- Codes with forbidden distances (Q1970693) (← links)
- On \(q\)-ary plateaued functions over \(\mathbb{F}_q\) and their explicit characterizations (Q2311352) (← links)
- Fast algebraic immunity of Boolean functions (Q2397502) (← links)
- Sphere coverings and identifying codes (Q2436572) (← links)
- Bounds for Codes Identifying Vertices in the Hexagonal Grid (Q2706181) (← links)
- (Q2717197) (← links)
- (Q2741388) (← links)
- (Q2741412) (← links)
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents (Q2753534) (← links)
- (Q2816070) (← links)
- (Q2857343) (← links)
- On Minimal and Quasi-minimal Linear Codes (Q2870086) (← links)
- Zero-Error Capacity of Binary Channels With Memory (Q2977028) (← links)
- On the Link of Some Semi-bent Functions with Kloosterman Sums (Q3005595) (← links)
- Binary Kloosterman Sums with Value 4 (Q3104685) (← links)
- On greedy algorithms in coding theory (Q3129491) (← links)
- Towards Secure Two-Party Computation from the Wire-Tap Channel (Q3193252) (← links)
- Coding with permutations (Q3205158) (← links)
- (Q3313779) (← links)
- (Q3320380) (← links)