1 citations · 1 across the 3 of their papers we have counts for
3 papers
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.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.IT2023★ 1 cited
Explicit Construction of q-ary 2-deletion Correcting Codes with Low Redundancy
Shu Liu, Ivan Tjuawinata, Chaoping Xing
We consider the problem of efficient construction of q-ary 2-deletion correcting codes with low redundancy. We show that our construction requires less redundancy than any existing…