Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

Vincent C. Gaudet

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Anthony Rapley

> Home > Persons > Vincent C. Gaudet

Publications

2008
[j9]
- view
  authority control:
- export record
  dblp key:
  - journals/integration/BrandonHBGCHGBGZRBES08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/integration/BrandonHBGCHGBGZRBES08
Tyler L. Brandon, Robert Hang, Gary Block, Vincent C. Gaudet, Bruce F. Cockburn, Sheryl L. Howard, Christian Giasson, Keith Boyle, Paul Goud, Siavash Sheikh Zeinoddin, Anthony Rapley, Stephen Bates, Duncan G. Elliott, Christian Schlegel:
A scalable LDPC decoder ASIC architecture with bit-serial message exchange. Integr. 41(3): 385-398 (2008)
2005
[c6]
- view
  authority control:
- export record
  dblp key:
  - conf/isit/WinsteadGRS05
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isit/WinsteadGRS05
Chris Winstead, Vincent C. Gaudet, Anthony Rapley, Christian Schlegel:
Stochastic iterative decoders. ISIT 2005: 1116-1120
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/abs-cs-0501090
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-cs-0501090
Chris Winstead, Anthony Rapley, Vincent C. Gaudet, Christian Schlegel:
Stochastic Iterative Decoders. CoRR abs/cs/0501090 (2005)

a service of

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.