


default search action
Jinnan Piao
Person information
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
- [j7]Xiaodi Zhang
, Dong Li
, Jinnan Piao
:
Maximum Latency Prediction Based on Random Forests and Gradient Boosting Machine for AVB Traffic in TSN. IEEE Commun. Lett. 29(2): 264-268 (2025) - [j6]Jinnan Piao
, Dong Li
, Jindi Liu, Xueting Yu, Zhibo Li, Ming Yang, Peng Zeng
:
Construction Methods Based on Minimum Weight Distribution for Polar Codes With Successive Cancellation List Decoding. IEEE Trans. Commun. 73(3): 1444-1457 (2025) - [i7]Jinnan Piao, Dong Li, Yiming Sun, Zhibo Li, Ming Yang, Xueting Yu:
Iterative Joint Detection of Kalman Filter and Channel Decoder for Sensor-to-Controller Link in Wireless Networked Control Systems. CoRR abs/2504.18022 (2025) - 2023
- [i6]Jinnan Piao, Dong Li, Jindi Liu, Xueting Yu, Zhibo Li, Ming Yang, Peng Zeng:
Construction Methods Based Minimum Weight Distribution for Polar Codes with Successive Cancellation List Decoding. CoRR abs/2303.13019 (2023) - [i5]Jinnan Piao, Dong Li, Xueting Yu, Zhibo Li, Ming Yang, Jindi Liu, Peng Zeng:
Performance Analysis for Polar Codes under Successive Cancellation List Decoding with Fixed List Size. CoRR abs/2306.17496 (2023) - 2021
- [j5]Jinnan Piao
, Kai Niu
, Jincheng Dai
, Lajos Hanzo
:
Polar-Precoding: A Unitary Finite-Feedback Transmit Precoder for Polar-Coded MIMO Systems. IEEE Trans. Veh. Technol. 70(11): 12203-12208 (2021) - [j4]Jincheng Dai
, Jinnan Piao
, Kai Niu
:
Progressive Rate-Filling: A Framework for Agile Construction of Multilevel Polar-Coded Modulation. IEEE Wirel. Commun. Lett. 10(5): 1123-1127 (2021) - [c1]Jincheng Dai, Kai Niu, Jinnan Piao:
Fast Construction of Bit-Interleaved Polar-Coded Modulation. ISIT 2021: 2566-2571 - [i4]Jinnan Piao, Kai Niu, Jincheng Dai, Lajos Hanzo:
Polar-Precoding: A Unitary Finite-Feedback Transmit Precoder for Polar-Coded MIMO Systems. CoRR abs/2104.05178 (2021) - 2020
- [j3]Jinnan Piao
, Kai Niu
, Jincheng Dai
, Chao Dong
:
Sphere Constraint Based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes. IEEE Trans. Veh. Technol. 69(10): 11557-11569 (2020) - [j2]Jinnan Piao
, Kai Niu
, Jincheng Dai
, Chao Dong
:
Approaching the Normal Approximation of the Finite Blocklength Capacity Within 0.025 dB by Short Polar Codes. IEEE Wirel. Commun. Lett. 9(7): 1089-1092 (2020) - [i3]Jinnan Piao, Kai Niu, Jincheng Dai, Chao Dong:
Sphere Constraint based Enumeration Methods to Analyze the Minimum Weight Distribution of Polar Codes. CoRR abs/2003.06773 (2020) - [i2]Jincheng Dai, Jinnan Piao, Kai Niu:
Progressive Rate-Filling: A Framework for Agile Construction of Multilevel Polar-Coded Modulation. CoRR abs/2011.10308 (2020)
2010 – 2019
- 2019
- [j1]Jinnan Piao
, Jincheng Dai
, Kai Niu
:
CRC-Aided Sphere Decoding for Short Polar Codes. IEEE Commun. Lett. 23(2): 210-213 (2019) - [i1]Jinnan Piao, Kai Niu, Jincheng Dai, Chao Dong:
Approaching the Finite Blocklength Capacity within 0.025dB by Short Polar Codes and CRC-Aided Hybrid Decoding. CoRR abs/1910.03254 (2019)
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 2025-05-24 01:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint