Yannick Saouter

Laboratoire des Sciences et Techniques de l’Information de la Communication et de la Connaissance — France

Computer Science · Physical Sciences

12h-index599citations73works0.02yr avg
OpenAlex↗ORCID↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Error Correcting Code Techniques(25), Advanced Wireless Communication Techniques(24), Coding theory and cryptography(22), Analytic Number Theory Research(15), Algorithms and Data Compression(6)

Publications73 total

Pancake-Like Series for Polylogarithmic Constants Involving Harmonic Numbers
Mathematics Magazine·2025Open Access
Constructions and decoding procedures for quantum CSS codes
arXiv (Cornell University)·2025Open Access
Algebraic decoding for classes of quantum codes
2024Open Access
Review of: "Grönwall's Theorem implies the Riemann Hypothesis"
2023Open Access
Review of: "Riemann Hypothesis on Grönwall's Function"
2023Open Access
Review of: "Relations between e, π and golden ratios"
2023Open Access
Review of: "A Mini-Review On MXene Based Textiles For Electromagnetic Interference Shielding Application"
2022Open Access
New results for witnesses of Robin’s criterion
Mathematics of Computation·2021Open Access
New pancake series for π
The Mathematical Gazette·2020· 1 citedOpen Access
Fast decoding of binary quadratic residue codes
Electronics Letters·2019Open Access
Acceleration of low density parity check code (LDPC) decoding by successive overrelaxations
Electronics Letters·2018· 2 citedOpen Access
Untitled
Notes on Number Theory and Discrete Mathematics·2018Open Access
Some formulae which match with the prime counting function infinitely often
Notes on Number Theory and Discrete Mathematics·2018Open Access
Constructions of LDPCs From Elliptic Curves Over Finite Fields
IEEE Communications Letters·2017· 5 cited
101.02 A (doubly) elementary formula for prime numbers
The Mathematical Gazette·2017
A still sharper region where $\pi (x)-{\mathrm {li}}(x)$ is positive
Mathematics of Computation·2015· 20 cited
Soft-in soft-out algorithms for the Nordstrom-Robinson code
2014
Improved results on the Mertens conjecture
Mathematics of Computation·2013· 5 citedOpen Access
High speed low complexity radix-16 Max-Log-MAP SISO decoder
2012· 6 citedOpen Access
Error Control Coding for B3G/4G Wireless Systems
Cambridge University Engineering Department Publications Database·2011
page 1 of 4Next →

Frequent Co-authors

Patrice Quinton(7), Claude Berrou(6), Hervé Le Verge(4), Catherine Douillard(3), Michel Jézéquel(3), Alexandre Graell i Amat(3), Christophe Mauras(3), Patrick Demichel(3), Sanjay Rajopadhye(2), Xavier Gourdon(2), Catherine Dezan(2), Patrick Demichel(2), Sylvie Kerouédan(1), Olivier Ramaré(1), Youssouf Ould Cheikh Mouhamedou(1), Claudine Berr(1), Y. Ould-Cheikh-Mouhamedou(1), Jean‐Marc Deshouillers(1), H. J. J. te Riele(1), Timothy S. Trudgian(1)