default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDClaude Berrou
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c21]Brahim Oubaha
, Claude Berrou, Xueyao Ji, Yehya Nasser, Raphaël Le Bidan:
On Diversity in Discriminative Neural Networks. ISIVC 2024: 1-6- [i6]Brahim Oubaha, Claude Berrou, Xueyao Ji, Yehya Nasser, Raphaël Le Bidan:
On Diversity in Discriminative Neural Networks. CoRR abs/2407.12599 (2024) - 2023
- [j14]Claude Berrou:
The Invention of Turbo Codes: The Ten-Year-Old Turbo Codes are Entering into Service. IEEE Commun. Mag. 61(2): 6-13 (2023)
2010 – 2019
- 2019
- [c20]Max Raphael Sobroza Marques, Tommaso Bianco, Maxime Roodnejad, Thomas Baduel, Claude Berrou:
Machine learning for explaining and ranking the most influential matters of law. ICAIL 2019: 239-243 - [i5]Max Raphael Sobroza Marques, Tales Marra, Deok-Hee Kim-Dufor, Claude Berrou:
Sparse associative memory based on contextual code learning for disambiguating word senses. CoRR abs/1911.06415 (2019) - 2018
- [c19]Stefan Weithoffer, Charbel Abdel Nour, Norbert Wehn, Catherine Douillard, Claude Berrou:
25 Years of Turbo Codes: From Mb/s to beyond 100 Gb/s. ISTC 2018: 1-6 - 2017
- [i4]Eliott Coyac, Vincent Gripon, Charlotte Langlais, Claude Berrou:
Robust Associative Memories Naturally Occuring From Recurrent Hebbian Networks Under Noise. CoRR abs/1709.08367 (2017) - 2016
- [j13]Matthew F. Brejza, Liang Li, Robert G. Maunder, Bashir M. Al-Hashimi, Claude Berrou, Lajos Hanzo:
20 Years of Turbo Coding and Energy-Aware Design Guidelines for Energy-Constrained Wireless Applications. IEEE Commun. Surv. Tutorials 18(1): 8-28 (2016) - [j12]Xiaoran Jiang, Vincent Gripon, Claude Berrou, Michael G. Rabbat:
Storing Sequences in Binary Tournament-Based Neural Networks. IEEE Trans. Neural Networks Learn. Syst. 27(5): 913-925 (2016) - [c18]Eliott Coyac, Vincent Gripon, Charlotte Langlais, Claude Berrou:
Distributed coding and synaptic pruning. ISTC 2016: 206-210 - [c17]Philippe Tigreat, Carlos Eduardo Rosar Kós Lassance, Xiaoran Jiang, Vincent Gripon, Claude Berrou:
Assembly output codes for learning neural networks. ISTC 2016: 285-289 - 2015
- [c16]Xiaoran Jiang, Max Raphael Sobroza Marques, Pierre-Julien Kirsch, Claude Berrou:
Improved Retrieval for Challenging Scenarios in Clique-Based Neural Networks. IWANN (1) 2015: 400-414 - [c15]Max Raphael Sobroza Marques, Xiaoran Jiang, Olivier Dufor, Claude Berrou, Deok-Hee Kim-Dufor:
A Connectionist Model of Reading with Error Correction Properties. LTC 2015: 304-317 - [c14]Mahmoud Hassan, Olivier Dufor, Pascal Benquet, Claude Berrou, Fabrice Wendling:
Identification of brain networks with high time/space resolution using dense EEG. NER 2015: 1060-1063 - [c13]Ahmad Mheich, Mahmoud Hassan, Vincent Gripon, Mohamad Khalil, Claude Berrou, Olivier Dufor, Fabrice Wendling:
A novel algorithm for measuring graph similarity: Application to brain networks. NER 2015: 1068-1071 - 2014
- [c12]Claude Berrou, Olivier Dufor, Vincent Gripon, Xiaoran Jiang:
Information, noise, coding, modulation: What about the brain? ISTC 2014: 167-172 - [i3]Xiaoran Jiang, Vincent Gripon, Claude Berrou, Michael G. Rabbat:
Storing sequences in binary tournament-based neural networks. CoRR abs/1409.0334 (2014) - 2012
- [c11]Vincent Gripon, Claude Berrou:
Nearly-optimal associative memories based on distributed constant weight codes. ITA 2012: 269-273 - [i2]Behrooz Kamary Aliabadi, Claude Berrou, Vincent Gripon, Xiaoran Jiang:
Learning sparse messages in networks of neural cliques. CoRR abs/1208.4009 (2012) - 2011
- [j11]Vincent Gripon, Claude Berrou:
Sparse Neural Networks With Large Learning Diversity. IEEE Trans. Neural Networks 22(7): 1087-1096 (2011) - [c10]Vincent Gripon, Claude Berrou:
A simple and efficient way to store many messages using neural cliques. CCMB 2011: 54-58 - [c9]Yannick Saouter, Claude Berrou:
Time varying convolutional codes for punctured turbocodes. WTS 2011: 1-5 - [i1]Vincent Gripon, Claude Berrou:
Sparse neural networks with large learning diversity. CoRR abs/1102.4240 (2011) - 2010
- [j10]Sylvie Kerouédan, Claude Berrou:
Turbo code. Scholarpedia 5(4): 6496 (2010)
2000 – 2009
- 2009
- [j9]Claude Berrou, Alexandre Graell i Amat, Youssouf Ould-Cheikh-Mouhamedou, Yannick Saouter:
Improving the distance properties of turbo codes using a third component code: 3D turbo codes - [transactions letters]. IEEE Trans. Commun. 57(9): 2505-2509 (2009) - 2005
- [j8]Catherine Douillard, Claude Berrou:
Turbo codes with rate-m/(m+1) constituent convolutional codes. IEEE Trans. Commun. 53(10): 1630-1638 (2005) - [j7]Sergio Benedetto, Roberto Garello, Guido Montorsi, Claude Berrou, Catherine Douillard, Domenico Giancristofaro, Alberto Ginesi, Luca Giugno, Marco Luise:
MHOMS: high-speed ACM modem for satellite applications. IEEE Wirel. Commun. 12(2): 66-77 (2005) - [c8]Jérôme Le Masson, Charlotte Langlais, Claude Berrou:
Linear precoding with low complexity MMSE turbo-equalization and application to the wireless LAN system. ICC 2005: 2352-2356 - 2004
- [c7]Claude Berrou, Yannick Saouter, Catherine Douillard, Sylvie Kerouédan, Michel Jézéquel:
Designing good permutations for turbo codes: towards a single model. ICC 2004: 341-345 - [c6]Horacio Gonzalez, Claude Berrou, Sylvie Kerouédan:
Serial/parallel (S/P) turbo codes for low error rates. ICC 2004: 346-350 - 2003
- [j6]Claude Berrou:
The ten-year-old turbo codes are entering into service. IEEE Commun. Mag. 41(8): 110-116 (2003) - 2002
- [c5]Claude Berrou, Sandrine Vaton, Michel Jézéquel, Catherine Douillard:
Computing the minimum distance of linear codes by the error impulse method. GLOBECOM 2002: 1017-1020 - [c4]Yannick Saouter, Claude Berrou:
Fast soft-output Viterbi decoding for duo-binary turbo codes. ISCAS (1) 2002: 885-888 - [c3]Claude Berrou, Michel Jézéquel, Catherine Douillard, Laura Conde:
Application of the error impulse method in the design of high-order turbo coded modulation. ITW 2002: 41-44 - 2001
- [c2]Claude Berrou, Michel Jézéquel, Catherine Douillard, Sylvie Kerouédan:
The advantages of non-binary turbo codes. ITW 2001: 61-63
1990 – 1999
- 1999
- [j5]Claude Berrou, Alain Glavieux:
Éditorial - Les turbo codes. Ann. des Télécommunications 54(3-4): 146-147 (1999) - [j4]Claude Berrou, Catherine Douillard, Michel Jézéquel:
Multiple parallel concatenation of circular recursive systematic convolutional (Crsc ) codes. Ann. des Télécommunications 54(3-4): 166-172 (1999) - 1996
- [j3]Claude Berrou, Alain Glavieux:
Near optimum error correcting coding and decoding: turbo-codes. IEEE Trans. Commun. 44(10): 1261-1271 (1996) - 1995
- [j2]Catherine Douillard, Michel Jézéquel, Claude Berrou, Annie Picart, Pierre Didier, Alain Glavieux:
Iterative correction of intersymbol interference: Turbo-equalization. Eur. Trans. Telecommun. 6(5): 507-511 (1995) - [j1]Bernard Le Floch, Michel Alard, Claude Berrou:
Coded orthogonal frequency division multiplex [TV broadcasting]. Proc. IEEE 83(6): 982-996 (1995)
1980 – 1989
- 1989
- [c1]Myriam Ba, Dominique Degrugillier, Claude Berrou:
Digital VLSI using parallel architecture for co-occurrence matrix determination. ICASSP 1989: 2556-2559
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
