default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiongyue Xing
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Jiongyue Xing
, Martin Bossert, Li Chen, Jiasheng Yuan, Sebastian Bitzer:
Shift-Sum Decoding of Non-Binary Cyclic Codes. IEEE Trans. Inf. Theory 70(2): 980-994 (2024)- 2023
- [j6]Haiwen Cao, Jiongyue Xing, Shansuo Liang:
CRC-Aided Sparse Regression Codes for Unsourced Random Access. IEEE Commun. Lett. 27(8): 1944-1948 (2023) - [j5]Teng Lu, Xuan He, Peng Kang, Jiongyue Xing, Xiaohu Tang:
Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes. IEEE Trans. Commun. 71(6): 3207-3220 (2023) - [c9]Yunqi Wan, Jiongyue Xing, Yuliang Huang, Ting-Yi Wu, Bo Bai, Gong Zhang:
The Re-encoding Transform in Algebraic List Decoding of Algebraic Geometric Codes. ISIT 2023: 19-24 - 2022
- [c8]Cheng Lv, Xuan He, Peng Kang, Kui Cai, Jiongyue Xing, Xiaohu Tang:
Mutual Information-Maximizing Quantized Layered Min-Sum Decoding of QC-LDPC Codes. GLOBECOM 2022: 3490-3495 - [i2]Teng Lu, Xuan He, Peng Kang, Jiongyue Xing, Xiaohu Tang:
Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes. CoRR abs/2208.13022 (2022) - 2021
- [j4]Yunqi Wan, Jiongyue Xing:
Low-Complexity Kötter's Interpolation for List Decoding of Elliptic Codes. IEEE Commun. Lett. 25(11): 3473-3477 (2021) - [c7]Jiasheng Yuan, Jiongyue Xing, Li Chen:
Plausibility Analysis of Shift-Sum Decoding for Cyclic Codes. ISIT 2021: 652-657 - 2020
- [j3]Jiongyue Xing, Li Chen, Martin Bossert:
Low-Complexity Chase Decoding of Reed-Solomon Codes Using Module. IEEE Trans. Commun. 68(10): 6012-6022 (2020) - [c6]Jiongyue Xing, Li Chen, Martin Bossert:
Low-Complexity Chase Decoding of Reed-Solomon Codes through Basis Reduction. ISIT 2020: 298-302 - [c5]Jiongyue Xing, Martin Bossert, Sebastian Bitzer, Li Chen:
Iterative Decoding of Non-Binary Cyclic Codes Using Minimum-Weight Dual Codewords. ISIT 2020: 333-337 - [c4]Jianchao Ye, Ting-Yi Wu, Jiongyue Xing, Li Chen:
Iterative Soft Decoding of Reed-Solomon Tail-Biting Convolutional Concatenated Codes. WCSP 2020: 957-961
2010 – 2019
- 2019
- [j2]Jiongyue Xing, Li Chen, Martin Bossert:
Module minimisation based low-complexity soft decoding of Reed-Solomon codes. IET Commun. 13(20): 3489-3499 (2019) - [j1]Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Algebraic Soft-Decision Decoding of Reed-Solomon Codes Using Module Minimization. IEEE Trans. Commun. 67(11): 7379-7391 (2019) - [c3]Jiongyue Xing, Li Chen, Martin Bossert:
Low-Complexity Koetter-Vardy Decoding of Reed-Solomon Codes using Module Minimization. ICC 2019: 1-6 - [c2]Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Module Minimization for Re-encoding Transformed Soft Decoding of RS Codes. ISIT 2019: 1547-1551 - 2018
- [c1]Jiongyue Xing, Li Chen, Martin Bossert:
Progressive Algebraic Soft Decoding of Reed-Solomon Codes Using Module Minimization. ISIT 2018: 11-15 - 2017
- [i1]Jiongyue Xing, Li Chen, Martin Bossert:
Algebraic Soft Decoding Algorithms for Reed-Solomon Codes Using Module. CoRR abs/1712.00938 (2017)
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-20 23:03 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:
