Dieter-Michael Arnold

An upper bound on the capacity of channels with memory and constraint input

Pascal O. Vontobel, Dieter-Michael Arnold, 2001, Proceedings 2001 IEEE Information Theory Workshop (Cat. No.01EX494).

Efficient implementations of the sum-product algorithm for decoding LDPC codes

Ajay Dholakia, Evangelos Eleftheriou, Xiao-Yu Hu, 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

Simulation-Based Computation of Information Rates for Channels With Memory

Wei Zeng, Hans-Andrea Loeliger, Aleksandar Kavcic, 2006, IEEE Transactions on Information Theory.

Computing information rates of magnetic recording channels in the presence of medium noise

Evangelos Eleftheriou, Dieter-Michael Arnold, E. Eleftheriou, 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

Computing information rates of finite state models with application to magnetic recording

Dieter-Michael Arnold, 2003 .

Regular and irregular progressive edge-growth tanner graphs

Evangelos Eleftheriou, Xiao-Yu Hu, Dieter-Michael Arnold, 2005, IEEE Transactions on Information Theory.

On the information rate of binary-input channels with memory

Hans-Andrea Loeliger, Dieter-Michael Arnold, H. Loeliger, 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

Hans-Andrea Loeliger, Aleksandar Kavcic, Pascal O. Vontobel, 2008, IEEE Transactions on Information Theory.

On the data-processing inequality in the mismatch case

Dieter-Michael Arnold, 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..