Yannick Saouter

Orcid: 0000-0001-7980-9168

According to our database1, Yannick Saouter authored at least 29 papers between 1989 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Algebraic decoding for classes of quantum codes.
Proceedings of the IEEE International Mediterranean Conference on Communications and Networking, 2024

2022
New results for witnesses of Robin's criterion.
Math. Comput., 2022

2017
Constructions of LDPCs From Elliptic Curves Over Finite Fields.
IEEE Commun. Lett., 2017

2015
A still sharper region where π(x)-li(x) is positive.
Math. Comput., 2015

2014
Improved results on the Mertens conjecture.
Math. Comput., 2014

Soft-in soft-out algorithms for the Nordstrom-Robinson code.
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.
Proceedings of the 19th IEEE International Conference on Electronics, Circuits and Systems, 2012

2011
An improved lower bound for the de Bruijn-Newman constant.
Math. Comput., 2011

Time varying convolutional codes for punctured turbocodes.
Proceedings of the 2011 Wireless Telecommunications Symposium, 2011

Improving turbocode performance by cross-entropy.
Proceedings of the 2011 Wireless Telecommunications Symposium, 2011

2010
A sharp region where π(x)-li(x) is positive.
Math. Comput., 2010

A FPGA implementation of Chen's algorithm.
ACM Commun. Comput. Algebra, 2010

Heuristics for cannon's algorithm with an application to lyons sporadic group.
ACM Commun. Comput. Algebra, 2010

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

2004
Designing good permutations for turbo codes: towards a single model.
Proceedings of IEEE International Conference on Communications, 2004

2003
Decoding M-binary turbo codes by the dual method.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

2002
Fast soft-output Viterbi decoding for duo-binary turbo codes.
Proceedings of the 2002 International Symposium on Circuits and Systems, 2002

1999
Computability of Affine Non-Conditional Recurrent Systems.
Inf. Process. Lett., 1999

1998
Checking the odd Goldbach conjecture up to 10<sup>20</sup>.
Math. Comput., 1998

New Results on Computability of Recurrence Equations.
Int. J. Found. Comput. Sci., 1998

Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic Array.
Proceedings of the Field-Programmable Logic and Applications, 1998

New Experimental Results Concerning the Goldbach Conjecture.
Proceedings of the Algorithmic Number Theory, Third International Symposium, 1998

1993
Computability of recurrence equations.
Theor. Comput. Sci., 1993

1991
The Alpha du Centaur environment.
Proceedings of the Algorithms and Parallel VLSI Architectures II, 1991

Synthesis of systolic arrays by equation transformations.
Proceedings of the Application Specific Array Processors, 1991

1990
Synthesis of a New Systolic Architecture for the Algebraic Path Problem.
Sci. Comput. Program., 1990

Scheduling affine parameterized recurrences by means of Variable Dependent Timing Functions.
Proceedings of the Application Specific Array Processors, 1990

1989
Alpha du centaur: a prototype environment for the design of parallel regular alorithms.
Proceedings of the 3rd international conference on Supercomputing, 1989

A VLSI Chip for Ray Tracing Bicubic Patches.
Proceedings of the 10th European Computer Graphics Conference and Exhibition, 1989


  Loading...