All Stories

  1. Fast decoding of binary quadratic residue codes

    Article • Electronics Letters, September 2019, the Institution of Engineering and Technology (the IET)

    Yannick Saouter

  2. Acceleration of low density parity check code (LDPC) decoding by successive overrelaxations

    Article • Electronics Letters, August 2018, the Institution of Engineering and Technology (the IET)

    Yannick Saouter

  3. Some formulae which match with the prime counting function infinitely often

    Article • Notes on Number Theory and Discrete Mathematics, March 2018, Prof. Marin Drinov Academic Publishing House

    Yannick Saouter

  4. Constructions of LDPCs From Elliptic Curves Over Finite Fields

    Article • IEEE Communications Letters, December 2017, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  5. 101.02 A (doubly) elementary formula for prime numbers

    Article • The Mathematical Gazette, February 2017, Cambridge University Press

    Yannick Saouter

  6. Soft-in soft-out algorithms for the Nordstrom-Robinson code

    Article • August 2014, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  7. Improved results on the Mertens conjecture

    Article • Mathematics of Computation, May 2013, American Mathematical Society (AMS)

    Yannick Saouter

  8. High speed low complexity radix-16 Max-Log-MAP SISO decoder

    Article • December 2012, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  9. Improving turbocode performance by cross-entropy

    Article • April 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  10. Time varying convolutional codes for punctured turbocodes

    Article • April 2011, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  11. Heuristics for cannon's algorithm with an application to lyons sporadic group

    Article • ACM SIGSAM Bulletin, January 2011, ACM (Association for Computing Machinery)

    Yannick Saouter

  12. A FPGA implementation of Chen's algorithm

    Article • ACM SIGSAM Bulletin, January 2011, ACM (Association for Computing Machinery)

    Yannick Saouter

  13. An improved lower bound for the de Bruijn-Newman constant

    Article • Mathematics of Computation, January 2011, American Mathematical Society (AMS)

    Yannick Saouter

  14. Selection procedure of turbocode parameters by combinatorial optimization

    Article • September 2010, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  15. Linear binary codes arising from finite groups

    Article • September 2010, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  16. Selection procedure for binary turbocode permutation parameters

    Article • September 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  17. Fast estimation of the Frame Error Rate for error-correcting codes by the generalized error impulse method

    Article • September 2008, Institute of Electrical & Electronics Engineers (IEEE)

    Yannick Saouter

  18. Short effective intervals containing primes

    Article • Journal of Number Theory, January 2003, Elsevier

    Yannick Saouter

  19. Computability of affine non-conditional recurrent systems

    Article • Information Processing Letters, March 1999, Elsevier

    Yannick Saouter

  20. Checking the odd Goldbach conjecture up to $10^{20}$

    Article • Mathematics of Computation, April 1998, American Mathematical Society (AMS)

    Yannick Saouter

  21. Computability of recurrence equations

    Article • Theoretical Computer Science, August 1993, Elsevier

    Yannick Saouter

  22. Alpha du centaur

    Article • January 1989, ACM (Association for Computing Machinery)

    Yannick Saouter