default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAria Ghasemian Sahebi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j4]S. Sandeep Pradhan
, Mohsen Heidari, Aria Ghasemian Sahebi:
Corrections to "Abelian Group Codes for Channel Coding and Source Coding". IEEE Trans. Inf. Theory 64(5): 3953 (2018)- 2016
- [j3]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
An Achievable Rate Region for the Three-User Interference Channel Based on Coset Codes. IEEE Trans. Inf. Theory 62(3): 1250-1279 (2016) - 2015
- [j2]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Abelian Group Codes for Channel Coding and Source Coding. IEEE Trans. Inf. Theory 61(5): 2399-2414 (2015) - 2014
- [c11]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for some multi-terminal communications problems. ISIT 2014: 316-320 - [i9]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested Polar Codes Achieve the Shannon Rate-Distortion Function and the Shannon Capacity. CoRR abs/1401.6482 (2014) - [i8]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar Codes for Multi-terminal Communications. CoRR abs/1401.7006 (2014) - [i7]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
An Achievable rate region for the $3-$user interference channel based on coset codes. CoRR abs/1403.4583 (2014) - 2013
- [j1]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel Channel Polarization for Arbitrary Discrete Memoryless Channels. IEEE Trans. Inf. Theory 59(12): 7839-7857 (2013) - [c10]Farhad Shirani Chaharsooghi, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Distributed source coding in absence of common components. ISIT 2013: 1362-1366 - [c9]Hamid Nejati, Ahmad Beirami, Aria Ghasemian Sahebi, Warsame H. Ali:
Variability analysis of tent map-based chaotic-map truly random number generators. MWSCAS 2013: 157-160 - [i6]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Abelian Group Codes for Source Coding and Channel Coding. CoRR abs/1305.1598 (2013) - 2012
- [c8]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Polar codes for sources with finite reconstruction alphabets. Allerton Conference 2012: 580-586 - [c7]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On distributed source coding using Abelian group codes. Allerton Conference 2012: 2068-2074 - [c6]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested lattice codes for arbitrary continuous sources and channels. ISIT 2012: 626-630 - [c5]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Codes over non-Abelian groups: Point-to-point communications and computation over MAC. ISIT 2012: 631-635 - [c4]Arun Padakandla, Aria Ghasemian Sahebi, S. Sandeep Pradhan:
A new achievable rate region for the 3-user discrete memoryless interference channel. ISIT 2012: 2256-2260 - [i5]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Asymptotically Good Codes Over Non-Abelian Groups. CoRR abs/1202.0863 (2012) - [i4]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Nested Lattice Codes for Arbitrary Continuous Sources and Channels. CoRR abs/1202.0864 (2012) - 2011
- [c3]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel polarization of polar codes over arbitrary discrete memoryless channels. Allerton 2011: 1718-1725 - [c2]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On the capacity of Abelian group codes over discrete memoryless channels. ISIT 2011: 1743-1747 - [i3]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
On the Capacity of Abelian Group Codes Over Discrete Memoryless Channels. CoRR abs/1102.3243 (2011) - [i2]Aria Ghasemian Sahebi, S. Sandeep Pradhan:
Multilevel Polarization of Polar Codes Over Arbitrary Discrete Memoryless Channels. CoRR abs/1107.1535 (2011)
2000 – 2009
- 2008
- [c1]Hamed Firouzi, Massoud Babaie-Zadeh, Aria Ghasemian Sahebi, Christian Jutten:
A first step to convolutive sparse representation. ICASSP 2008: 1921-1924 - [i1]Hamed Firouzi, Massoud Babaie-Zadeh, Aria Ghasemian Sahebi, Christian Jutten:
A First Step to Convolutive Sparse Representation. CoRR abs/0809.3485 (2008)
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 23:21 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:
