Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDShu Liu 0004
Person information
- affiliation: University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Chengdu, China
- affiliation (PhD 2018): Nanyang Technological University, Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Singapore
Other persons with the same name
- Shu Liu — disambiguation page
- Shu Liu 0001 — University of Notre Dame, Department of Computer Science and Engineering, USA
- Shu Liu 0002
![[0000-0003-0797-5807]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-0797-5807")
— Central South University, School of Computer Science and Engineering, China (and 1 more) - Shu Liu 0003 — Chinese Academy of Sciences, State Key Laboratory of Molecular Reaction Dynamics, Dalian Institute ofChemical Physics, Dalian, China
- Shu Liu 0005 — YouTu Lab, Tencent, China (and 1 more)
- Shu Liu 0006 — Colorado State University Libraries, Digital Repositories Services, Fort Collins, CO, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j15]Shu Liu, Ting-Yi Wu, Chaoping Xing, Chen Yuan:
On Lengths of Singleton-Optimal Locally Repairable Codes. IEEE Trans. Commun. 72(1): 3-12 (2024)- 2023
- [j14]Jin Yi Chen, Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing:
Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules. IEEE Trans. Commun. 71(10): 5623-5632 (2023) - [j13]Shu Liu, Chaoping Xing:
Bounds and Constructions for Insertion and Deletion Codes. IEEE Trans. Inf. Theory 69(2): 928-940 (2023) - [j12]Shu Liu, Chaoping Xing:
Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems. IEEE Trans. Inf. Theory 69(4): 2300-2310 (2023) - [j11]Shu Liu, Liming Ma, Ting-Yi Wu, Chaoping Xing:
A New Construction of Nonlinear Codes via Algebraic Function Fields. IEEE Trans. Inf. Theory 69(9): 5640-5647 (2023) - [j10]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
A Lower Bound on the List-Decodability of Insdel Codes. IEEE Trans. Inf. Theory 69(11): 6989-7002 (2023) - 2021
- [j9]Shu Liu, Ivan Tjuawinata:
On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability. Finite Fields Their Appl. 73: 101841 (2021) - [j8]Shu Liu, Ivan Tjuawinata, Liang Zhou:
List Decodability of Linear Subcodes of Gabidulin Codes. IEEE Commun. Lett. 25(2): 356-360 (2021) - [j7]Tai Do Duc, Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. IEEE Trans. Inf. Theory 67(5): 2808-2820 (2021) - [j6]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation. IEEE Trans. Inf. Theory 67(9): 5778-5790 (2021) - 2020
- [j5]Shu Liu, Yaxin Zhang:
Dickson Matrix Based Construction of Linear Maximum Rank Distance Codes. IEEE Access 8: 205495-205501 (2020) - 2019
- [j4]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. IEEE Trans. Inf. Theory 65(8): 4815-4821 (2019) - 2018
- [j3]Shu Liu:
On the list decodability of self-orthogonal rank-metric codes. Finite Fields Their Appl. 54: 273-287 (2018) - [j2]Shu Liu, Chaoping Xing, Chen Yuan:
List Decoding of Cover Metric Codes Up to the Singleton Bound. IEEE Trans. Inf. Theory 64(4): 2410-2416 (2018) - 2017
- [j1]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Random Subcodes of Gabidulin Codes. IEEE Trans. Inf. Theory 63(1): 159-163 (2017)
Conference and Workshop Papers
- 2023
- [c3]Shu Liu, Chaoping Xing, Chen Yuan:
List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2. ICALP 2023: 89:1-89:14 - [c2]Shu Liu, Tingyi Wu, Chaoping Xing:
Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds. SODA 2023: 4104-4114 - 2022
- [c1]Yunfei Tai, Kezhen Li, Liang Zhou, Shu Liu, Xilin Zhang:
An Improved CA-SCL Decoding Algorithm for Polar Code. ISNCC 2022: 1-5
Informal and Other Publications
- 2024
- [i13]Singsong Li, Shu Liu, Liming Ma, Chaoping Xing:
Asymptotic construction of locally repairable codes with multiple recovering sets. CoRR abs/2402.09898 (2024) - 2023
- [i12]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy. CoRR abs/2306.02868 (2023) - [i11]Shu Liu, Chaoping Xing, Yaqian Zhang:
Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage. CoRR abs/2307.00221 (2023) - [i10]Shu Liu, Chaoping Xing:
Nonlinear Codes with Low Redundancy. CoRR abs/2310.14219 (2023) - 2022
- [i9]Shu Liu, Tingyi Wu, Chaoping Xing, Chen Yuan:
Upper bounds on maximum lengths of Singleton-optimal locally repairable codes. CoRR abs/2207.05417 (2022) - [i8]Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing:
Good locally repairable codes via propagation rules. CoRR abs/2208.04484 (2022) - [i7]Shu Liu, Liming Ma, Tingyi Wu, Chaoping Xing:
A new construction of nonlinear codes via algebraic function fields. CoRR abs/2208.14569 (2022) - [i6]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
A Lower Bound on the List-Decodability of Insdel Codes. CoRR abs/2211.06606 (2022) - 2021
- [i5]Shu Liu, Chaoping Xing:
Maximally recoverable local reconstruction codes from subspace direct sum systems. CoRR abs/2111.03244 (2021) - [i4]Shu Liu, Chaoping Xing:
Bounds and Constructions for Insertion and Deletion Codes. CoRR abs/2111.14026 (2021) - 2019
- [i3]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
On List Decoding of Insertion and Deletion Errors. CoRR abs/1906.09705 (2019) - [i2]Shu Liu, Ivan Tjuawinata, Chaoping Xing:
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime. CoRR abs/1909.03426 (2019) - 2018
- [i1]Shu Liu, Chaoping Xing, Chen Yuan:
List Decodability of Symbol-Pair Codes. CoRR abs/1806.08992 (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 2024-05-06 23:14 CEST 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:
