Dieter-Michael Arnold

According to our database1, Dieter-Michael Arnold authored at least 10 papers between 2001 and 2008.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

2001
2002
2003
2004
2005
2006
2007
2008
0
1
2
3
4
5
1
1
1
1
1
4
1

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2008
A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels.
IEEE Trans. Inf. Theory, 2008

2006
Simulation-Based Computation of Information Rates for Channels With Memory.
IEEE Trans. Inf. Theory, 2006

2005
Regular and irregular progressive edge-growth tanner graphs.
IEEE Trans. Inf. Theory, 2005

2004
On the data-processing inequality in the mismatch case.
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

2003
Computing information rates of finite state models with application to magnetic recording.
PhD thesis, 2003

2002
Computing information rates of magnetic recording channels in the presence of medium noise.
Proceedings of the Global Telecommunications Conference, 2002

2001
An upper bound on the capacity of channels with memory and constraint input.
Proceedings of the 2001 IEEE Information Theory Workshop, 2001

On the information rate of binary-input channels with memory.
Proceedings of the IEEE International Conference on Communications, 2001

Efficient implementations of the sum-product algorithm for decoding LDPC codes.
Proceedings of the Global Telecommunications Conference, 2001

Progressive edge-growth Tanner graphs.
Proceedings of the Global Telecommunications Conference, 2001


  Loading...