Shu Liu

Orcid: 0000-0002-7709-4223

Affiliations:
  • University of Electronic Science and Technology of China, National Key Laboratory of Science and Technology on Communications, Chengdu, China
  • Nanyang Technological University, Division of Mathematical Sciences, School of Physical and Mathematical Sciences, Singapore (PhD 2018)


According to our database1, Shu Liu authored at least 28 papers between 2017 and 2024.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On Lengths of Singleton-Optimal Locally Repairable Codes.
IEEE Trans. Commun., January, 2024

Asymptotic construction of locally repairable codes with multiple recovering sets.
CoRR, 2024

2023
A Lower Bound on the List-Decodability of Insdel Codes.
IEEE Trans. Inf. Theory, November, 2023

Optimal and Asymptotically Good Locally Repairable Codes via Propagation Rules.
IEEE Trans. Commun., October, 2023

A New Construction of Nonlinear Codes via Algebraic Function Fields.
IEEE Trans. Inf. Theory, September, 2023

Maximally Recoverable Local Repairable Codes From Subspace Direct Sum Systems.
IEEE Trans. Inf. Theory, April, 2023

Bounds and Constructions for Insertion and Deletion Codes.
IEEE Trans. Inf. Theory, February, 2023

Nonlinear Codes with Low Redundancy.
CoRR, 2023

Codes with Biochemical Constraints and Single Error Correction for DNA-Based Data Storage.
CoRR, 2023

Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy.
CoRR, 2023

Nonlinear codes exceeding the Gilbert-Varshamov and Tsfasman-Vlăduţ-Zink bounds.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

List Decoding of Rank-Metric Codes with Row-To-Column Ratio Bigger Than 1/2.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
A new construction of nonlinear codes via algebraic function fields.
CoRR, 2022

Good locally repairable codes via propagation rules.
CoRR, 2022

Upper bounds on maximum lengths of Singleton-optimal locally repairable codes.
CoRR, 2022

An Improved CA-SCL Decoding Algorithm for Polar Code.
Proceedings of the International Symposium on Networks, Computers and Communications, 2022

2021
Efficiently List-Decodable Insertion and Deletion Codes via Concatenation.
IEEE Trans. Inf. Theory, 2021

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime.
IEEE Trans. Inf. Theory, 2021

List Decodability of Linear Subcodes of Gabidulin Codes.
IEEE Commun. Lett., 2021

On 2-dimensional insertion-deletion Reed-Solomon codes with optimal asymptotic error-correcting capability.
Finite Fields Their Appl., 2021

Maximally recoverable local reconstruction codes from subspace direct sum systems.
CoRR, 2021

2020
Dickson Matrix Based Construction of Linear Maximum Rank Distance Codes.
IEEE Access, 2020

2019
List Decodability of Symbol-Pair Codes.
IEEE Trans. Inf. Theory, 2019

Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime.
CoRR, 2019

On List Decoding of Insertion and Deletion Errors.
CoRR, 2019

2018
List Decoding of Cover Metric Codes Up to the Singleton Bound.
IEEE Trans. Inf. Theory, 2018

On the list decodability of self-orthogonal rank-metric codes.
Finite Fields Their Appl., 2018

2017
List Decodability of Random Subcodes of Gabidulin Codes.
IEEE Trans. Inf. Theory, 2017


  Loading...