activity
20212026
collaborators

8 papers

cs.IT2026

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…

cs.IT2025

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…

cs.IT2024

New families of non-Reed-Solomon MDS codes

Lingfei Jin, Liming Ma, Chaoping Xing +1

MDS codes have garnered significant attention due to their wide applications in practice. To date, most known MDS codes are equivalent to Reed-Solomon codes. The construction of no…

math.NT2024

A new family of binary sequences with a low correlation via elliptic curves

Lingfei Jin, Liming Ma, Chaoping Xing +1

In the realm of modern digital communication, cryptography, and signal processing, binary sequences with a low correlation properties play a pivotal role. In the literature, consid…

cs.CC2024

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…

cs.IT2024

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…

cs.IT2023

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…

cs.IT2021

Binary sequences with low correlation via cyclotomic function fields

Lingfei Jin, Liming Ma, Chaoping Xing

Due to wide applications of binary sequences with low correlation to communications, various constructions of such sequences have been proposed in literature. However, most of the…