The following pages link to Gilles Zémor (Q188711):
Displaying 50 items.
- A homological upper bound on critical probabilities for hyperbolic percolation (Q294303) (← links)
- Bounds for binary codes relative to pseudo-distances of \(k\) points (Q540397) (← links)
- (Q685661) (redirect page) (← links)
- Write-isolated memories (WIMs) (Q685662) (← links)
- Weight distribution and decoding of codes on hypergraphs (Q1001643) (← links)
- On some subgroup chains related to Kneser's theorem (Q1011974) (← links)
- Large sets with small doubling modulo \(p\) are well covered by an arithmetic progression (Q1041272) (← links)
- On the critical pair theory in abelian groups: beyond Chowla's theorem (Q1046731) (← links)
- (Q1121279) (redirect page) (← links)
- On positive and negative atoms of Cayley digraphs (Q1121280) (← links)
- Subset sums in binary spaces (Q1193559) (← links)
- Application of coding theory to interconnection networks (Q1199457) (← links)
- New bounds for codes identifying vertices in graphs (Q1283874) (← links)
- A generalisation to noncommutative groups of a theorem of Mann (Q1318825) (← links)
- Hash functions and Cayley graphs (Q1335422) (← links)
- (Q1382410) (redirect page) (← links)
- An upper bound on the size of the snake-in-the-box (Q1382411) (← links)
- Antichain codes (Q1591641) (← links)
- Ouroboros: a simple, secure and efficient key exchange protocol based on coding theory (Q1673584) (← links)
- Revisiting Kneser's theorem for field extensions (Q1786045) (← links)
- Towards a function field version of Freiman's theorem (Q1800656) (← links)
- On the characterization of linear uniquely decodable codes (Q1963167) (← links)
- Codes with forbidden distances (Q1970693) (← links)
- Durandal: a rank metric based signature scheme (Q2292713) (← links)
- Localisation-resistant random words with small alphabets (Q2333040) (← links)
- On the construction of dense lattices with a given automorphisms group (Q2372823) (← links)
- Yahya Ould Hamidoune's mathematical journey: a critical review of his work (Q2509707) (← links)
- A structure theorem for small sumsets in nonabelian groups (Q2509728) (← links)
- Bounds for Codes Identifying Vertices in the Hexagonal Grid (Q2706181) (← links)
- Discrete Isoperimetric Inequalities and the Probability of a Decoding Error (Q2709849) (← links)
- (Q2717197) (← links)
- (Q2728356) (← links)
- (Q2741388) (← links)
- (Q2741418) (← links)
- A Hypergraph Approach to the Identifying Parent Property: The Case of Multiple Parents (Q2753534) (← links)
- (Q2776533) (← links)
- (Q2816070) (← links)
- Cycle codes of graphs and MDS array codes (Q2851446) (← links)
- High-order Masking by Using Coding Theory and Its Application to AES (Q2870095) (← links)
- RankSign: An Efficient Signature Algorithm Based on the Rank Metric (Q2938678) (← links)
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes (Q2976445) (← links)
- Critical Pairs for the Product Singleton Bound (Q2977291) (← links)
- Squares of Random Linear Codes (Q2978722) (← links)
- Upper Bounds on the Size of Grain-Correcting Codes (Q2986214) (← links)
- Constructions of Rank Modulation Codes (Q2989421) (← links)
- (Q3102714) (← links)
- Full Cryptanalysis of the Chen Identification Protocol (Q3102782) (← links)
- On the Error-Correcting Capabilities of Cycle Codes of Graphs (Q3123107) (← links)
- On greedy algorithms in coding theory (Q3129491) (← links)
- Perfectly Secure Message Transmission in Two Rounds (Q3179361) (← links)
