default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLiang Zhou 0003
Person information
- affiliation: University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Chengdu, China
Other persons with the same name
- Liang Zhou — disambiguation page
- Liang Zhou 0001
![[0000-0002-0462-4131]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0002-0462-4131")
— University of Stuttgart, VISUS, Germany (and 1 more) - Liang Zhou 0002 — Nanjing University of Posts and Telecommunications, Key Laboratory of Broadband Wireless Communications and Sensor Network Technology, China (and 3 more)
- Liang Zhou 0004 — Washington University in Saint Louis, Department of Computer Science and Engineering, MO, USA
- Liang Zhou 0005 — Cergy-Pontoise University, France
- Liang Zhou 0006 — University of California, Riverside, USA
- Liang Zhou 0007 — Inalambrica Oy, Finland (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j25]Chenming Yang, Hui Wen, Bryan Hooi, Liang Zhou:
CapMax: A Framework for Dynamic Network Representation Learning From the View of Multiuser Communication. IEEE Trans. Neural Networks Learn. Syst. 35(4): 4554-4566 (2024)- 2023
- [j24]Chenming Yang, Hui Wen, Bryan Hooi, Yue Wu, Liang Zhou:
A multi-scale reconstruction method for the anomaly detection in stochastic dynamic networks. Neurocomputing 518: 482-495 (2023) - [j23]Chenming Yang, Jingjing Li, Ke Lu, Bryan Hooi, Liang Zhou:
Continuous-time graph directed information maximization for temporal network representation. Inf. Sci. 644: 119240 (2023) - 2022
- [j22]Yingying Huangfu, Liang Zhou:
Anomaly Detection of Wireless Relays Based on Markov Models Through the Wald-Wolfowitz Runs Test. IEEE Commun. Lett. 26(11): 2562-2566 (2022) - [j21]Xuan He, Kui Cai, Liang Zhou:
A Class of Optimal Structures for Node Computations in Message Passing Algorithms. IEEE Trans. Inf. Theory 68(1): 93-104 (2022) - [j20]Yingying Huangfu, Liang Zhou, Fan Zhou:
A New Abnormal Node Detection Method With Dynamic Hoeffding Test. IEEE Wirel. Commun. Lett. 11(8): 1595-1599 (2022) - [c16]Yunfei Tai, Kezhen Li, Liang Zhou, Shu Liu, Xilin Zhang:
An Improved CA-SCL Decoding Algorithm for Polar Code. ISNCC 2022: 1-5 - 2021
- [j19]Shu Liu, Ivan Tjuawinata, Liang Zhou:
List Decodability of Linear Subcodes of Gabidulin Codes. IEEE Commun. Lett. 25(2): 356-360 (2021) - [c15]Yingying Huangfu, Liang Zhou, Fan Zhou:
Detecting Abnormal Nodes in Cluster-tree Networks via the Likelihood Ratio Test of Packet Losses. GLOBECOM 2021: 1-6 - 2020
- [j18]Zhiheng Zhou, Jingmin Kang, Liang Zhou:
Joint BATS Code and Periodic Scheduling in Multihop Wireless Networks. IEEE Access 8: 29690-29701 (2020) - [j17]Shenglong Peng, Liang Zhou, Junyi Du, Xuan He:
A logically centralized slotted ALOHA-based scheme for broadcast services in vehicular ad hoc networks. Trans. Emerg. Telecommun. Technol. 31(12) (2020) - [j16]Shenglong Peng, Liang Zhou, Xuan He, Junyi Du:
GPS-aided inter-microcell interference avoidance for request-transmission splitting slotted ALOHA-based scheme in smart cities with connected vehicles. Future Gener. Comput. Syst. 108: 501-511 (2020) - [j15]Zhe Zhang, Liang Zhou, Junyi Du, Yue Zhao:
Design of a Labeling Scheme for 32-QAM Delayed Bit-Interleaved Coded Modulation. Sensors 20(12): 3528 (2020) - [j14]Xianhua Niu, Chaoping Xing, Yang Liu, Liang Zhou:
A Construction of Optimal Frequency Hopping Sequence Set via Combination of Multiplicative and Additive Groups of Finite Fields. IEEE Trans. Inf. Theory 66(8): 5310-5315 (2020) - [c14]Kunyu Liu, Liang Zhou:
Routing Authentication Chain Mechanism to Resist AODV Black Hole Attacks. ICCSP 2020: 53-57 - [i3]Xuan He, Kui Cai, Liang Zhou:
A Class of Optimal Structures for Node Computations in Message Passing Algorithms. CoRR abs/2009.02535 (2020)
2010 – 2019
- 2019
- [j13]Shenglong Peng, Liang Zhou, Xuan He, Junyi Du, Yong Liang Guan:
A Request-Transmission Splitting Scheme for V2X Networks: Design and Throughput Analysis. IEEE Access 7: 158317-158325 (2019) - [j12]Xing Liu, Liang Zhou:
Improved Singleton bound on frequency hopping sequences and optimal constructions. Des. Codes Cryptogr. 87(8): 1713-1733 (2019) - [j11]Xing Liu, Liang Zhou:
Correction to: Improved Singleton bound on frequency hopping sequences and optimal constructions. Des. Codes Cryptogr. 87(8): 1735-1736 (2019) - [j10]Yi Liu, Xiaoyan Kuai, Xiaojun Yuan, Ying-Chang Liang, Liang Zhou:
Learning-Based Iterative Interference Cancellation for Cognitive Internet of Things. IEEE Internet Things J. 6(4): 7213-7224 (2019) - [j9]Xing Liu, Liang Zhou, Shengqiang Li:
A New Method to Construct Strictly Optimal Frequency Hopping Sequences With New Parameters. IEEE Trans. Inf. Theory 65(3): 1828-1844 (2019) - [c13]Xing Liu, Liang Zhou, Qi Zeng, Xianhua Niu:
On the Average Hamming Correlation of Frequency-Hopping Sequence Sets with Low Hit Zone. ISNCC 2019: 1-6 - [c12]Shenglong Peng, Xuan He, Junyi Du, Yong Liang Guan, Liang Zhou:
A TDMA-like Access Scheme with Splitting Request and Transmission for Vehicular Networks. WCNC 2019: 1-5 - [i2]Shenglong Peng, Xuan He, Junyi Du, Yong Liang Guan, Liang Zhou:
A TDMA-like Access Scheme with Splitting Request and Transmission for Vehicular Networks. CoRR abs/1905.05431 (2019) - 2018
- [j8]Junyi Du, Liang Zhou, Lei Yang, Shenglong Peng, Jinhong Yuan:
A New LDPC Coded Scheme for Two-User Gaussian Multiple Access Channels. IEEE Commun. Lett. 22(1): 21-24 (2018) - [j7]Xing Liu, Liang Zhou:
New Bound on Partial Hamming Correlation of Low-Hit-Zone Frequency Hopping Sequences and Optimal Constructions. IEEE Commun. Lett. 22(5): 878-881 (2018) - [j6]Xuan He, Liang Zhou, Junyi Du:
A New Multi-Edge Metric-Constrained PEG Algorithm for Designing Binary LDPC Code With Improved Cycle-Structure. IEEE Trans. Commun. 66(1): 14-25 (2018) - [j5]Xuan He, Liang Zhou, Junyi Du:
PEG-Like Design of Binary QC-LDPC Codes Based on Detecting and Avoiding Generating Small Cycles. IEEE Trans. Commun. 66(5): 1845-1858 (2018) - 2017
- [j4]Junyi Du, Lei Yang, Jinhong Yuan, Liang Zhou, Xuan He:
Bit Mapping Design for LDPC Coded BICM Schemes With Multi-Edge Type EXIT Chart. IEEE Commun. Lett. 21(4): 722-725 (2017) - [c11]Yingying Huangfu, Liang Zhou, Chenming Yang:
Routing the Cyber-Attack Path with the Bayesian Network Deducing Approach. CyberC 2017: 5-10 - [c10]Junyi Du, Liang Zhou, Xuan He, Shenglong Peng:
A New LDPC Coded Scheme for Two-User Multiple-Access Channels Aided with Physical-Layer Network Coding. GLOBECOM Workshops 2017: 1-6 - [c9]Junyi Du, Liang Zhou, Zhe Zhang, Lei Yang, Jinhong Yuan:
Regular and Irregular LDPC Code Design for Bandwidth Efficient BICM Schemes. GLOBECOM 2017: 1-6 - [c8]Zhe Zhang, Liang Zhou, Junyi Du, Shenglong Peng:
An algebraic approach to design low rate low density parity check code. WCSP 2017: 1-6 - 2016
- [j3]Hongwei Li, Kun Jia, Haomiao Yang, Dongxiao Liu, Liang Zhou:
Practical blacklist-based anonymous authentication scheme for mobile crowd sensing. Peer-to-Peer Netw. Appl. 9(4): 762-773 (2016) - [j2]Hongwei Li, Yi Yang, Tom H. Luan, Xiaohui Liang, Liang Zhou, Xuemin Sherman Shen:
Enabling Fine-Grained Multi-Keyword Search Supporting Classified Sub-Dictionaries over Encrypted Cloud Data. IEEE Trans. Dependable Secur. Comput. 13(3): 312-325 (2016) - [c7]Junyi Du, Lei Yang, Jinhong Yuan, Liang Zhou, Xuan He:
Bit Mapping Design for LDPC Coded BICM Schemes with Binary Physical-Layer Network Coding. GLOBECOM 2016: 1-6 - [c6]Junyi Du, Jinhong Yuan, Liang Zhou, Xuan He:
A progressive edge growth algorithm for bit mapping design of LDPC coded BICM schemes. ISIT 2016: 2129-2133 - [i1]Xuan He, Liang Zhou, Junyi Du:
The New Multi-Edge Metric-Constrained PEG/QC-PEG Algorithms for Designing the Binary LDPC Codes With Better Cycle-Structures. CoRR abs/1605.05123 (2016) - 2015
- [c5]Junyi Du, Liang Zhou, Xuan He:
The Joint Demodulation and Decoding for BICM-ID System with BEC Approximation and Optimized Bit Mapping. GLOBECOM 2015: 1-6 - [c4]Xuan He, Liang Zhou, Junyi Du, Zhiping Shi:
The multi-step PEG and ACE constrained PEG algorithms can design the LDPC codes with better cycle-connectivity. ISIT 2015: 46-50 - [c3]Hongwei Li, Shenmin Zhang, Tom H. Luan, Hao Ren, Yuanshun Dai, Liang Zhou:
Enabling efficient publicly verifiable outsourcing computation for matrix multiplication. ITNAC 2015: 44-50 - 2014
- [j1]Hongwei Li, Rongxing Lu, Liang Zhou, Bo Yang, Xuemin Shen:
An Efficient Merkle-Tree-Based Authentication Scheme for Smart Grid. IEEE Syst. J. 8(2): 655-663 (2014) - 2013
- [c2]Qi Li, Hongwei Li, Yi Yang, Hongwei Luo, Bong Jun Choi, Liang Zhou:
ESO: An efficient and secure outsourcing scheme for smart grid. WCSP 2013: 1-6
2000 – 2009
- 2007
- [c1]Zhiping Shi, Liang Zhou:
A Combining Decoding Method of LDPC Codes for HARQ. FGCN (2) 2007: 248-251
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-10-31 21:08 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:
