| 2012 | ||
|---|---|---|
| j4 | Soheil Mohajer, Payam Pakzad, Ali Kakhbod: Tight Bounds on the Redundancy of Huffman Codes. IEEE Transactions on Information Theory 58(11): 6737-6746 (2012) | |
| 2011 | ||
| i3 | Mehdi Molkaraie, Payam Pakzad: On Properties of the Minimum Entropy Sub-tree to Compute Lower Bounds on the Partition Function. CoRR abs/1103.0377 (2011) | |
| 2009 | ||
| c3 | Payam Pakzad, Venkat Anantharam, Amin Shokrollahi: Bounds on the mutual informations of the binary sums of Bernoulli random variables. ISIT 2009: 304-308 | |
| 2008 | ||
| c2 | Mehdi Molkaraie, Payam Pakzad: On properties of the minimum entropy sub-tree to compute lower bounds on the partition function. ISIT 2008: 2504-2507 | |
| 2007 | ||
| c1 | Christina Fragouli, Desmond S. Lun, Muriel Médard, Payam Pakzad: On Feedback for Network Coding. CISS 2007: 248-252 | |
| 2006 | ||
| j3 | Payam Pakzad, Venkat Anantharam: Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels. IEEE Transactions on Communications 54(7): 1149-1153 (2006) | |
| 2005 | ||
| j2 | Payam Pakzad, Venkat Anantharam: Estimation and Marginalization Using the Kikuchi Approximation Methods. Neural Computation 17(8): 1836-1873 (2005) | |
| i2 | Soheil Mohajer, Payam Pakzad, Ali Kakhbod: Tight Bounds on the Redundancy of Huffman Codes. CoRR abs/cs/0508039 (2005) | |
| i1 | Payam Pakzad, Christina Fragouli, Amin Shokrollahi: Coding Schemes for Line Networks. CoRR abs/cs/0508124 (2005) | |
| 2004 | ||
| j1 | Payam Pakzad, Venkat Anantharam: A New Look at the Generalized Distributive Law. IEEE Transactions on Information Theory 50(6): 1132-1155 (2004) | |
| 1 | Venkat Anantharam | |
| 2 | Christina Fragouli | |
| 3 | Ali Kakhbod | |
| 4 | Desmond S. Lun | |
| 5 | Soheil Mohajer | |
| 6 | Mehdi Molkaraie | |
| 7 | Muriel Médard | |
| 8 | Amin Shokrollahi |
Data released under the ODC-BY 1.0 license — See also our legal information page