David Declercq
Computer Networks and Communications · 2007–2008
A researcher in the Science corpus: 2 papers; trusts 14 researchers and is trusted by 0 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 17 citations into it
- Electrical and Electronic Engineering — 15 citations into it
Whom David Declercq trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- T. Richardson
- Jinghu Chen
- Xiao-Yu Hu
- David John Cameron MacKay
- Rüdiger L. Urbanke
- Henk Wymeersch
- Evangelos Eleftheriou
- Marc P. C. Fossorier
- Matthew C. Davey
- Sae-Young Chung
Papers from David Declercq's perspective
Ordered by how strongly the researchers David Declercq trusts endorse each paper. Same corpus, a different order for every researcher.
- The capacity of low-density parity-check codes under message-passing decoding (IEEE Transactions on Information Theory)
- Low-Density Parity-Check Codes
- Density evolution for two improved BP-Based decoding algorithms of LDPC codes (IEEE Communications Letters)
- Finite-length analysis of low-density parity-check codes on the binary erasure channel (IEEE Transactions on Information Theory)
- Design of capacity-approaching irregular low-density parity-check codes (IEEE Transactions on Information Theory)
- Evaluation of Gallager Codes for Short Block Length and High Rate Applications
- On the construction of some capacity-approaching coding schemes
- Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation (IEEE Transactions on Information Theory)
- Reduced-complexity decoding of LDPC codes (IEEE Transactions on Communications)
- Regular and irregular progressive edge-growth tanner graphs (IEEE Transactions on Information Theory)
Their papers
- Design of regular (2,d/sub c/)-LDPC codes over GF(q) using their binary images (2008) — 302 citations
- Decoding Algorithms for Nonbinary LDPC Codes Over GF$(q)$ (2007) — 713 citations