17 citations · 30 across the 5 of their papers we have counts for
Showing cs.ITShow all
3 papers · 1 filter
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.IT2012
Optimal Lempel-Ziv based lossy compression for memoryless data: how to make the right mistakes
Narayana Santhanam, Dharmendra Modha
Compression refers to encoding data using bits, so that the representation uses as few bits as possible. Compression could be lossless: i.e. encoded data can be recovered exactly f…
cs.IT2009★ 13 cited
Information-theoretic limits of selecting binary graphical models in high dimensions
Narayana Santhanam, Martin J. Wainwright
The problem of graphical model selection is to correctly estimate the graph structure of a Markov random field given samples from the underlying distribution. We analyze the inform…