World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
5920
World Ranking
6625
National Ranking
142

Mathematics

D-Index
47
Citations
5794
World Ranking
1302
National Ranking
68

Overview

Gilles Zémor is affiliated with the University of Bordeaux in France and has contributed extensively to the field of computer science. Their work spans multiple subfields, including artificial intelligence, computer networks and communications, electrical and electronic engineering, computational theory and mathematics, and discrete mathematics and combinatorics.

Their main research topics cover areas related to quantum computing and cryptography, such as quantum computing algorithms and architecture, coding theory and cryptography, quantum information and cryptography, quantum-dot cellular automata, error correcting code techniques, cryptography and data security, and cooperative communication and network coding.

Zémor has published in various prominent venues, many of which are specialized journals and archives in theoretical and applied computer science. The frequent publication venues include arXiv (Cornell University), IEEE Transactions on Information Theory, Physical Review Research, SIAM Journal on Computing, and ACM Transactions on Algorithms.

Among the recent papers authored or co-authored by Zémor are:

  • Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel, 2020, Physical Review Research
  • Decoding Quantum Tanner Codes, 2023, IEEE Transactions on Information Theory
  • Decodable Quantum LDPC Codes beyond the √n Distance Barrier Using High-Dimensional Expanders, 2022, SIAM Journal on Computing
  • High-Rate Storage Codes on Triangle-Free Graphs, 2022, IEEE Transactions on Information Theory
  • Ouroboros: An Efficient and Provably Secure KEM Family, 2022, IEEE Transactions on Information Theory

Zémor often collaborates with several frequent co-authors. These include Philippe Gaborit, Anthony Leverrier, Nicolas Aragon, Wouter Rozendaal, and Alexander Barg.

Best Publications

  • Quantum LDPC codes with positive rate and minimum distance proportional to n^{1/2}

    Jean-Pierre Tillich;Gilles Zemor

  • Quantum LDPC Codes With Positive Rate and Minimum Distance Proportional to the Square Root of the Blocklength

    Jean-Pierre Tillich;Gilles Zemor

  • Multidimensional reconciliation for a continuous-variable quantum key distribution

    Anthony Leverrier;Romain Alléaume;Joseph Boutros;Gilles Zémor

  • Generalized low density (Tanner) codes

    J. Boutros;O. Pothier;G. Zemor

  • Optimal Iris Fuzzy Sketches

    J. Bringer;H. Chabanne;G. Cohen;B. Kindarji

  • Error exponents of expander codes

    A. Barg;G. Zemor

  • On expander codes

    G. Zemor

  • Theoretical and Practical Boundaries of Binary Secure Sketches

    J. Bringer;H. Chabanne;G. Cohen;B. Kindarji;B. Kindarji

  • Low-Density Parity-Check Codes for Nonergodic Block-Fading Channels

    Joseph Jean Boutros;Albert Guillén i Fàbregas;Ezio Biglieri;Gilles Zémor

  • Low Rank Parity Check codes and their application to cryptography

    Philippe Gaborit;Gaétan Murat;Olivier Ruatta;Gilles Zemor

  • A hypergraph approach to the identifying parent property: the case of multiple parents

    Alexander Barg;Gérard D. Cohen;Sylvia B. Encheva;Grigory Kabatiansky

  • On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes

    Philippe Gaborit;Gilles Zemor

  • Efficient Encryption From Random Quasi-Cyclic Codes

    Carlos Aguilar-Melchor;Olivier Blazy;Jean-Christophe Deneuville;Philippe Gaborit

  • Hashing with SL2

    Jean-Pierre Tillich;Gilles Zémor

  • BIKE: Bit Flipping Key Encapsulation

    Nicolas Aragon;Paulo Barreto;Slim Bettaieb;Loïc Bidoux

  • Intersecting codes and independent families

    G.D. Cohen;G. Zemor

  • Linear-time maximum likelihood decoding of surface codes over the quantum erasure channel

    Nicolas Delfosse;Nicolas Delfosse;Nicolas Delfosse;Gilles Zémor

  • Quantum Expander Codes

    Anthony Leverrier;Jean-Pierre Tillich;Gilles Zemor

  • Concatenated codes: serial and parallel

    A. Barg;G. Zemor

  • Distance properties of expander codes

    A. Barg;G. Zemor

  • Hamming Quasi-Cyclic (HQC)

    Carlos Aguilar Melchor;Nicolas Aragon;Slim Bettaieb;Loïc Bidoux

  • Multilevel expander codes

    A. Barg;G. Zemor

  • Efficient Encryption from Random Quasi-Cyclic Codes.

    Carlos Aguilar Melchor;Olivier Blazy;Jean-Christophe Deneuville;Philippe Gaborit

Frequent Co-Authors

Philippe Gaborit
Philippe Gaborit University of Limoges
Alexander Barg
Alexander Barg University of Maryland, College Park
Jean-Pierre Tillich
Jean-Pierre Tillich French Institute for Research in Computer Science and Automation - INRIA
Simon Litsyn
Simon Litsyn Tel Aviv University
Anthony Leverrier
Anthony Leverrier French Institute for Research in Computer Science and Automation - INRIA
Ezio Biglieri
Ezio Biglieri Pompeu Fabra University
Alexander Vardy
Alexander Vardy University of California, San Diego
Sergio Verdu
Sergio Verdu Princeton University
Holger Boche
Holger Boche Technical University of Munich

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Studying Mathematics in the USA opens doors to a variety of online degrees that complement this field and enhance career prospects. For those interested in finance, pursuing the cheapest online masters in finance can offer an affordable way to specialize in quantitative financial analysis, risk management, and investment strategies.

Business-oriented students may find value in exploring a fast-track option such as the quickest online mba, which allows for rapid skill acquisition without compromising on the breadth of business knowledge.

Marketing professionals benefit from degrees like the online marketing degree, which emphasize data-driven decision-making and analytics—areas where strong mathematical skills are invaluable.

Additionally, graduates aiming for leadership roles may consider enrolling in one of the one year mba programs, which offer intensive study and networking opportunities in a condensed timeframe. These online degree pathways provide flexibility and career advancement aligned with the evolving demands of industries valuing mathematics expertise.

Best Scientists Citing Gilles Zémor

Trending Scientists

Recently Published Articles