default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMingxi Yin
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j5]Shanshan Tu
, Muhammad Waqas, Akhtar Badshah, Mingxi Yin, Ghulam Abbas:
Network Intrusion Detection System (NIDS) Based on Pseudo-Siamese Stacked Autoencoders in Fog Computing. IEEE Trans. Serv. Comput. 16(6): 4317-4327 (2023)- 2021
- [j4]Mingxi Yin, Yuli Yang, Jen-Ming Wu, Bingli Jiao:
Opportunistic Bits in Short-Packet Communications: A Finite Blocklength Perspective. IEEE Trans. Commun. 69(12): 8085-8099 (2021) - [j3]Mingxi Yin, Yuli Yang, Bingli Jiao:
Security-Oriented Trellis Code Design for Spatial Modulation. IEEE Trans. Wirel. Commun. 20(3): 1875-1888 (2021) - [i9]Mingxi Yin, Bingli Jiao, Dongsheng Zheng, Yuli Yang:
A Practical Consideration on Convex Mutual Information. CoRR abs/2105.11272 (2021) - [i8]Bingli Jiao, Mingxi Yin, Yuli Yang:
Application of Opportunistic Bit to Multilevel Codes. CoRR abs/2105.11273 (2021) - 2020
- [j2]Dongsheng Zheng, Yingyang Chen, Mingxi Yin, Bingli Jiao:
Cooperative Cache-Aware Recommendation System for Multiple Internet Content Providers. IEEE Wirel. Commun. Lett. 9(12): 2112-2115 (2020) - [c3]Jialing Chen, Mingxi Yin, Xiaohui Duan, Bingli Jiao:
Q -Learning Based Selection Strategies for Load Balance and Energy Balance in Heterogeneous Networks. ICCCS 2020: 728-732 - [c2]Mingxi Yin, Jinliang Yu, Shanshan Tu, Muhammad Waqas, Sadaqat ur Rehman, Ghulam Abbas, Ziaul Haq Abbas:
An Efficient Approach for Selecting a Secure Relay Node in Fog Computing Social Ties Network. ICAIS (1) 2020: 173-183
2010 – 2019
- 2019
- [j1]Mingxi Yin, Jialing Chen, Bingli Jiao, H. Vincent Poor:
Utilization of Opportunistic-Bits With Paired Transmissions. IEEE Wirel. Commun. Lett. 8(3): 661-664 (2019) - [i7]Bingli Jiao, Yuli Yang, Mingxi Yin:
Cocktail BPSK: Achievable Data Rate beyond Channel Capacity. CoRR abs/1901.06122 (2019) - [i6]Bingli Jiao, Yuli Yang, Mingxi Yin:
A Method Beyond Channel Capacity in the Low SNR Regime: Theoretical Proof and Numerical Confirmation. CoRR abs/1903.00136 (2019) - [i5]Bingli Jiao, Mingxi Yin, Yuli Yang:
Cocktail Intra-Symbol-Codes: Exceeding the Channel Limit of QPSK Input. CoRR abs/1905.08915 (2019) - [i4]Bingli Jiao, Dongsheng Zheng, Mingxi Yin, Yuli Yang:
Beyond the Channel Capacity of BPSK Input. CoRR abs/1908.08836 (2019) - 2018
- [i3]Bingli Jiao, Yuli Yang, Mingxi Yin:
Layered BPSK for High Data Rates. CoRR abs/1809.07537 (2018) - [i2]Bingli Jiao, Yuli Yang, Mingxi Yin:
Cocktail BPSK: Cross Power Utilization for High Data Rates. CoRR abs/1809.10839 (2018) - [i1]Bingli Jiao, Yuli Yang, Mingxi Yin:
Cocktail BPSK: Energy Reused Scheme for High Achievable Data Rates. CoRR abs/1811.01540 (2018) - 2017
- [c1]Yingyang Chen, Mingxi Yin, Bingli Jiao:
An opportunistic-bit transmission scheme with enhanced spectral efficiency. IWSDA 2017: 34-38
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-25 05: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:
