default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPetros Elia
- > Home > Persons > Petros Elia
Publications
- 2012
[j11]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia
, Pankaj Bhambhani:
Large Families of Asymptotically Optimal Two-Dimensional Optical Orthogonal Codes. IEEE Trans. Inf. Theory 58(2): 1163-1185 (2012)- 2009
- [j6]Sameer A. Pawar, K. Raj Kumar, Petros Elia, P. Vijay Kumar, B. A. Sethuraman:
Space-time codes achieving the DMD tradeoff of the MIMO-ARQ channel. IEEE Trans. Inf. Theory 55(7): 3101-3114 (2009) - [j5]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG tradeoff and optimal codes for a class of AF and DF cooperative communication protocols. IEEE Trans. Inf. Theory 55(7): 3161-3185 (2009) - [c10]Petros Elia, P. Vijay Kumar:
Space-time codes that are approximately universal for the parallel, multi-block and cooperative DDF channels. ISIT 2009: 2813-2817 - [i7]Reza Omrani, Gagan Garg, P. Vijay Kumar, Petros Elia, Pankaj Bhambhani:
Large Families of Optimal Two-Dimensional Optical Orthogonal Codes. CoRR abs/0911.0143 (2009) - 2007
- [j4]Petros Elia, Frédérique E. Oggier, P. Vijay Kumar:
Asymptotically optimal cooperative wireless networks with reduced signaling complexity. IEEE J. Sel. Areas Commun. 25(2): 258-267 (2007) - [j3]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes for Any Number of Antennas. IEEE Trans. Inf. Theory 53(11): 3853-3868 (2007) - [c7]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols. ISIT 2007: 681-685 - [i5]Petros Elia, P. Vijay Kumar:
Approximately-Universal Space-Time Codes for the Parallel, Multi-Block and Cooperative-Dynamic-Decode-and-Forward Channels. CoRR abs/0706.3502 (2007) - 2006
- [j1]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving the Diversity-Multiplexing Gain Tradeoff. IEEE Trans. Inf. Theory 52(9): 3869-3884 (2006) - [c5]Petros Elia, P. Vijay Kumar:
Constructions of Cooperative Diversity Schemes for Asynchronous Wireless Networks. ISIT 2006: 2724-2728 - [c4]Petros Elia, P. Vijay Kumar, Frédérique E. Oggier:
Asymptotically Optimal Cooperative Wireless Networks without Constellation Expansion. ISIT 2006: 2729-2733 - [i4]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit Space-Time Codes Achieving The Diversity-Multiplexing Gain Tradeoff. CoRR abs/cs/0602054 (2006) - [i3]Petros Elia, K. Vinodh, M. Anand, P. Vijay Kumar:
D-MG Tradeoff and Optimal Codes for a Class of AF and DF Cooperative Communication Protocols. CoRR abs/cs/0611156 (2006) - 2005
- [c3]Petros Elia, K. Raj Kumar, Sameer A. Pawar, P. Vijay Kumar, Hsiao-feng Lu:
Explicit space-time codes that achieve the diversity-multiplexing gain tradeoff. ISIT 2005: 896-900 - [c2]Sameer A. Pawar, K. Raj Kumar, P. Vijay Kumar, Petros Elia, B. A. Sethuraman:
Achieving the DMD tradeoff of the MIMO-ARQ channel. ISIT 2005: 901-905 - [i2]Petros Elia, B. A. Sethuraman, P. Vijay Kumar:
Perfect Space-Time Codes with Minimum and Non-Minimum Delay for Any Number of Antennas. CoRR abs/cs/0512023 (2005) - [i1]Petros Elia, P. Vijay Kumar:
Approximately universal optimality over several dynamic and non-dynamic cooperative diversity schemes for wireless networks. CoRR abs/cs/0512028 (2005) - 2004
- [c1]Reza Omrani, Petros Elia, P. Vijay Kumar:
New Constructions and Bounds for 2-D Optical Orthogonal Codes. SETA 2004: 389-395
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-07-31 21:39 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:
