default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeyman Razaghi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
[j5]Peyman Razaghi, Song-Nam Hong
, Lei Zhou, Wei Yu, Giuseppe Caire:
Two Birds and One Stone: Gaussian Interference Channel With a Shared Out-of-Band Relay of Limited Rate. IEEE Trans. Inf. Theory 59(7): 4192-4212 (2013)- 2012
- [j4]Peyman Razaghi, Giuseppe Caire:
Coarse Network Coding: A Simple Relay Strategy for Two-User Gaussian Interference Channels. IEEE Trans. Inf. Theory 58(10): 6515-6523 (2012) - 2011
- [c10]Peyman Razaghi, Giuseppe Caire:
A nonlinear approach to interference alignment. ISIT 2011: 2741-2745 - [c9]Peyman Razaghi, Giuseppe Caire:
Interference alignment, carrier pairing, and lattice decoding. ISWCS 2011: 572-576 - [i7]Peyman Razaghi, Song-Nam Hong, Lei Zhou, Wei Yu, Giuseppe Caire:
Two Birds and One Stone: Gaussian Interference Channel with a Shared Out-of-Band Relay. CoRR abs/1104.0430 (2011) - [i6]Peyman Razaghi, Giuseppe Caire:
A Nonlinear Approach to Interference Alignment. CoRR abs/1106.0117 (2011) - 2010
- [c8]Peyman Razaghi, Giuseppe Caire:
Relay strategies based on cross-determinism for the broadcast relay channel. Allerton 2010: 936-943 - [c7]Peyman Razaghi, Wei Yu:
Universal relaying for the interference channel. ITA 2010: 552-557 - [i5]Peyman Razaghi, Giuseppe Caire:
Coarse Network Coding: A Simple Relay Strategy to Resolve Interference. CoRR abs/1009.1193 (2010) - [i4]Peyman Razaghi, Giuseppe Caire:
Relay Strategies Based on Cross-Determinism for the Broadcast Relay Channel. CoRR abs/1010.1985 (2010)
2000 – 2009
- 2009
- [j3]Peyman Razaghi, Wei Yu:
Parity Forwarding for Multiple-Relay Networks. IEEE Trans. Inf. Theory 55(1): 158-173 (2009) - [j2]Marko Aleksic, Peyman Razaghi, Wei Yu:
Capacity of a Class of Modulo-Sum Relay Channels. IEEE Trans. Inf. Theory 55(3): 921-930 (2009) - 2007
- [j1]Peyman Razaghi, Babak Hossein Khalaj, Mehrdad Shamsi:
Linear Decoupled and Quasi-Decoupled Space-Time Codes. IEEE Trans. Commun. 55(1): 54-59 (2007) - [c6]Peyman Razaghi, Wei Yu:
A Structured Generalization of Decode-and-Forward Strategies for Multiple-Relay Networks. ISIT 2007: 271-275 - [c5]Marko Aleksic, Peyman Razaghi, Wei Yu:
Capacity of a Class of Modulo-Sum Relay Channels. ISIT 2007: 596-600 - [i3]Marko Aleksic, Peyman Razaghi, Wei Yu:
Capacity of a Class of Modulo-Sum Relay Channels. CoRR abs/0704.3591 (2007) - [i2]Peyman Razaghi, Wei Yu:
Parity Forwarding for Multiple-Relay Networks. CoRR abs/0711.2712 (2007) - 2006
- [c4]Peyman Razaghi, Wei Yu:
Bilayer LDPC Codes for the Relay Channel. ICC 2006: 1574-1579 - [c3]Peyman Razaghi, Wei Yu:
Parity Forwarding For Multiple-Relay Networks. ISIT 2006: 1678-1682 - [i1]Peyman Razaghi, Wei Yu:
Bilayer Low-Density Parity-Check Codes for Decode-and-Forward in Relay Channels. CoRR abs/cs/0609018 (2006) - 2004
- [c2]Peyman Razaghi, Babak Hossein Khalaj:
A novel time-frequency receiver for unknown fast fading channels. WCNC 2004: 1572-1577 - 2003
- [c1]Peyman Razaghi, Babak H. Khalaj:
Linear decoupled space-time codes. PIMRC 2003: 2862-2867
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-09-20 00:42 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:
