default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPayam Pakzad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[c11]Ayman F. Naguib, Payam Pakzad, Ravi Palanki, Sameera Poduri, Yin Chen:
Scalable and accurate indoor positioning on mobile devices. IPIN 2013: 1-10- 2012
- [j4]Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. IEEE Trans. Inf. 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)
2000 – 2009
- 2009
- [c10]Payam Pakzad, Venkat Anantharam, Amin Shokrollahi:
Bounds on the mutual informations of the binary sums of Bernoulli random variables. ISIT 2009: 304-308 - 2008
- [c9]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
- [c8]Christina Fragouli, Desmond S. Lun, Muriel Médard, Payam Pakzad:
On Feedback for Network Coding. CISS 2007: 248-252 - [c7]Payam Pakzad, Amin Shokrollahi:
EXIT Functions for LT and Raptor Codes, and Asymptotic Ranks of Random Matrices. ISIT 2007: 411-415 - 2006
- [j3]Payam Pakzad, Venkat Anantharam:
Kikuchi Approximation Method for Joint Decoding of LDPC Codes and Partial-Response Channels. IEEE Trans. Commun. 54(7): 1149-1153 (2006) - [c6]Mehdi Molkaraie, Payam Pakzad:
Sub-tree Based Upper and Lower Bounds on the Partition Function. ISIT 2006: 2047-2051 - [c5]Soheil Mohajer, Payam Pakzad, Ali Kakhbod:
Tight Bounds on the Redundancy of Huffman Codes. ITW 2006: 131-135 - [c4]Payam Pakzad, Amin Shokrollahi:
Design Principles for Raptor Codes. ITW 2006: 165-169 - 2005
- [j2]Payam Pakzad, Venkat Anantharam:
Estimation and Marginalization Using the Kikuchi Approximation Methods. Neural Comput. 17(8): 1836-1873 (2005) - [c3]Mehdi Molkaraie, Payam Pakzad:
On entropy decomposition and new bounds on the partition function. ISIT 2005: 1578-1582 - [c2]Payam Pakzad, Christina Fragouli, Amin Shokrollahi:
Coding schemes for line networks. ISIT 2005: 1853-1857 - [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 Trans. Inf. Theory 50(6): 1132-1155 (2004) - 2001
- [c1]Engling Yeo, Payam Pakzad, Borivoje Nikolic
, Venkat Anantharam:
High throughput low-density parity-check decoder architectures. GLOBECOM 2001: 3019-3024
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
