Tight bounds for universal compression of large alphabets - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh. Tight bounds for universal compression of large alphabets. In Proceedings of the 2013 IEEE International Symposium on Information Theory, Istanbul, Turkey, July 7-12, 2013. pages 2875-2879, IEEE, 2013. [doi]

This author has not been identified. Look up 'Jayadev Acharya' in GoogleThis author has not been identified. Look up 'Hirakendu Das' in GoogleThis author has not been identified. Look up 'Ashkan Jafarpour' in GoogleThis author has not been identified. Look up 'Alon Orlitsky' in GoogleThis author has not been identified. Look up 'Ananda Theertha Suresh' in Google

runs on WebDSL