Marc P. C. Fossorier

Computer Networks and Communications · 2001–2009

A researcher in the Science corpus: 9 papers; trusts 21 researchers and is trusted by 10 researchers here, as inferred from the citation graph.

Subfields

• Computer Networks and Communications — 36 citations into it; #2,416 of 9,886 by trust here, #3,523 by citations
• Electrical and Electronic Engineering — 31 citations into it; #2,814 of 16,539 by trust here, #8,176 by citations
• Artificial Intelligence — 6 citations into it; #33,964 of 35,345 by trust here, #33,294 by citations
• Molecular Biology — 5 citations into it

Whom Marc P. C. Fossorier trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. T. Richardson
2. Sae-Young Chung
3. Rüdiger L. Urbanke
4. David John Cameron MacKay
5. Jinghu Chen
6. Judea Pearl
7. Xiao-Yu Hu
8. Amin Shokrollahi
9. Matthew C. Davey
10. Yu Kou

Who trusts Marc P. C. Fossorier overall

1. Jinghu Chen
2. David Declercq
3. Ivan B. Djordjevic
4. Xiao-Yu Hu
5. Ajay Dholakia
6. Evangelos Eleftheriou

Papers from Marc P. C. Fossorier's perspective

Ordered by how strongly the researchers Marc P. C. Fossorier trusts endorse each paper. Same corpus, a different order for every researcher.

1. The capacity of low-density parity-check codes under message-passing decoding (IEEE Transactions on Information Theory)
2. Low-Density Parity-Check Codes
3. On the construction of some capacity-approaching coding schemes
4. Codes on graphs: normal realizations (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
5. Probabilistic reasoning in intelligent systems - networks of plausible inference
6. Factor graphs and the sum-product algorithm
7. Probabilistic reasoning in intelligent systems: Networks of plausible inference
8. On expander codes (IEEE Transactions on Information Theory)
9. Weaknesses of Margulis and Ramanujan-Margulis low-density parity-check cCodes (MFCSIT)
10. Finite-length analysis of low-density parity-check codes on the binary erasure channel (IEEE Transactions on Information Theory)

Their papers

• Low-density parity-check codes based on finite geometries: A rediscovery and new results (2001) — 1,367 citations
• Reduced-complexity decoding of LDPC codes (2005) — 970 citations
• Density evolution for two improved BP-Based decoding algorithms of LDPC codes (2002) — 416 citations
• Near optimum universal belief propagation based decoding of low-density parity check codes (2002) — 671 citations
• Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (2009) — 321 citations
• 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
• Shuffled iterative decoding (2005) — 328 citations
• Quasicyclic low-density parity-check codes from circulant permutation matrices (2004) — 1,048 citations