Almost Lossless Variable-Length Source Coding on Countably Infinite Alphabets

Séminaire le 8 Juillet 2016, 14h00 à CentraleSupelec (Gif-sur-Yvette) Salle du conseil du L2S - B4.40
Prof. Jorge F. Silva, University of Chile, Santiago.

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, in this talk a notion of almost lossless source coding will be introduced.  This idea —analog to the  weak variable-length source coding proposed by Han 2000— aims at relaxing the lossless block-wise assumption to allow a distortion that vanishes asymptotically as the block-length goes to infinity.  In this almost lossless coding setting, new source coding results will be presented that on one hand show that Shannon entropy characterizes the minimum achievable rate (known statistics), while on the other,  that almost lossless universal source coding becomes feasible for the family of finite entropy stationary and memoryless sources with countably infinite alphabets.

Biography: Jorge F. Silva is Associate Professor at the Electrical Engineering Department and director of the Information and Decision Systems (IDS) Group at the University of Chile, Santiago, Chile. He received the Master of Science (2005) and Ph.D. (2008) in Electrical Engineering from the University of Southern California (USC). He is IEEE member of the Signal Processing and Information Theory Societies and he is associate editor of the  IEEE Transactions on Signal Processing.  Dr. Silva is recipient of the Viterbi Doctoral Fellowship  2007–2008 and Simon Ramo Scholarship 2007–2008 at USC.   Dr. Silva general research interests include: detection and estimation, information theory and statistics, universal source coding, sparse and compressible models and  compressed sensing.