Yannick Saouter

According to our database, Yannick Saouter authored at least 28 papers between 1989 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2022

New results for witnesses of Robin's criterion.

Yannick Saouter

Math. Comput., 2022

2017

Constructions of LDPCs From Elliptic Curves Over Finite Fields.

Yannick Saouter

IEEE Commun. Lett., 2017

2015

A still sharper region where π(x)-li(x) is positive.

Yannick Saouter, Timothy S. Trudgian, Patrick Demichel

Math. Comput., 2015

2014

Improved results on the Mertens conjecture.

Yannick Saouter, Herman te Riele

Math. Comput., 2014

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

Yannick Saouter

Proceedings of the 8th International Symposium on Turbo Codes and Iterative Information Processing, 2014

2012

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

Oscar Sanchez, C. Jegoy, Michel Jézéquel, Yannick Saouter

Proceedings of the 19th IEEE International Conference on Electronics, Circuits and Systems, 2012

2011

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

Yannick Saouter, Xavier Gourdon, Patrick Demichel

Math. Comput., 2011

Time varying convolutional codes for punctured turbocodes.

Yannick Saouter, Claude Berrou

Proceedings of the 2011 Wireless Telecommunications Symposium, 2011

Improving turbocode performance by cross-entropy.

Yannick Saouter

Proceedings of the 2011 Wireless Telecommunications Symposium, 2011

2010

A sharp region where π(x)-li(x) is positive.

Yannick Saouter, Patrick Demichel

Math. Comput., 2010

A FPGA implementation of Chen's algorithm.

Yannick Saouter, Gérald Le Mestre

ACM Commun. Comput. Algebra, 2010

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

Yannick Saouter

ACM Commun. Comput. Algebra, 2010

2009

Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters].

Claude Berrou, Alexandre Graell i Amat, Youssouf Ould-Cheikh-Mouhamedou, Yannick Saouter

IEEE Trans. Commun., 2009

2004

Designing good permutations for turbo codes: towards a single model.

Claude Berrou, Yannick Saouter, Catherine Douillard, Sylvie Kerouédan, Michel Jézéquel

Proceedings of IEEE International Conference on Communications, 2004

2003

Decoding M-binary turbo codes by the dual method.

Yannick Saouter

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002

Fast soft-output Viterbi decoding for duo-binary turbo codes.

Yannick Saouter, Claude Berrou

Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

1999

Computability of Affine Non-Conditional Recurrent Systems.

Yannick Saouter, Hervé Le Verge

Inf. Process. Lett., 1999

1998

Checking the odd Goldbach conjecture up to 10²⁰.

Yannick Saouter

Math. Comput., 1998

New Results on Computability of Recurrence Equations.

Hervé Le Verge, Yannick Saouter

Int. J. Found. Comput. Sci., 1998

Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic Array.

Dominique Lavenier, Yannick Saouter

Proceedings of the Field-Programmable Logic and Applications, 1998

New Experimental Results Concerning the Goldbach Conjecture.

Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter

Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1993

Computability of recurrence equations.

Yannick Saouter, Patrice Quinton

Theor. Comput. Sci., 1993

1991

The Alpha du Centaur environment.

Catherine Dezan, Hervé Le Verge, Patrice Quinton, Yannick Saouter

Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

Synthesis of systolic arrays by equation transformations.

Catherine Dezan, Eric Gautrin, Hervé Le Verge, Patrice Quinton, Yannick Saouter

Proceedings of the Application Specific Array Processors, 1991

1990

Synthesis of a New Systolic Architecture for the Algebraic Path Problem.

Abdelhamid Benaini, Patrice Quinton, Yves Robert, Yannick Saouter, Bernard Tourancheau

Sci. Comput. Program., 1990

Scheduling affine parameterized recurrences by means of Variable Dependent Timing Functions.

Christophe Mauras, Patrice Quinton, Sanjay V. Rajopadhye, Yannick Saouter

Proceedings of the Application Specific Array Processors, 1990

1989

Alpha du centaur: a prototype environment for the design of parallel regular alorithms.

Pierrick Gachet, Christophe Mauras, Patrice Quinton, Yannick Saouter

Proceedings of the 3rd international conference on Supercomputing, 1989

A VLSI Chip for Ray Tracing Bicubic Patches.

Kadi Bouatouch, Yannick Saouter, Jean Charles Candela

Proceedings of the 10th European Computer Graphics Conference and Exhibition, 1989