7 citations · 9 across the 7 of their papers we have counts for
9 papers
Efficient construction of subspace design codes over constant alphabet
Shu Liu
Subspace-design codes form a central unifying framework in coding theory, connecting probabilistic existence results and explicit algebraically structured constructions. The two co…
Multi-sequences with large linear and error linear complexity from function fields
Xubin Hu, Shu Liu, Liming Ma +1
The linear complexity and the error linear complexity of multi-sequences are measures for security in stream ciphers. In this manuscript, we present a general framework for constru…
Quasi-linear time decoding of RS and AG codes for burst errors up to the Singleton bound
Songsong Li, Shu Liu, Liming Ma +2
Despite of tremendous research on decoding Reed-Solomon (RS) and algebraic geometry (AG) codes under the random and adversary substitution error models, few studies have explored t…
Encoding of algebraic geometry codes with quasi-linear complexity
Songsong Li, Shu Liu, Liming Ma +2
Fast encoding and decoding of codes have been always an important topic in code theory as well as complexity theory. Although encoding is easier than decoding in general, designing…
Asymptotic construction of locally repairable codes with multiple recovering sets
Singsong Li, Shu Liu, Liming Ma +1
Locally repairable codes have been extensively investigated due to practical applications in distributed and cloud storage systems in recent years. However, not much work on asympt…
Nonlinear Codes with Low Redundancy
Shu Liu, Chaoping Xing
Determining the largest size, or equivalently finding the lowest redundancy, of q-ary codes for given length and minimum distance is one of the central and fundamental problems in…
Bounds and Constructions for Insertion and Deletion Codes
Shu Liu, Chaoping Xing
The present paper mainly studies limits and constructions of insertion and deletion (insdel for short) codes. The paper can be divided into two parts. The first part focuses on var…
Maximally recoverable local reconstruction codes from subspace direct sum systems
Shu Liu, Chaoping Xing
Maximally recoverable local reconstruction codes (MR LRCs for short) have received great attention in the last few years. Various constructions have been proposed in literatures. T…
Explicit Constructions of Two-Dimensional Reed-Solomon Codes in High Insertion and Deletion Noise Regime
Tai Do Duc, Shu Liu, Ivan Tjuawinata +1
Insertion and deletion (insdel for short) errors are synchronization errors in communication systems caused by the loss of positional information in the message. Reed-Solomon codes…