Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jingqiu Gao

dblp:266/4452 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2025
0000-0001-7533-9023ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-author · 2 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Coding theory · 100%
Computer networks
1 paper
Physical-layer communications · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
hybrid ARQ
0.912025
Parity-Check Aided Polarizing Matrix Extension for Efficient IR-HARQ Transmission · IEEE Trans. Commun. 2025
Coding theory › error-correcting codes › block codes › linear code
parity-check codes
0.912025
Parity-Check Aided Polarizing Matrix Extension for Efficient IR-HARQ Transmission · IEEE Trans. Commun. 2025
Coding theory › channel coding
polar codes
0.912025
Parity-Check Aided Polarizing Matrix Extension for Efficient IR-HARQ Transmission · IEEE Trans. Commun. 2025
Physical-layer communications › channel coding
error correction
0.312025
Parity-Check Aided Polarizing Matrix Extension for Efficient IR-HARQ Transmission · IEEE Trans. Commun. 2025

Methods — techniques the papers use, named apart from their topics

subchannel mapping · 1.7simulation · 1.7puncturing algorithms · 1.7
YearPublicationVenuePosition
2025 Parity-Check Aided Polarizing Matrix Extension for Efficient IR-HARQ Transmission
abstract
In this paper, by introducing nested parity-check (PC) functions, a new polarizing matrix extension-based hybrid automatic repeat request (PME-HARQ) scheme, called PC-PME-HARQ, is proposed. Such nested PC functions are constructed through a fixed-length cyclic shift register. This approach significantly enhances error correction capability, particularly for short and medium-length packet transmissions. Besides, a dynamic subchannel mapping and optimization framework is developed, which integrates subchannel reliability and distance spectrum to optimize bit-set configurations for varying transmission conditions. Furthermore, the information set approximation puncturing (ISAP) and reliability score-based puncturing (RSP) algorithms have been modified and optimized to outperform the traditional quasi-uniform puncturing (QUP) algorithm, providing improved rate compatibility and reducing Block Error Rate (BLER) in PME-HARQ systems. Simulation results demonstrate that the proposed PC-PME-HARQ scheme achieves substantial performance gains, offering both coding and diversity gains across multiple retransmissions, effectively surpassing the baseline schemes.
Jingqiu Gao, Pingzhi Fan
IEEE Trans. Commun.1
2021 Successive Cancellation List Flipping for Short Polar Codes Based on Row Weights of Generator Matrix
abstract
Benefiting from the powerful cyclic redundancy check aided successive cancellation list (CA-SCL) decoder, the polar codes have achieved competitive performances with respect to LDCP codes. However, its short codeword performance needs to be further improved for supporting reliable short package transmissions typically in massive machine-type communications (mMTC). In this paper, the short polar coding problem is tackled by developing a bit-flipping aided CA-SCL detection method. First, we reveal that error distribution of SCL decoding strongly relates to the row weights of generator matrix. Accordingly, we determine the flipping indices according to both their row weights and their polarized bit-channel reliabilities. The simulation results show that our row weight based successive cancellation list flipping (RWB-SCL-Flipping) decoding achieves around 0.3 dB gain compared with its counterpart in [1] while transmitting short codewords over AWGN channels.
Hanchen Sun, Jingqiu Gao, Li Li 0011, Zheng Ma 0001, Pingzhi Fan
WCNC2