22 citations · 35 across the 18 of their papers we have counts for
20 papers
A new family of maximal curves not covered by the Hermitian curve
Liming Ma, Yipeng Wang
For every prime power and every even integer , we construct an -maximal curve of genus that is not covered by the Hermitian curve o…
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…
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…
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…
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…