Marc Moeneclaey
IEEE International Conference on Communications · 2004
A researcher in the Science corpus: 1 paper; trusts 3 researchers and is trusted by 2 researchers here, as inferred from the citation graph.
Whom Marc Moeneclaey trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Marc Moeneclaey overall
Papers from Marc Moeneclaey's perspective
Ordered by how strongly the researchers Marc Moeneclaey trusts endorse each paper. Same corpus, a different order for every researcher.
- Low-Density Parity-Check Codes
- Factor graphs and the sum-product algorithm
- Efficient implementations of the sum-product algorithm for decoding LDPC codes (GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270))
- Probabilistic reasoning in intelligent systems: Networks of plausible inference
- Codes on graphs: normal realizations (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
- The capacity of low-density parity-check codes under message-passing decoding (IEEE Transactions on Information Theory)
- Irregular repeat accumulate codes
- Graphical Models for Machine Learning and Digital Communication
- Local computations with probabilities on graphical structures and their application to expert systems
- The generalized distributive law (IEEE Transactions on Information Theory)
Their papers
- Log-domain decoding of LDPC codes over GF(q) (2004) — 312 citations