Dieter-Michael Arnold
Computer Networks and Communications · 2001–2006
A researcher in the Science corpus: 4 papers; trusts 12 researchers and is trusted by 9 researchers here, as inferred from the citation graph.
Subfields
- Computer Networks and Communications — 18 citations into it; #3,299 of 9,886 by trust here, #4,128 by citations
- Electrical and Electronic Engineering — 14 citations into it; #4,005 of 16,539 by trust here, #9,011 by citations
- Artificial Intelligence — 6 citations into it
Whom Dieter-Michael Arnold trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- T. Richardson
- Rüdiger L. Urbanke
- Sae-Young Chung
- H. Jin
- Claude E. Shannon
- Hans-Andrea Loeliger
- von Madeleine Leidheiser
- Alexander Barg
- Xiao-Yu Hu
Who trusts Dieter-Michael Arnold overall
- David P. Varodayan
- Marco Secondini
- Sven Jacobsson
- Dariush Divsalar
- David Declercq
- Ashish J. Khisti
- Enrico Forestieri
- Xiao-Yu Hu
- Marc P. C. Fossorier
- Giuseppe Durisi
Papers from Dieter-Michael Arnold's perspective
Ordered by how strongly the researchers Dieter-Michael Arnold 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)
- Codes on graphs: normal realizations (2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060))
- Irregular repeat accumulate codes
- Low-Density Parity-Check Codes
- Vector quantization and signal compression
- Communication in the Presence of Noise
- Efficient encoding of low-density parity-check codes (IEEE Transactions on Information Theory)
- A Class of Group-Structured LDPC Codes
- Finite-length analysis of low-density parity-check codes on the binary erasure channel (IEEE Transactions on Information Theory)
- Low-density parity-check codes based on finite geometries: A rediscovery and new results (IEEE Transactions on Information Theory)
Their papers
- Simulation-Based Computation of Information Rates for Channels With Memory (2006) — 544 citations
- Efficient implementations of the sum-product algorithm for decoding LDPC codes (2001) — 388 citations
- Progressive edge-growth Tanner graphs (2001) — 506 citations
- Regular and irregular progressive edge-growth tanner graphs (2005) — 1,485 citations