default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGilles Zémor
Person information
- affiliation: University of Bordeaux, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j67]Wouter Rozendaal
, Gilles Zémor:
Analysis of the Error-Correcting Radius of a Renormalization Decoder for Kitaev's Toric Code. IEEE Trans. Inf. Theory 70(10): 7036-7048 (2024)- 2023
- [j66]Anthony Leverrier, Gilles Zémor:
Decoding Quantum Tanner Codes. IEEE Trans. Inf. Theory 69(8): 5100-5115 (2023) - [c59]Wouter Rozendaal, Gilles Zémor:
A Worst-Case Analysis of a Renormalisation Decoder for Kitaev's Toric Code. ISIT 2023: 625-629 - [c58]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. SODA 2023: 1216-1244 - [i43]Wouter Rozendaal, Gilles Zémor:
Analysis of the Error-Correcting Radius of a Renormalisation Decoder for Kitaev's Toric Code. CoRR abs/2309.12165 (2023) - 2022
- [j65]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards local testability for quantum coding. Quantum 6: 661 (2022) - [j64]Frédérique E. Oggier, Gilles Zémor:
Coding Constructions for Efficient Oblivious Transfer From Noisy Channels. IEEE Trans. Inf. Theory 68(4): 2719-2734 (2022) - [j63]Nicolas Aragon, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Ouroboros: An Efficient and Provably Secure KEM Family. IEEE Trans. Inf. Theory 68(9): 6233-6244 (2022) - [j62]Alexander Barg, Gilles Zémor:
High-Rate Storage Codes on Triangle-Free Graphs. IEEE Trans. Inf. Theory 68(12): 7787-7797 (2022) - [c57]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. FOCS 2022: 872-883 - [c56]Carlos Aguilar Melchor, Nicolas Aragon, Victor Dyseryn, Philippe Gaborit, Gilles Zémor:
LRPC Codes with Multiple Syndromes: Near Ideal-Size KEMs Without Ideals. PQCrypto 2022: 45-68 - [i42]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. CoRR abs/2202.13641 (2022) - [i41]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. CoRR abs/2206.07571 (2022) - [i40]Carlos Aguilar Melchor, Nicolas Aragon, Victor Dyseryn, Philippe Gaborit, Gilles Zémor:
LRPC codes with multiple syndromes: near ideal-size KEMs without ideals. CoRR abs/2206.11961 (2022) - [i39]Anthony Leverrier, Gilles Zémor:
A parallel decoder for good quantum LDPC codes. CoRR abs/2208.05537 (2022) - [i38]Anthony Leverrier, Gilles Zémor:
Quantum Tanner codes. Electron. Colloquium Comput. Complex. TR22 (2022) - [i37]Anthony Leverrier, Gilles Zémor:
Efficient decoding up to a constant fraction of the code length for asymptotically good quantum codes. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j61]Alexander Barg, Lara Dolecek, Ryan Gabrys, Gyula O. H. Katona, János Körner, Andrew McGregor, Olgica Milenkovic, Sihem Mesnager, Gilles Zémor:
Guest Editorial Special Issue: "From Deletion-Correction to Graph Reconstruction: In Memory of Vladimir I. Levenshtein". IEEE Trans. Inf. Theory 67(6): 3187-3189 (2021) - [j60]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-Time Erasure List-Decoding of Expander Codes. IEEE Trans. Inf. Theory 67(9): 5827-5839 (2021) - [c55]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards Local Testability for Quantum Coding. ITCS 2021: 65:1-65:11 - [i36]Alexander Barg, Gilles Zémor:
High-rate storage codes on triangle-free graphs. CoRR abs/2110.02378 (2021) - 2020
- [j59]Gabriele Spini, Gilles Zémor:
Efficient Protocols for Perfectly Secure Message Transmission With Applications to Secure Network Coding. IEEE Trans. Inf. Theory 66(10): 6340-6353 (2020) - [c54]Shai Evra, Tali Kaufman, Gilles Zémor:
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders. FOCS 2020: 218-227 - [c53]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. ISIT 2020: 379-383 - [i35]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. CoRR abs/2002.08579 (2020) - [i34]Shai Evra, Tali Kaufman, Gilles Zémor:
Decodable quantum LDPC codes beyond the √n distance barrier using high dimensional expanders. CoRR abs/2004.07935 (2020) - [i33]Nicolas Aragon, Philippe Gaborit, Gilles Zémor:
HQC-RMRS, an instantiation of the HQC encryption framework with a more efficient auxiliary error-correcting code. CoRR abs/2005.10741 (2020) - [i32]Frédérique E. Oggier, Gilles Zémor:
Coding Constructions for Efficient Oblivious Transfer from Noisy Channels. CoRR abs/2008.13551 (2020) - [i31]Noga Ron-Zewi, Mary Wootters, Gilles Zémor:
Linear-time Erasure List-decoding of Expander Codes. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j58]Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Gilles Zémor:
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography. IEEE Trans. Inf. Theory 65(12): 7697-7717 (2019) - [c52]Cyril Gavoille, Ghazal Kachigar, Gilles Zémor:
Localisation-Resistant Random Words with Small Alphabets. WORDS 2019: 193-206 - [c51]Nicolas Aragon, Olivier Blazy, Philippe Gaborit, Adrien Hauteville, Gilles Zémor:
Durandal: A Rank Metric Based Signature Scheme. EUROCRYPT (3) 2019: 728-758 - [i30]Nicolas Aragon, Philippe Gaborit, Adrien Hauteville, Olivier Ruatta, Gilles Zémor:
Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography. CoRR abs/1904.00357 (2019) - [i29]Anthony Leverrier, Vivien Londe, Gilles Zémor:
Towards local testability for quantum coding. CoRR abs/1911.03069 (2019) - 2018
- [j57]Christine Bachoc, Oriol Serra, Gilles Zémor:
Revisiting Kneser's Theorem for Field Extensions. Comb. 38(4): 759-777 (2018) - [j56]Nicola di Pietro, Gilles Zémor, Joseph J. Boutros:
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel. IEEE Trans. Inf. Theory 64(3): 1561-1594 (2018) - [j55]Carlos Aguilar Melchor, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Efficient Encryption From Random Quasi-Cyclic Codes. IEEE Trans. Inf. Theory 64(5): 3927-3943 (2018) - [c50]Joseph J. Boutros, Uri Erez, Johannes Van Wonterghem, Gil I. Shamir, Gilles Zémor:
Geometric shaping: low-density coding of Gaussian-like constellations. ITW 2018: 1-5 - [i28]Nicolas Aragon, Olivier Blazy, Philippe Gaborit, Adrien Hauteville, Gilles Zémor:
Durandal: a rank metric based signature scheme. IACR Cryptol. ePrint Arch. 2018: 1192 (2018) - 2017
- [c49]Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Ouroboros: A Simple, Secure and Efficient Key Exchange Protocol Based on Coding Theory. PQCrypto 2017: 18-34 - [i27]Nicolas Delfosse, Gilles Zémor:
Linear-Time Maximum Likelihood Decoding of Surface Codes over the Quantum Erasure Channel. CoRR abs/1703.01517 (2017) - 2016
- [j54]Philippe Gaborit, Gilles Zémor:
On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes. IEEE Trans. Inf. Theory 62(12): 7245-7252 (2016) - [c48]Gabriele Spini, Gilles Zémor:
Universally Secure Network Coding with feedback. ISIT 2016: 2339-2343 - [c47]Gabriele Spini, Gilles Zémor:
Perfectly Secure Message Transmission in Two Rounds. TCC (B1) 2016: 286-304 - [i26]Nicola di Pietro, Gilles Zémor, Joseph Jean Boutros:
LDA Lattices Without Dithering Achieve Capacity on the Gaussian Channel. CoRR abs/1603.02863 (2016) - [i25]Philippe Gaborit, Olivier Ruatta, Julien Schrek, Gilles Zémor:
RankSign : an efficient signature algorithm based on the rank metric. CoRR abs/1606.00629 (2016) - [i24]Gabriele Spini, Gilles Zémor:
Perfectly Secure Message Transmission in Two Rounds. CoRR abs/1608.01909 (2016) - [i23]Carlos Aguilar Melchor, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Efficient Encryption from Random Quasi-Cyclic Codes. CoRR abs/1612.05572 (2016) - [i22]Carlos Aguilar Melchor, Olivier Blazy, Jean-Christophe Deneuville, Philippe Gaborit, Gilles Zémor:
Efficient Encryption from Random Quasi-Cyclic Codes. IACR Cryptol. ePrint Arch. 2016: 1194 (2016) - 2015
- [j53]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
Squares of Random Linear Codes. IEEE Trans. Inf. Theory 61(3): 1159-1173 (2015) - [j52]Diego Mirandola, Gilles Zémor:
Critical Pairs for the Product Singleton Bound. IEEE Trans. Inf. Theory 61(9): 4928-4937 (2015) - [c46]Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor:
Quantum Expander Codes. FOCS 2015: 810-824 - [i21]Christine Bachoc, Oriol Serra, Gilles Zémor:
An analogue of Vosper's Theorem for Extension Fields. CoRR abs/1501.00602 (2015) - [i20]Diego Mirandola, Gilles Zémor:
Critical pairs for the Product Singleton Bound. CoRR abs/1501.06419 (2015) - [i19]Anthony Leverrier, Jean-Pierre Tillich, Gilles Zémor:
Quantum Expander Codes. CoRR abs/1504.00822 (2015) - 2014
- [j51]Jean-Pierre Tillich, Gilles Zémor:
Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength. IEEE Trans. Inf. Theory 60(2): 1193-1202 (2014) - [j50]Navin Kashyap, Gilles Zémor:
Upper Bounds on the Size of Grain-Correcting Codes. IEEE Trans. Inf. Theory 60(8): 4699-4709 (2014) - [c45]Philippe Gaborit, Olivier Ruatta, Julien Schrek, Gilles Zémor:
New Results for Rank-Based Cryptography. AFRICACRYPT 2014: 1-12 - [c44]Philippe Gaborit, Olivier Ruatta, Julien Schrek, Gilles Zémor:
RankSign: An Efficient Signature Algorithm Based on the Rank Metric. PQCrypto 2014: 88-107 - [i18]Philippe Gaborit, Gilles Zémor:
On the hardness of the decoding and the minimum distance problems for rank codes. CoRR abs/1404.3482 (2014) - [i17]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
On powers of codes. CoRR abs/1407.0848 (2014) - [i16]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Gilles Zémor:
On powers of codes. IACR Cryptol. ePrint Arch. 2014: 520 (2014) - 2013
- [j49]Alain Plagne, Oriol Serra, Gilles Zémor:
Preface. Eur. J. Comb. 34(8): 1205-1206 (2013) - [j48]Alain Plagne, Oriol Serra, Gilles Zémor:
Yahya Ould Hamidoune's mathematical journey: A critical review of his work. Eur. J. Comb. 34(8): 1207-1222 (2013) - [j47]Oriol Serra, Gilles Zémor:
A structure theorem for small sumsets in nonabelian groups. Eur. J. Comb. 34(8): 1436-1453 (2013) - [j46]Nicolas Delfosse, Gilles Zémor:
Upper bounds on the rate of low density stabilizer codes for the quantum erasure channel. Quantum Inf. Comput. 13(9-10): 793-826 (2013) - [j45]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of Rank Modulation Codes. IEEE Trans. Inf. Theory 59(2): 1018-1029 (2013) - [j44]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A Construction of Quantum LDPC Codes From Cayley Graphs. IEEE Trans. Inf. Theory 59(9): 6087-6098 (2013) - [c43]Guilhem Castagnos, Soline Renner, Gilles Zémor:
High-order Masking by Using Coding Theory and Its Application to AES. IMACC 2013: 193-212 - [c42]Navin Kashyap, Gilles Zémor:
Upper bounds on the size of grain-correcting codes. ISIT 2013: 136-140 - [c41]Nicola di Pietro, Gilles Zémor, Joseph Jean Boutros:
New results on Construction A lattices based on very sparse parity-check matrices. ISIT 2013: 1675-1679 - [c40]Nicola di Pietro, Joseph Jean Boutros, Gilles Zémor, Loïc Brunel:
New results on low-density integer lattices. ITA 2013: 1-6 - [i15]Navin Kashyap, Gilles Zémor:
Upper Bounds on the Size of Grain-Correcting Codes. CoRR abs/1302.6154 (2013) - [i14]Philippe Gaborit, Olivier Ruatta, Julien Schrek, Gilles Zémor:
RankSign : an efficient signature algorithm based on the rank metric. IACR Cryptol. ePrint Arch. 2013: 766 (2013) - 2012
- [c39]Nicola di Pietro, Joseph Jean Boutros, Gilles Zémor, Loïc Brunel:
Integer low-density lattices based on construction A. ITW 2012: 422-426 - [i13]Nicolas Delfosse, Gilles Zémor:
Upper Bounds on the Rate of Low Density Stabilizer Codes for the Quantum Erasure Channel. CoRR abs/1205.7036 (2012) - [i12]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A Construction of Quantum LDPC Codes from Cayley Graphs. CoRR abs/1206.2656 (2012) - 2011
- [c38]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Parameters of rank modulation codes: Examples. Allerton 2011: 13-17 - [c37]Alain Couvreur, Nicolas Delfosse, Gilles Zémor:
A construction of quantum LDPC codes from Cayley graphs. ISIT 2011: 643-647 - [c36]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of rank modulation codes. ISIT 2011: 869-873 - [c35]Alexander Barg, Gilles Zémor:
List decoding of product codes by the MinSum algorithm. ISIT 2011: 1273-1277 - [c34]Philippe Gaborit, Julien Schrek, Gilles Zémor:
Full Cryptanalysis of the Chen Identification Protocol. PQCrypto 2011: 35-50 - [i11]Arya Mazumdar, Alexander Barg, Gilles Zémor:
Constructions of Rank Modulation Codes. CoRR abs/1110.2557 (2011) - 2010
- [j43]Christine Bachoc, Gilles Zémor:
Bounds for binary codes relative to pseudo-distances of k points. Adv. Math. Commun. 4(4): 547-565 (2010) - [j42]Joseph Jean Boutros, Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zémor:
Low-density parity-check codes for nonergodic block-fading channels. IEEE Trans. Inf. Theory 56(9): 4286-4300 (2010) - [c33]Nicolas Delfosse, Gilles Zémor:
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane. ITW 2010: 1-5 - [e3]Marcus Greferath, Joachim Rosenthal, Alexander Barg, Gilles Zémor:
2010 IEEE Information Theory Workshop, ITW 2010, Dublin, Ireland, August 30 - September 3, 2010. IEEE 2010, ISBN 978-1-4244-8264-1 [contents] - [i10]Christine Bachoc, Gilles Zémor:
Bounds for binary codes relative to pseudo-distances of k points. CoRR abs/1002.3024 (2010)
2000 – 2009
- 2009
- [j41]Oriol Serra, Gilles Zémor:
Cycle codes of graphs and MDS array codes. Electron. Notes Discret. Math. 34: 95-99 (2009) - [c32]Gilles Zémor:
On Cayley Graphs, Surface Codes, and the Limits of Homological Coding for Quantum Error Correction. IWCC 2009: 259-273 - [c31]Christophe Petit, Jean-Jacques Quisquater, Jean-Pierre Tillich, Gilles Zémor:
Hard and Easy Components of Collision Search in the Zémor-Tillich Hash Function: New Attacks and Reduced Variants with Equivalent Security. CT-RSA 2009: 182-194 - [c30]Jean-Pierre Tillich, Gilles Zémor:
Quantum LDPC codes with positive rate and minimum distance proportional to n½. ISIT 2009: 799-803 - [i9]Jean-Pierre Tillich, Gilles Zémor:
Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}. CoRR abs/0903.0566 (2009) - 2008
- [j40]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution and decoding of codes on hypergraphs. Adv. Math. Commun. 2(4): 433-450 (2008) - [j39]Yahya Ould Hamidoune, Oriol Serra, Gilles Zémor:
On the critical pair theory in abelian groups: Beyond Chowla's Theorem. Comb. 28(4): 441-467 (2008) - [j38]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) - [j37]Philippe Gaborit, Gilles Zémor:
Asymptotic Improvement of the Gilbert-Varshamov Bound for Linear Codes. IEEE Trans. Inf. Theory 54(9): 3865-3872 (2008) - [c29]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Weight distribution of codes on hypergraphs. Allerton 2008: 400-401 - [c28]Jean-Pierre Tillich, Gilles Zémor:
Collisions for the LPS Expander Graph Hash Function. EUROCRYPT 2008: 254-269 - [c27]Gérard D. Cohen, Hugues Randriam, Gilles Zémor:
Witness Sets. ICMCTA 2008: 37-45 - [c26]Alexander Barg, Gilles Zémor:
Codes on hypergraphs. ISIT 2008: 156-160 - [c25]Joseph Jean Boutros, Gilles Zémor, Albert Guillen i Fabregas, Ezio Biglieri:
Generalized low-density codes with BCH constituents for full-diversity near-outage performance. ISIT 2008: 787-791 - [c24]Anthony Leverrier, Romain Alléaume, Joseph Boutros, Gilles Zémor, Philippe Grangier:
Multidimensional reconciliation for continuous-variable quantum key distribution. ISIT 2008: 1020-1024 - [c23]Joseph J. Boutros, Gilles Zémor, Albert Guillen i Fabregas, Ezio Biglieri:
Full-diversity product codes for block erasure and block fading channels. ITW 2008: 313-317 - [i8]Alexander Barg, Arya Mazumdar, Gilles Zémor:
Codes on hypergraphs. CoRR abs/0808.3453 (2008) - 2007
- [i7]Julien Bringer, Hervé Chabanne, Gérard D. Cohen, Bruno Kindarji, Gilles Zémor:
Optimal Iris Fuzzy Sketches. CoRR abs/0705.3740 (2007) - [i6]Philippe Gaborit, Gilles Zémor:
Asymptotic improvement of the Gilbert-Varshamov bound for linear codes. CoRR abs/0708.4164 (2007) - [i5]Joseph Boutros, Albert Guillen i Fabregas, Ezio Biglieri, Gilles Zémor:
Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels. CoRR abs/0710.1182 (2007) - [i4]Anthony Leverrier, Romain Alléaume, Joseph Boutros, Gilles Zémor, Philippe Grangier:
Multidimensional reconciliation for continuous-variable quantum key distribution. CoRR abs/0712.3823 (2007) - 2006
- [j36]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. IEEE Trans. Inf. Theory 52(1): 78-90 (2006) - [j35]Joseph Boutros, Gilles Zémor:
On quasi-cyclic interleavers for parallel turbo codes. IEEE Trans. Inf. Theory 52(4): 1732-1739 (2006) - [c22]Philippe Gaborit, Gilles Zémor:
Asymptotic improvement of the Gilbert-Varshamov bound for binary linear codes. ISIT 2006: 287-291 - [c21]Jean-Pierre Tillich, Gilles Zémor:
On the minimum distance of structured LDPC codes with two variable nodes of degree 2 per parity-check equation. ISIT 2006: 1549-1553 - 2005
- [j34]Alexander Barg, Gilles Zémor:
Concatenated codes: serial and parallel. IEEE Trans. Inf. Theory 51(5): 1625-1634 (2005) - [c20]Alexander Barg, Gilles Zémor:
Multilevel expander codes. ISIT 2005: 1315-1319 - [i3]Joseph Boutros, Gilles Zémor:
On quasi-cyclic interleavers for parallel turbo codes. CoRR abs/cs/0502055 (2005) - [i2]Alexander Barg, Gilles Zémor:
Multilevel expander codes. CoRR abs/cs/0502079 (2005) - 2004
- [j33]Alexander Barg, Gilles Zémor:
Error Exponents of Expander Codes under Linear-Complexity Decoding. SIAM J. Discret. Math. 17(3): 426-445 (2004) - [j32]Jean-Pierre Tillich, Gilles Zémor:
The Gaussian isoperimetric inequality and decoding error probabilities for the Gaussian channel. IEEE Trans. Inf. Theory 50(2): 328-331 (2004) - [c19]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. ISIT 2004: 5 - [c18]Anderson D. Cohen, Gilles Zémor:
Generalized coset schemes for the wire-tap channel: application to biometrics. ISIT 2004: 46 - [c17]Joseph J. Boutros, Gilles Zémor:
Interleavers for turbo codes that yield a minimum distance growing with blocklength. ISIT 2004: 55 - [i1]Alexander Barg, Gilles Zémor:
Distance properties of expander codes. CoRR cs.IT/0409010 (2004) - 2003
- [c16]Alexander Barg, Gilles Zémor:
Multilevel expander codes. Algebraic Coding Theory and Information Theory 2003: 69-84 - 2002
- [j31]Alexander Barg, Gilles Zémor:
Error exponents of expander codes. IEEE Trans. Inf. Theory 48(6): 1725-1729 (2002) - [c15]Sabine Leveiller, Gilles Zémor, Philippe Guillot, Joseph Boutros:
A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function. Selected Areas in Cryptography 2002: 232-249 - 2001
- [j30]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) - [j29]Hadi E. Sawaya, Sandrine Vialle, Joseph Boutros, Gilles Zémor:
Performance Limits of Compound Codes with Symbol-Based Iterative Decoding. Electron. Notes Discret. Math. 6: 433-443 (2001) - [j28]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) - [j27]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) - [j26]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) - [j25]Gilles Zémor:
On expander codes. IEEE Trans. Inf. Theory 47(2): 835-837 (2001) - [c14]Sabine Leveiller, Joseph Boutros, Philippe Guillot, Gilles Zémor:
Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding. ICISC 2001: 50 - [c13]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Binary Codes for Collusion-Secure Fingerprinting. ICISC 2001: 178-185 - [c12]Sabine Leveiller, Joseph Boutros, Philippe Guillot, Gilles Zémor:
Cryptanalysis of Nonlinear Filter Generators with {0, 1}-Metric Viterbi Decoding. IMACC 2001: 402-414 - 2000
- [j24]Jean-Pierre Tillich, Gilles Zémor:
Discrete Isoperimetric Inequalities And The Probability Of A Decoding Error. Comb. Probab. Comput. 9(5): 465-479 (2000) - [j23]Leonid A. Bassalygo, Gérard D. Cohen, Gilles Zémor:
Codes with forbidden distances. Discret. Math. 213(1-3): 3-11 (2000) - [j22]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
A hypergraph approach to digital fingerprinting. Electron. Notes Discret. Math. 5: 67-70 (2000) - [j21]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
Copyright protection for digital data. IEEE Commun. Lett. 4(5): 158-160 (2000) - [j20]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)
1990 – 1999
- 1999
- [j19]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) - [j18]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) - [j17]Gérard D. Cohen, Sylvia B. Encheva, Gilles Zémor:
Antichain Codes. Des. Codes Cryptogr. 18(1/3): 71-80 (1999) - [c11]Gérard D. Cohen, Iiro S. Honkala, Antoine Lobstein, Gilles Zémor:
On identifying codes. Codes and Association Schemes 1999: 97-109 - [c10]Joseph Boutros, Olivier Pothier, Gilles Zémor:
Generalized low density (Tanner) codes. ICC 1999: 441-445 - [c9]Jean-Pierre Tillich, Gilles Zémor:
An Overview of the Isoperimetric Method in Coding Theory. IMACC 1999: 129-134 - 1998
- [c8]Gérard D. Cohen, Antoine Lobstein, David Naccache, Gilles Zémor:
How to Improve an Exponentiation Black-Box. EUROCRYPT 1998: 211-220 - 1997
- [j16]Gilles Zémor:
An Upper Bound on the Size of the Snake-In-The-Box. Comb. 17(2): 287-298 (1997) - [j15]Laurent Decreusefond, Gilles Zémor:
On the Error-Correcting Capabilities of Cycle Codes of Graphs. Comb. Probab. Comput. 6(1): 27-38 (1997) - [j14]Jean-Pierre Tillich, Gilles Zémor:
Optimal Cycle Codes Constructed From Ramanujan Graphs. SIAM J. Discret. Math. 10(3): 447-459 (1997) - 1996
- [j13]Gérard D. Cohen, Simon Litsyn, Alexander Vardy, Gilles Zémor:
Tilings of Binary Spaces. SIAM J. Discret. Math. 9(3): 393-412 (1996) - [j12]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) - [j11]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
- [j10]Gilles Zémor, Gérard D. Cohen:
The threshold probability of a code. IEEE Trans. Inf. Theory 41(2): 469-477 (1995) - 1994
- [j9]Gilles Zémor:
Hash Functions and Cayley Graphs. Des. Codes Cryptogr. 4(4): 381-394 (1994) - [j8]Gilles Zémor:
A generalization to noncommutative groups of a theorem of Mann. Discret. Math. 126(1-3): 365-372 (1994) - [j7]Gérard D. Cohen, Gilles Zémor:
Intersecting codes and independent families. IEEE Trans. Inf. Theory 40(6): 1872-1881 (1994) - [j6]Gérard D. Cohen, Simon Litsyn, Gilles Zémor:
Upper bounds on generalized distances. IEEE Trans. Inf. Theory 40(6): 2090-2092 (1994) - [c7]Jean-Pierre Tillich, Gilles Zémor:
Hashing with SL_2. CRYPTO 1994: 40-49 - 1993
- [j5]Gérard D. Cohen, Gilles Zémor:
Write-isolated memories (WIMs). Discret. Math. 114(1-3): 105-113 (1993) - [c6]Jean-Pierre Tillich, Gilles Zémor:
Group-theoretic hash functions. Algebraic Coding 1993: 90-110 - [c5]Gérard D. Cohen, Llorenç Huguet i Rotger, Gilles Zémor:
Bounds on generalized weights. Algebraic Coding 1993: 270-277 - [c4]Gilles Zémor:
Threshold effects in codes. Algebraic Coding 1993: 278-286 - [e2]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
- [j4]Gilles Zémor, Gérard D. Cohen:
Application of Coding Theory to Interconnection Networks. Discret. Appl. Math. 37/38: 553-562 (1992) - [j3]Gilles Zémor:
Subset sums in binary spaces. Eur. J. Comb. 13(3): 221-230 (1992) - [e1]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
- [j2]Gilles Zémor, Gérard D. Cohen:
Error-correcting WOM-codes. IEEE Trans. Inf. Theory 37(3): 730-734 (1991) - [c3]C. van Eijl, Gérard D. Cohen, Gilles Zémor:
Error-Correction for WIMs and WUMs. AAECC 1991: 159-170 - [c2]Gilles Zémor:
Hash Functions And Graphs With Large Girths. EUROCRYPT 1991: 508-511 - [c1]Gilles Zémor:
An Extremal Problem Related to the Covering Radius of Binary Codes. Algebraic Coding 1991: 42-51
1980 – 1989
- 1989
- [j1]Gilles Zémor:
On positive and negative atoms of Cayley digraphs. Discret. Appl. Math. 23(2): 193-195 (1989)
Coauthor Index
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-10-07 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
