default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamed Narimani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Shima Kheradmand
, Mohammadali Khosravifard, Sayed Jalal Zahabi, Hamed Narimani:
Improved Upper Bounds on the Average Redundancy of Optimal RVLC. IEEE Trans. Commun. 72(5): 2552-2562 (2024)- 2023
- [j12]Sina Jorjani, Hamed Narimani, Foroogh S. Tabataba, Farzad Parvaresh:
On the diversity-multiplexing trade-off of hybrid diamond relay channels. Phys. Commun. 60: 102130 (2023) - [j11]Sayed Jalal Zahabi, Hamed Narimani, Mohammadali Khosravifard:
On the Shortest Codeword of the Optimal RVLC. IEEE Trans. Inf. Theory 69(7): 4740-4745 (2023) - 2022
- [j10]Mojtaba Beheshti, Vahid Shafiei, Hamed Narimani:
Enhanced compressed sensing autofocus for high-resolution airborne synthetic aperture radar. Digit. Signal Process. 127: 103543 (2022) - 2020
- [j9]Hamed Narimani, Mohammadali Khosravifard:
A New Code for Encoding All Monotone Sources With a Fixed Large Alphabet Size. IEEE Trans. Inf. Theory 66(3): 1474-1481 (2020)
2010 – 2019
- 2019
- [j8]Zohreh Fotouhi, Massoud Reza Hashemi, Hamed Narimani, Islam Safak Bayram:
A General Model for EV Drivers' Charging Behavior. IEEE Trans. Veh. Technol. 68(8): 7368-7382 (2019) - 2018
- [j7]Zahra Baharlouei, Hamed Narimani, Massoud Hashemi:
On the Convergence Properties of Autonomous Demand Side Management Algorithms. IEEE Trans. Smart Grid 9(6): 6713-6720 (2018) - 2014
- [j6]Parvin Rastegari, Mohammadali Khosravifard, Hamed Narimani, T. Aaron Gulliver:
On the Structure of the Minimum Average Redundancy Code for Monotone Sources. IEEE Commun. Lett. 18(4): 664-667 (2014) - [j5]Hamed Narimani, Mohammadali Khosravifard:
Huffman Redundancy for Large Alphabet Sources. IEEE Trans. Inf. Theory 60(3): 1412-1427 (2014) - 2013
- [j4]Hamed Narimani, Mohammadali Khosravifard, T. Aaron Gulliver:
How Suboptimal Is the Shannon Code? IEEE Trans. Inf. Theory 59(1): 458-471 (2013) - [j3]Zahra Baharlouei, Massoud Hashemi, Hamed Narimani, Amir Hamed Mohsenian Rad:
Achieving Optimality and Fairness in Autonomous Demand Response: Benchmarks and Billing Mechanisms. IEEE Trans. Smart Grid 4(2): 968-975 (2013) - [c3]Hamed Narimani, Amir Hamed Mohsenian Rad:
Autonomous demand response in heterogeneous smart grid topologies. ISGT 2013: 1-6 - 2012
- [j2]Mohammadali Khosravifard, Hamed Narimani, T. Aaron Gulliver:
A Simple Recursive Shannon Code. IEEE Trans. Commun. 60(2): 295-299 (2012) - [c2]Zahra Baharlouei, Hamed Narimani, Amir Hamed Mohsenian Rad:
Tackling co-existence and fairness challenges in autonomous Demand Side Management. GLOBECOM 2012: 3159-3164 - 2011
- [j1]Hamed Narimani, Mohammadali Khosravifard, T. Aaron Gulliver:
Near-Optimality of the Minimum Average Redundancy Code for Almost All Monotone Sources. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(11): 2092-2096 (2011)
2000 – 2009
- 2009
- [c1]T. Aaron Gulliver, Hamed Narimani, Mohammadali Khosravifard:
Two recursive versions of the Shannon code. ISIT 2009: 209-213
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-10-07 21:26 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:
