default search action
Ke Lai
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j14]Yanbing Yang
, Jing Lei, Ke Lai:
Dual-mode codeword position index based SCMA with transmit diversity. IET Commun. 18(17): 1002-1017 (2024) - [j13]Ke Lai
Sparse Code Multiple Access With Enhanced K-Repetition Scheme: Analysis and Design. IEEE Trans. Wirel. Commun. 23(6): 5301-5315 (2024) - 2023
- [j12]Zehan Wan, Ying Huang, Jing Lei, Ke Lai, Luying Huang:
Energy-efficient covert communication with adaptive assist nodes group. IET Commun. 17(7): 797-806 (2023) - 2022
- [j11]Ke Lai
Analyzing Uplink Grant-Free Sparse Code Multiple Access System in Massive IoT Networks. IEEE Internet Things J. 9(7): 5561-5577 (2022) - [c5]Zhe Deng, Ke Lai, Jing Lei:
A Temporal Convolutional Network Based on Bayesian Optimization for Frequency Hopping Prediction. ICAIT 2022: 13-18 - [c4]Yuliang Dong, Jing Lei, Ying Huang, Ke Lai:
A Look at OTFS from a Hybrid Carrier Perspective. IWSDA 2022: 1-5 - [i2]Ke Lai, Zilong Liu, Jing Lei, Lei Wen, Gaojie Chen, Pei Xiao:
A Novel K-Repetition Design for SCMA. CoRR abs/2205.08149 (2022) - 2021
- [c3]Shuiqin Wang, Ke Lai, Jing Lei, Lei Wen:
Low PAPR SCMA Systems Based on Carrier Techniques. ICCC 2021: 370-375 - [c2]Zichao Chai, Wei Liu, Ke Lai, Jing Lei:
Clock Synchronization Based on Physical-layer Pulse and Timestamp Free Mechanism in 5G. WCSP 2021: 1-5 - [i1]Ke Lai, Jing Lei, Yansha Deng, Lei Wen, Gaojie Chen:
Analyzing Uplink Grant-free Sparse Code Multiple Access System in Massive IoT Networks. CoRR abs/2103.10241 (2021) - 2020
- [j10]Liang He
A Fast Encoding of 3GPP MBMS Raptor Codes Based on Operation Instruction. IEEE Commun. Lett. 24(1): 3-6 (2020) - [j9]Xiaohuan Peng
Low complexity receiver of sparse code multiple access based on dynamic trellis. IET Commun. 14(9): 1420-1427 (2020) - [j8]Ke Lai
Codeword Position Index Modulation Design for Sparse Code Multiple Access System. IEEE Trans. Veh. Technol. 69(11): 13273-13288 (2020)
2010 – 2019
- 2019
- [j7]Xinjin Lu
Physical Layer Encryption Algorithm Based on Polar Codes and Chaotic Sequences. IEEE Access 7: 4380-4390 (2019) - [j6]Lei Wen, Razieh Razavi, Jing Lei, Ke Lai, Jie Zhong:
Uplink multi-carrier multiple access scheme LDS-IOTA. IET Commun. 13(14): 2163-2167 (2019) - [j5]Ke Lai
Secure Transmission With Interleaver for Uplink Sparse Code Multiple Access System. IEEE Wirel. Commun. Lett. 8(2): 336-339 (2019) - [j4]Ke Lai
Codeword Position Index Based Sparse Code Multiple Access System. IEEE Wirel. Commun. Lett. 8(3): 737-740 (2019) - 2018
- [j3]Ke Lai
Secure Transmission With Randomized Constellation Rotation for Downlink Sparse Code Multiple Access System. IEEE Access 6: 5049-5063 (2018) - [j2]Ke Lai
Sub-Graph Based Joint Sparse Graph for Sparse Code Multiple Access Systems. IEEE Access 6: 25066-25080 (2018) - [j1]Ke Lai, Lei Wen, Jing Lei, Jie Zhong, Gaojie Chen, XiaoTian Zhou:
Simplified sparse code multiple access receiver by using truncated messages. IET Commun. 12(16): 1937-1945 (2018) - 2016
- [c1]Ke Lai, Erbao Li, Jing Lei:
Threshold-based extended minimum-sum algorithm for non-binary LDPC codes. WCSP 2016: 1-5
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-12-10 21:41 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: