default search action
Ebrahim MolavianJazi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
- [j2]Ebrahim MolavianJazi
, Aylin Yener
Subset Source Coding. IEEE Trans. Inf. Theory 64(9): 5989-6012 (2018) - 2016
- [c14]Basak Guler, Aylin Yener, Ebrahim MolavianJazi, Prithwish Basu, Ananthram Swami, Carl Andersen:
Interactive Function Compression with Asymmetric Priors. DCC 2016: 379-388 - [c13]Ebrahim MolavianJazi, Aylin Yener:
Two-way lossy compression via a relay with self source. ISIT 2016: 150-154 - [c12]Ebrahim MolavianJazi, Aylin Yener:
Lossy subset source coding. ITA 2016: 1-10 - 2015
- [j1]Ebrahim MolavianJazi, J. Nicholas Laneman:
A Second-Order Achievable Rate Region for Gaussian Multi-Access Channels via a Central Limit Theorem for Functions. IEEE Trans. Inf. Theory 61(12): 6719-6733 (2015) - [c11]Ebrahim MolavianJazi, Aylin Yener:
Subset source coding. Allerton 2015: 857-864 - [c10]Ebrahim MolavianJazi, Aylin Yener:
Low-Latency Communications over Zero-Battery Energy Harvesting Channels. GLOBECOM 2015: 1-6 - [c9]Basak Guler, Ebrahim MolavianJazi, Aylin Yener:
Remote source coding with two-sided information. ISIT 2015: 2176-2180 - [c8]Carl Andersen, Prithwish Basu, Basak Guler, Aylin Yener, Ebrahim MolavianJazi:
Protocols for efficient inference communication. PerCom Workshops 2015: 51-56 - [c7]Ebrahim MolavianJazi, J. Nicholas Laneman:
Coded modulation for Gaussian channels: Dispersion- and entropy-limited regimes. WCNC 2015: 528-533 - 2014
- [c6]Ebrahim MolavianJazi, J. Nicholas Laneman:
On the second-order cost of TDMA for Gaussian multiple access. ISIT 2014: 266-270 - 2013
- [c5]Ebrahim MolavianJazi, J. Nicholas Laneman:
On the second-order coding rate of non-ergodic fading channels. Allerton 2013: 583-587 - [i1]Ebrahim MolavianJazi, J. Nicholas Laneman:
A Finite-Blocklength Perspective on Gaussian Multi-Access Channels. CoRR abs/1309.2343 (2013) - 2012
- [c4]Ebrahim MolavianJazi, J. Nicholas Laneman:
A random coding approach to Gaussian multiple access channels with finite blocklength. Allerton Conference 2012: 286-293 - [c3]Ebrahim MolavianJazi, J. Nicholas Laneman:
Simpler achievable rate regions for multiaccess with finite blocklength. ISIT 2012: 36-40 - 2011
- [c2]Ebrahim MolavianJazi, J. Nicholas Laneman:
Source-channel coding tradeoff in multiple antenna multiple access channels. ISIT 2011: 1688-1692
2000 – 2009
- 2009
- [c1]Ebrahim MolavianJazi, Matthieu R. Bloch, J. Nicholas Laneman:
Arbitrary jamming can preclude secure communication. Allerton 2009: 1069-1075
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:47 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: