Yannick Saouter

29 papers A 1B 2Journal 14Unranked 12

Year	Rank	Type	Title / Venue / Authors
2024	—	`conf`	Algebraic decoding for classes of quantum codes. MeditCom Yannick Saouter, Gilles Burel
2022	J	`jnl`	New results for witnesses of Robin's criterion. Math. Comput. Yannick Saouter
2017	J	`jnl`	Constructions of LDPCs From Elliptic Curves Over Finite Fields. IEEE Commun. Lett. Yannick Saouter
2015	J	`jnl`	A still sharper region where π(x)-li(x) is positive. Math. Comput. Yannick Saouter, Timothy S. Trudgian, Patrick Demichel
2014	J	`jnl`	Improved results on the Mertens conjecture. Math. Comput. Yannick Saouter, Herman te Riele
2014	—	`conf`	Soft-in soft-out algorithms for the Nordstrom-Robinson code. ISTC Yannick Saouter
2012	—	`conf`	High speed low complexity radix-16 Max-Log-MAP SISO decoder. ICECS Oscar Sanchez, C. Jegoy, Michel Jézéquel, Yannick Saouter
2011	J	`jnl`	An improved lower bound for the de Bruijn-Newman constant. Math. Comput. Yannick Saouter, Xavier Gourdon, Patrick Demichel
2011	—	`conf`	Improving turbocode performance by cross-entropy. WTS Yannick Saouter
2011	—	`conf`	Time varying convolutional codes for punctured turbocodes. WTS Yannick Saouter, Claude Berrou
2010	J	`jnl`	A FPGA implementation of Chen's algorithm. ACM Commun. Comput. Algebra Yannick Saouter, Gérald Le Mestre
2010	J	`jnl`	A sharp region where π(x)-li(x) is positive. Math. Comput. Yannick Saouter, Patrick Demichel
2010	J	`jnl`	Heuristics for cannon's algorithm with an application to lyons sporadic group. ACM Commun. Comput. Algebra Yannick Saouter
2009	J	`jnl`	Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters]. IEEE Trans. Commun. Claude Berrou, Alexandre Graell i Amat, Youssouf Ould-Cheikh-Mouhamedou, Yannick Saouter
2004	—	`conf`	Designing good permutations for turbo codes: towards a single model. ICC Claude Berrou, Yannick Saouter, Catherine Douillard, Sylvie Kerouédan, Michel Jézéquel
2003	B	`conf`	Decoding M-binary turbo codes by the dual method. ITW Yannick Saouter
2002	—	`conf`	Fast soft-output Viterbi decoding for duo-binary turbo codes. ISCAS (1) Yannick Saouter, Claude Berrou
1999	J	`jnl`	Computability of Affine Non-Conditional Recurrent Systems. Inf. Process. Lett. Yannick Saouter, Hervé Le Verge
1998	J	`jnl`	Checking the odd Goldbach conjecture up to 10 Math. Comput. Yannick Saouter
1998	B	`conf`	Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic Array. FPL Dominique Lavenier, Yannick Saouter
1998	—	`conf`	New Experimental Results Concerning the Goldbach Conjecture. ANTS Jean-Marc Deshouillers, Herman te Riele, Yannick Saouter
1998	J	`jnl`	New Results on Computability of Recurrence Equations. Int. J. Found. Comput. Sci. Hervé Le Verge, Yannick Saouter
1993	J	`jnl`	Computability of recurrence equations. Theor. Comput. Sci. Yannick Saouter, Patrice Quinton
1991	—	`conf`	Synthesis of systolic arrays by equation transformations. ASAP Catherine Dezan, Eric Gautrin, Hervé Le Verge, Patrice Quinton, Yannick Saouter
1991	—	`conf`	The Alpha du Centaur environment. Algorithms and Parallel VLSI Architectures Catherine Dezan, Hervé Le Verge, Patrice Quinton, Yannick Saouter
1990	—	`conf`	Scheduling affine parameterized recurrences by means of Variable Dependent Timing Functions. ASAP Christophe Mauras, Patrice Quinton, Sanjay V. Rajopadhye, Yannick Saouter
1990	J	`jnl`	Synthesis of a New Systolic Architecture for the Algebraic Path Problem. Sci. Comput. Program. Abdelhamid Benaini, Patrice Quinton, Yves Robert, Yannick Saouter, Bernard Tourancheau
1989	—	`conf`	A VLSI Chip for Ray Tracing Bicubic Patches. Eurographics Kadi Bouatouch, Yannick Saouter, Jean Charles Candela
1989	A	`conf`	Alpha du centaur: a prototype environment for the design of parallel regular alorithms. ICS Pierrick Gachet, Christophe Mauras, Patrice Quinton, Yannick Saouter