18 citations · 43 across the 7 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
cs.IT2018
Tail redundancy and its characterization of compression of memoryless sources
Maryam Hosseini, Narayana Santhanam
We formalize the tail redundancy of a collection of distributions over a countably infinite alphabet, and show that this fundamental quantity characterizes the asymptotic per-symbo…
cs.IT2018
Redundancy of unbounded memory Markov classes with continuity conditions
Changlong Wu, Maryam Hosseini, Narayana Santhanam
We study the redundancy of universally compressing strings generated by a binary Markov source without any bound on the memory. To better understand the connec…
cs.IT2014★ 3 cited
On redundancy of memoryless sources over countable alphabets
Maryam Hosseini, Narayana Santhanam
The minimum average number of bits need to describe a random variable is its entropy, assuming knowledge of the underlying statistics On the other hand, universal compression suppo…