Filtrer vos résultats
- 26
- 17
- 17
- 15
- 9
- 2
- 9
- 24
- 14
- 7
- 1
- 1
- 1
- 2
- 2
- 1
- 1
- 1
- 3
- 6
- 1
- 2
- 3
- 1
- 1
- 3
- 2
- 1
- 3
- 1
- 1
- 3
- 1
- 1
- 38
- 5
- 15
- 12
- 12
- 11
- 2
- 1
- 1
- 1
- 1
- 43
- 6
- 5
- 5
- 4
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
43 résultats
|
|
|
triés par
|
|
|
Fast SUBMAP decoders for duo-binary turbo-codesFirst IEEE International Conference on Circuits and Systems for Communication, Jun 2002, St Petersburg, Russia. ⟨10.1109/OCCSC.2002.1029067⟩
Communication dans un congrès
hal-02786818v1
|
||
Constructions of LDPCs from elliptic curves over finite fieldsIEEE Communications Letters, 2017, 21 (12), pp.2558 - 2561. ⟨10.1109/LCOMM.2017.2750660⟩
Article dans une revue
hal-01669410v1
|
|||
|
|
A Fermat-Like Sequence and Primes of the Form $2h.3^n+1$[Research Report] RR-2728, INRIA. 1995
Rapport
inria-00073966v1
|
||
|
|
Synthesis of a new systolic architecture for the algebraic path problem[Research Report] RR-1094, INRIA. 1989
Rapport
inria-00075465v1
|
||
Selection procedure of turbocode parameters by combinatorial optimizationISTC 2010 : 6th International Symposium on Turbo Codes and Related Topics, Sep 2010, Brest, France. pp.156 - 160
Communication dans un congrès
hal-00540848v1
|
|||
|
|
Fast decoding of binary quadratic residue codesElectronics Letters, 2019, 55 (24), pp.1292 - 1294. ⟨10.1049/el.2019.2143⟩
Article dans une revue
hal-02403171v1
|
||
Selection procedure for binary turbocode permutation parameters5th International Symposium on Turbo Codes and Related Topics, Sep 2008, Lausanne, Switzerland. pp.272 - 276, ⟨10.1109/TURBOCODING.2008.4658710⟩
Communication dans un congrès
hal-02786811v1
|
|||
Partial memory turbo codes for high coding rate and high troughput concatenated schemes3rd International Symposium On Turbo Codes & Related Topics, Sep 2003, Brest, France. pp.339-342
Communication dans un congrès
hal-02786813v1
|
|||
Synthesis of a new systolic architecture for the algebraic path problemScience of Computer Programming, 1990, 15, pp.135-158
Article dans une revue
hal-00857035v1
|
|||
Short effective intervals containing primesJournal of Number Theory, 2003, 98 (1), pp.10-33. ⟨10.1016/S0022-314X(02)00029-X⟩
Article dans une revue
istex
hal-02965430v1
|
|||
Improving turbocode performance by cross-entropyWireless Telecommunication Symposium, Apr 2011, New York, United States
Communication dans un congrès
hal-00609244v1
|
|||
Time varying convolutional codes for punctured turbocodesWireless Telecommunication Symposium, Apr 2011, New York, United States
Communication dans un congrès
hal-00609239v1
|
|||
|
|
High speed low complexity radix-16 Max-Log-MAP SISO decoderICECS 2012 : 19th IEEE International Conference on Electronics, Circuits and Systems, Dec 2012, Séville, France. pp.400-403, ⟨10.1109/ICECS.2012.6463718⟩
Communication dans un congrès
hal-00955749v1
|
||
|
|
The Mortality of a Pair of 2x2 Matrices is Decidable[Research Report] RR-2842, INRIA. 1996
Rapport
inria-00073848v1
|
||
|
|
Acceleration of low density parity check code (LDPC) decoding by successive overrelaxationsElectronics Letters, 2018, 54 (19), pp.1112-1114. ⟨10.1049/el.2018.5867⟩
Article dans une revue
hal-01863582v1
|
||
|
|
New results for witnesses of Robin’s criterionMathematics of Computation, 2021, ⟨10.1090/mcom/3687⟩
Article dans une revue
hal-03388961v1
|
||
Codes and Turbo CodesSpringer-Verlag, pp.400, 2010, IRIS international series, 9782817800387
Ouvrages
hal-01170419v1
|
|||
|
|
Computability of recurrence equations[Research Report] RR-1203, INRIA. 1990
Rapport
inria-00075355v1
|
||
|
|
A new method for the generation of strong prime numbers[Research Report] RR-2657, INRIA. 1995
Rapport
inria-00074032v1
|
||
|
|
Halting Problem for One-State Turing Machines[Research Report] RR-2577, INRIA. 1995
Rapport
inria-00074105v1
|
||
Improved results on the Mertens conjectureMathematics of Computation, 2014, 83 (285), pp.421 - 433
Article dans une revue
hal-00918027v1
|
|||
Codes et turbocodes (sous la direction de Claude Berrou)Springer, pp.397, 2007, Iris, Iris, 978-2-287-32739-1
Ouvrages
hal-01801570v1
|
|||
Permutation models for B3G turbo codes4th International Symposium on Turbo Codes and Related Topics, Apr 2006, Munich, Allemagne
Communication dans un congrès
hal-02965445v1
|
|||
Le décodage pondéré itératif dans les réseaux sans filsTI Lettre réseaux sans fils, 2007
Article dans une revue
hal-02124672v1
|
|||
A still sharper region where $\pi(x)-{\mathrm{li}}(x)$ is positiveMathematics of Computation, 2015, 84 (295), pp.2433 - 2446. ⟨10.1090/S0025-5718-2015-02930-5#sthash.CxdZoPgC.dpuf⟩
Article dans une revue
hal-01174411v1
|
|||
|
|
Fast soft-output Viterbi decoding for duo-binary turbo codes2002 IEEE international symposium on Circuits and Systems, May 2002, Phoenix, AZ, United States. pp.885-885, ⟨10.1109/ISCAS.2002.1009983⟩
Communication dans un congrès
hal-02786817v1
|
||
|
|
Scheduling affine parameterized recurrences by means of variable dependent timing functions[Research Report] RR-1204, INRIA. 1990
Rapport
inria-00075354v1
|
||
Designing good permutations for turbo codes: towards a single model2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), Jun 2004, Paris, France. pp.341-345
Communication dans un congrès
hal-02119341v1
|
|||
Heuristics for Cannon's algorithm with an application to Lyons sporadic group35th International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany
Communication dans un congrès
hal-00725147v1
|
|||
A FPGA implementation of Chens algorithm35th International Symposium on Symbolic and Algebraic Computation, Jul 2010, Munich, Germany
Communication dans un congrès
hal-00725508v1
|
- 1
- 2