Yannick Saouter - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2022

New results for witnesses of Robin's criterionYannick Saouter. moc, 91(334):909-920, 2022. [doi]

2017

Constructions of LDPCs From Elliptic Curves Over Finite FieldsYannick Saouter. icl, 21(12):2558-2561, 2017. [doi]

2015

A still sharper region where π(x)-li(x) is positiveYannick Saouter, Timothy Trudgian, Patrick Demichel. moc, 84(295):2433-2446, 2015. [doi]

2014

Improved results on the Mertens conjectureYannick Saouter, Herman te Riele. moc, 83(285):421-433, 2014. [doi]

Soft-in soft-out algorithms for the Nordstrom-Robinson codeYannick Saouter. istc 2014: 27-31 [doi]

2012

High speed low complexity radix-16 Max-Log-MAP SISO decoderOscar Sanchez, C. Jegoy, Michel Jézéquel, Yannick Saouter. icecsys 2012: 400-403 [doi]

2011

An improved lower bound for the de Bruijn-Newman constantYannick Saouter, Xavier Gourdon, Patrick Demichel. moc, 80(276):2281-2287, 2011. [doi]

Improving turbocode performance by cross-entropyYannick Saouter. wts 2011: 1-4 [doi]

Time varying convolutional codes for punctured turbocodesYannick Saouter, Claude Berrou. wts 2011: 1-5 [doi]

2010

A sharp region where π(x)-li(x) is positiveYannick Saouter, Patrick Demichel. moc, 79(272):2395-2405, 2010. [doi]

A FPGA implementation of Chen's algorithmYannick Saouter, Gérald Le Mestre. cca, 44(3/4):140-141, 2010. [doi]

Heuristics for cannon's algorithm with an application to lyons sporadic groupYannick Saouter. cca, 44(3/4):138-139, 2010. [doi]

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. tcom, 57(9):2505-2509, 2009. [doi]

2004

Designing good permutations for turbo codes: towards a single modelClaude Berrou, Yannick Saouter, Catherine Douillard, Sylvie Kerouédan, Michel Jézéquel. icc 2004: 341-345 [doi]

2003

Decoding M-binary turbo codes by the dual methodYannick Saouter. itw 2003: 74-77 [doi]

2002

Fast soft-output Viterbi decoding for duo-binary turbo codesYannick Saouter, Claude Berrou. iscas 2002: 885-888 [doi]

1999

Computability of Affine Non-Conditional Recurrent SystemsYannick Saouter, Hervé Le Verge. ipl, 69(6):291-295, 1999. [doi]

1998

New Experimental Results Concerning the Goldbach ConjectureJean-Marc Deshouillers, Herman te Riele, Yannick Saouter. antsw 1998: 204-215 [doi]

Computing Goldbach Partitions Using Pseudo-random Bit Generator Operators on a FPFA Systolic ArrayDominique Lavenier, Yannick Saouter. fpl 1998: 316-325 [doi]

Checking the odd Goldbach conjecture up to 10:::20:::Yannick Saouter. moc, 67(222):863-866, 1998.

New Results on Computability of Recurrence EquationsHervé Le Verge, Yannick Saouter. ijfcs, 9(3):249-276, 1998.

1993

Computability of recurrence equationsYannick Saouter, Patrice Quinton. TCS, 116(2):317-337, 1993. [doi]

1991

The Alpha du Centaur environmentC. Dezan, Hervé Le Verge, Patrice Quinton, Yannick Saouter. ccc 1992: 325-334

Synthesis of systolic arrays by equation transformationsCatherine Dezan, Eric Gautrin, Hervé Le Verge, Patrice Quinton, Yannick Saouter. asap 1991: 324-337 [doi]

1990

Synthesis of a New Systolic Architecture for the Algebraic Path ProblemAbdelhamid Benaini, Patrice Quinton, Yves Robert, Yannick Saouter, Bernard Tourancheau. SCP, 15(2-3):135-158, 1990.

Scheduling affine parameterized recurrences by means of Variable Dependent Timing FunctionsChristophe Mauras, Patrice Quinton, Sanjay V. Rajopadhye, Yannick Saouter. asap 1990: 100-110 [doi]

1989

A VLSI Chip for Ray Tracing Bicubic PatchesKadi Bouatouch, Yannick Saouter, Jean Charles Candela. eurographics 1990: [doi]

Alpha du centaur: a prototype environment for the design of parallel regular alorithmsPierrick Gachet, Christophe Mauras, Patrice Quinton, Yannick Saouter. ics 1989: 235-243 [doi]

Sign in or sign up to see more results.

runs on WebDSL