dr.ir. Tjalling J. Tjalkens

Technische Universiteit Eindhoven,
Department of Electrical Engineering,
PT 3.16,
Postbus 513,
5600 MB Eindhoven,
The Netherlands
phone: +31 40 247 3690, fax: +31 40 246 6508
email: t.j.tjalkens@remove-this.tue.nl

Courses

• Information an Communication Theory (5JK00) (Course information in Dutch)
• Adaptive Information Processing (5MB20)
• Information Theory 2 (5P340)

Discontinued courses

• Information Theory 1 (5JJ40/5K020) (Course information in Dutch)
• Communication Principles (5P350)
• Introduction Digital Communication (5N500)
• Coding, Information Theory and Cryptology 1 (2E110)
• Coding, Information Theory and Cryptology 2 (2E120)

Research topics

Source coding.

A report can be found regarding the universal variable-to-fixed length `modified Lawrence algorithm'. This paper discusses the achievable redundancy-rate (i.e. the best possible rate of convergence of the code rate to the source entropy) and presents an algorithm that achieves this optimal convergence.

Also a partial result on the redundancy-rate of the well-known Lempel-Ziv (1978) universal algorithm was presented at the 1990 IEEE Workshop on Information Theory. Here you can read our contribution to the 1990 Benelux Symposium on Information Theory, which contains a more elaborate discussion of the result.

The Context tree weighting algorithm.is a universal algorithm that has the property that for Tree sources of restricted depth the redundancy decreases as fast as possible. Tree sources are a large subset of Markov sources and they are especially useful in text modeling. Currently, the CTW algorithm achieves the best known compression on text data. (A table of results will follow soon).

Channel coding.

Links

• CTW web page.
• Werkgemeenschap Informatie- en Communicatietheorie (WIC).
• Nederlands Elektronica- en Radio Genootschap (NERG).
• Euler Institute for Discrete Mathematics and its Applications (EIDMA).
• IEEE Information Theory Society.