Description:
Over a compound discrete memoreyless channel, i.e. the statistics of the channel are unknown, universal (successful) decoders are also highly complex. Recent works showed however, that there exist universal decoders of manageable complexity if the compound set is known. A geometric method has been introduced to solve this problem.

Objective:
First to understand the existing result and geometric methods in information theory. Then the goal is to construct quasi-universal decoders of manageable complexity, but without the compound set's knowledge.

Prerequisites:
Information theory and probability.

Supervisor:
Emmanuel Abbe, tel: 35657, office: INR 030, emmanuel.abbe@epfl.ch

Professor:
Prof. Bixio Rimoldi

back to master thesis projects menu