78 citations · 85 across the 3 of their papers we have counts for
3 papers
stat.AP2011
On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function
Mehdi Molkaraie, Payam Pakzad
Computing the partition function and the marginals of a global probability distribution are two important issues in any probabilistic inference problem. In a previous work, we pres…
cs.IT2005★ 78 cited
Coding Schemes for Line Networks
Payam Pakzad, Christina Fragouli, Amin Shokrollahi
We consider a simple network, where a source and destination node are connected with a line of erasure channels. It is well known that in order to achieve the min-cut capacity, the…
cs.IT2005★ 7 cited
Tight Bounds on the Redundancy of Huffman Codes
Soheil Mohajer, Payam Pakzad, Ali Kakhbod
In this paper we study the redundancy of Huffman codes. In particular, we consider sources for which the probability of one of the source symbols is known. We prove a conjecture of…