default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHamid Ghourchian
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[b1]Hamid Ghourchian:
On Secure and Sequential Source Coding. Royal Institute of Technology, Stockholm, Sweden, 2023- [c4]Hamid Ghourchian, Tobias J. Oechtering, Mikael Skoglund:
Secure Block Joint Source-Channel Coding with Sequential Encoding. ISIT 2023: 2732-2737 - [i6]Hamid Ghourchian, Tobias J. Oechtering, Mikael Skoglund:
Secure Block Joint Source-Channel Coding with Sequential Encoding. CoRR abs/2305.06038 (2023) - 2021
- [j5]Sina Molavipour
, Hamid Ghourchian, Germán Bassi, Mikael Skoglund:
Neural Estimator of Information for Time-Series Data with Dependency. Entropy 23(6): 641 (2021) - [j4]Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Secure Block Source Coding With Sequential Encoding. IEEE J. Sel. Areas Inf. Theory 2(1): 32-48 (2021) - [c3]Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder. ITW 2021: 1-6 - [i5]Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Secure Block Source Coding with Sequential Encoding. CoRR abs/2108.13295 (2021) - [i4]Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder. CoRR abs/2109.01613 (2021)
2010 – 2019
- 2019
- [c2]Hamid Ghourchian, Photios A. Stavrou, Tobias J. Oechtering, Mikael Skoglund:
Block Source Coding with Sequential Encoding. ITW 2019: 1-5 - 2018
- [j3]Hamid Ghourchian, Arash Amini, Amin Gohari:
How Compressible Are Innovation Processes? IEEE Trans. Inf. Theory 64(7): 4843-4871 (2018) - [j2]Hamid Ghourchian, Gholamali Aminian, Amin Gohari, Mahtab Mirmohseni, Masoumeh Nasiri-Kenari:
On the Capacity of a Class of Signal-Dependent Noise Channels. IEEE Trans. Inf. Theory 64(12): 7828-7846 (2018) - 2017
- [j1]Hamid Ghourchian, Amin Gohari, Arash Amini:
Existence and Continuity of Differential Entropy for a Class of Distributions. IEEE Commun. Lett. 21(7): 1469-1472 (2017) - [c1]Gholamali Aminian, Hamid Ghourchian, Amin Gohari, Mahtab Mirmohseni, Masoumeh Nasiri-Kenari:
On the capacity of signal dependent noise channels. IWCIT 2017: 1-6 - [i3]Hamid Ghourchian, Gholamali Aminian, Amin Gohari, Mahtab Mirmohseni, Masoumeh Nasiri-Kenari:
On the Capacity of Signal Dependent Noise Channels. CoRR abs/1702.03590 (2017) - [i2]Hamid Ghourchian, Amin Gohari, Arash Amini:
Existence and Continuity of Differential Entropy for a Class of Distributions. CoRR abs/1703.09518 (2017) - [i1]Hamid Ghourchian, Arash Amini, Amin Gohari:
How Compressible are Sparse Innovation Processes? CoRR abs/1703.09537 (2017)
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-24 22:46 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:
