Hanwen Yao

Orcid: 0000-0002-3854-1481

According to our database1, Hanwen Yao authored at least 19 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A Deterministic Algorithm for Computing the Weight Distribution of Polar Code.
IEEE Trans. Inf. Theory, May, 2024

2023
Efficient Algorithms for the Bee-Identification Problem.
IEEE J. Sel. Areas Inf. Theory, 2023

Belief Propagation Decoding of Quantum LDPC Codes with Guided Decimation.
CoRR, 2023

Design, Performance, and Complexity of CRC-Aided List Decoding of Convolutional and Polar Codes for Short Messages.
CoRR, 2023

On the number of distinct <i>k</i>-decks: Enumeration and bounds.
Adv. Math. Commun., 2023

2022
Polar Coded Modulation via Hybrid Bit Labeling.
Proceedings of the IEEE International Symposium on Information Theory, 2022

2021
List Decoding of Arıkan's PAC Codes.
Entropy, 2021

Computing Permanents on a Trellis.
CoRR, 2021

Channel Combining for Nonstationary Polarization on Erasure Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

A Deterministic Algorithm for Computing the Weight Distribution of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Efficient Bee Identification.
Proceedings of the IEEE International Symposium on Information Theory, 2021

List Decoding of Polar Codes: How Large Should the List Be to Achieve ML Decoding?
Proceedings of the IEEE International Symposium on Information Theory, 2021

Polar List Decoding for Large Polarization Kernels.
Proceedings of the IEEE Globecom 2021 Workshops, Madrid, Spain, December 7-11, 2021, 2021

2020
Polar Codes with Balanced Codewords.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Hardness of Successive-Cancellation Decoding of Linear Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2020

2019
Explicit Polar Codes with Small Scaling Exponent.
Proceedings of the IEEE International Symposium on Information Theory, 2019

Convolutional Decoding of Polar Codes.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On the Number of Distinct k-Decks: Enumeration and Bounds.
Proceedings of the 19th International Symposium on Communications and Information Technologies, 2019

A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes.
Proceedings of the 2019 IEEE Global Communications Conference, 2019


  Loading...