default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHui Han 0002
Person information
- affiliation: Xidian University, School of Computer Science and Technology, Xi'an, China
Other persons with the same name
- Hui Han — disambiguation page
- Hui Han 0001 — Yahoo! Inc., Sunnyvale, USA (and 1 more)
- Hui Han 0003
![[0000-0001-9320-3808]](https://dblp.uni-trier.de./img/orcid-mark.12x12.png "0000-0001-9320-3808")
— Technical University of Madrid, Engineering Management, Business Administration and Statistics Department, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Guochen Ma, Xiaopeng Jiao, Jianjun Mu, Hui Han, Yaming Yang:
Deep Learning-Based Detection for Marker Codes Over Insertion and Deletion Channels. IEEE Trans. Commun. 72(10): 5945-5959 (2024)- [i1]Guochen Ma, Xiaopeng Jiao, Jianjun Mu, Hui Han, Yaming Yang:
Deep Learning-Based Detection for Marker Codes over Insertion and Deletion Channels. CoRR abs/2401.01155 (2024) - 2023
- [j10]Hui Han, Jianjun Mu, Xiaopeng Jiao, Yu-Cheng He, Zhanzhan Zhao:
Constructions of multi-permutation codes correcting a single burst of deletions. Des. Codes Cryptogr. 91(5): 1923-1934 (2023) - [j9]Zhanzhan Zhao, Xiaopeng Jiao, Jianjun Mu, Hui Han, Yu-Cheng He:
Momentum-Based Symbol Flipping Decoding Algorithms for Non-Binary LDPC Codes. IEEE Trans. Veh. Technol. 72(7): 9579-9584 (2023) - 2022
- [j8]Guochen Ma, Xiaopeng Jiao, Jianjun Mu, Hui Han, Yu-Cheng He:
A Single-Round File Synchronization Scheme From Insertions and Deletions With Low Redundancy. IEEE Commun. Lett. 26(10): 2252-2256 (2022) - [j7]Xiaopeng Jiao, Haiyang Liu, Jianjun Mu, Hui Han, Yu-Cheng He:
On Prefixed Varshamov-Tenengolts Codes for Segmented Edit Channels. IEEE Trans. Commun. 70(3): 1535-1545 (2022) - 2021
- [j6]Hui Han, Jianjun Mu, Yu-Cheng He, Xiaopeng Jiao, Wenping Ma:
Rate-Improved Permutation Codes for Correcting a Single Burst of Deletions. IEEE Commun. Lett. 25(1): 49-53 (2021) - [j5]Guochen Ma, Xiaopeng Jiao, Jianjun Mu, Yu-Cheng He, Hui Han:
Maximum-Likelihood Deletion Error Location for Decoding Marker Guess & Check Codes. IEEE Commun. Lett. 25(8): 2497-2501 (2021) - 2020
- [j4]Hui Han, Jianjun Mu, Yu-Cheng He, Xiaopeng Jiao, Wenping Ma:
Multi-Permutation Codes Correcting a Single Burst Unstable Deletions in Flash Memory. IEEE Commun. Lett. 24(4): 720-724 (2020)
2010 – 2019
- 2019
- [j3]Jianjun Mu, Hui Han, Yu-Cheng He, Xuan Zhang, Junjun Guo:
Multi-Permutation Codes Correcting a Single Burst Unstable Erasure. IEEE Commun. Lett. 23(4): 572-575 (2019) - [j2]Hui Han, Jianjun Mu, Yu-Cheng He, Xiaopeng Jiao:
Coset Partitioning Construction of Systematic Permutation Codes Under the Chebyshev Metric. IEEE Trans. Commun. 67(6): 3842-3851 (2019) - 2018
- [j1]Hui Han, Jianjun Mu, Xiaopeng Jiao, Yu-Cheng He:
Codes Correcting a Burst of Deletions for Permutations and Multi-Permutations. IEEE Commun. Lett. 22(10): 1968-1971 (2018)
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-01-21 00:13 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:
