infinity

Shannon entropy estimation in countably infinite alphabets is addressed by adopting convergence results of the entropy functional and concentration inequalities.

This work introduces the notion of almost lossless source coding for infinite alphabets information sources.

This talks covers the analysis of worse-case redundancies in universal source coding in infinite alphabets.