108 citations · 241 across the 10 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2011
Non-asymptotic information theoretic bound for some multi-party scenarios
Naresh Sharma, Naqueeb Ahmad Warsi
In the last few years, there has been a great interest in extending the information-theoretic scenario for the non-asymptotic or one-shot case, i.e., where the channel is used only…
cs.IT2010★ 12 cited
Entropy power inequality for a family of discrete random variables
Naresh Sharma, Smarajit Das, Siddharth Muthukrishnan
It is known that the Entropy Power Inequality (EPI) always holds if the random variables have density. Not much work has been done to identify discrete distributions for which the…