Searching methods for biometric identification systems: Fundamental limits

We study two-stage search procedures for biometric identification systems in an information-theoretical setting. Our main conclusion is that clustering based on vector-quantization achieves the optimum trade-off between the number of clusters (cluster rate) and the number of individuals within a cluster (refinement rate). The notion of excess rate is introduced, a parameter which relates to the amount of clusters to which the individuals belong. We demonstrate that noisier observation channels lead to larger excess rates. © 2009 IEEE

Signaling for the Gaussian Channel with side information at the transmitter

We investigate the Gaussian side information channel in the Shannon (1958) setup and propose a method that achieves correlation between the signal and the side information noise. The capacity still remains to be determined however

The discrete memoryless multiple access channel with partially cooperating encoders

\u3cp\u3eWe introduce the communication situation in which the encoders of a multiple access channel are partially cooperating. These encoders are connected by communication links with finite capacities, which permit both encoders to communicate with each other. First we give a general definition of such a communication process (conference). Then, by proving a converse and giving an achievability proof, we establish the capacity region of the multiple access channel with partially cooperating encoders. It turns out that the optimal conference is very simple.\u3c/p\u3

Information theory and its application to optical communication

\u3cp\u3eThe lecture focusses on the foundations of communication which were developed within the field of information theory. Enumerative shaping techniques and the so-called squareroot transform will be discussed in detail.\u3c/p\u3

Extensions to the context tree weighting method

Modifies the basic context tree weighting method so that past symbols are not needed, and that the context tree depth is infinite. For stationary ergodic sources the authors now achieve entrop