default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun He 0002
Person information
- affiliation: National University of Singapore
Other persons with the same name
- Jun He — disambiguation page
- Jun He 0001
![[0000-0001-5201-4445]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-5201-4445")
— Uppsala University, Sweden (and 1 more) - Jun He 0003 — University of Pittsburgh, PA, USA
- Jun He 0004 — Nottingham Trent University, School of Science and Technology, UK (and 2 more)
- Jun He 0005 — Huawei Techologies, Nanjing, China
- Jun He 0006 — Nanjing University of Information Science and Technology, China (and 1 more)
- Jun He 0007 — The University of Nottingham, Ningbo, China
- Jun He 0008 — Renmin University of China, Beijing, China
- Jun He 0009 — Beijing Normal University, China
- Jun He 0010 — University of Arizona, USA (and 1 more)
- Jun He 0011 — University of Michigan-Dearborn, USA
- Jun He 0012 — Southwest University, School of Computer and Information Science, Chongqing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j3]Jun He, Pooi Yuen Kam:
Orthogonal Space-Time Block Codes in Vehicular Environments: Optimum Receiver Design and Performance Analysis. EURASIP J. Wirel. Commun. Netw. 2009 (2009)- [j2]Jun He, Pooi Yuen Kam:
Performance analysis of orthogonal space-time block codes over time-selective channels, and applications to code design of Gi systems. IEEE Trans. Commun. 57(3): 707-715 (2009) - 2008
- [j1]Jun He, Pooi Yuen Kam:
Cooperative space-time block coding with amplify-and-forward strategy: Exact bit error probability and adaptive forwarding schemes. Phys. Commun. 1(3): 209-220 (2008)
Conference and Workshop Papers
- 2008
- [c7]Jun He, Pooi Yuen Kam:
Optimum Space-Time Block Codes over Time-Selective Channels. GLOBECOM 2008: 3654-3658 - [c6]Jun He, Pooi Yuen Kam:
Orthogonal Space-Time Block Codes over Semi-Identical Channels with Channel Estimation. GLOBECOM 2008: 4346-4350 - [c5]Jun He, Pooi Yuen Kam:
Exact Bit Error Probability of Cooperative Space-Time Block Coding with Amplify-and-Forward Strategy. ICC 2008: 4591-4595 - [c4]Jun He, Pooi Yuen Kam:
Adaptive Cooperative Space-Time Block Coding with Amplify-And-Forward Strategy. VTC Spring 2008: 1236-1240 - 2007
- [c3]Jun He, Pooi Yuen Kam:
Bit Error Performance of Orthogonal Space-Time Block Codes over Time-Selective Channel. ICC 2007: 4604-4609 - [c2]Jun He, Pooi Yuen Kam:
On the Performance of Distributed Space-Time Block Coding Over Nonidentical Ricean Channels and the Optimum Power Allocation. ICC 2007: 5592-5597 - 2006
- [c1]Jun He, Pooi Yuen Kam:
On the Performance of Orthogonal Space-Time Block Codes over Independent, Nonidentical Rayleigh/Ricean Fading Channels. GLOBECOM 2006
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-11-19 21:43 CET 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:
