22 citations · 36 across the 8 of their papers we have counts for
10 papers · 1 filter
Binary sequences with a low correlation via cyclotomic function fields with odd characteristics
Lingfei Jin, Liming Ma, Chaoping Xing
Sequences with a low correlation have very important applications in communications, cryptography, and compressed sensing. In the literature, many efforts have been made to constru…
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…
A new construction of nonlinear codes via rational function fields
Lingfei Jin, Liming Ma, Chaoping Xing
It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been pr…
Optimal repairing schemes for Reed-Solomon codes with alphabet sizes linear in lengths under the rack-aware model
Lingfei Jin, Gaojun Luo, Chaoping Xing
In modern practical data centers, storage nodes are usually organized into equally sized groups, which is called racks. The cost of cross-rack communication is much more expensive…
Constructions of maximally recoverable local reconstruction codes via function fields
Venkatesan Guruswami, Lingfei Jin, Chaoping Xing
Local Reconstruction Codes (LRCs) allow for recovery from a small number of erasures in a local manner based on just a few other codeword symbols. A maximally recoverable (MR) LRC…
Explicit construction of optimal locally recoverable codes of distance 5 and 6 via binary constant weight codes
Lingfei Jin
It was shown in \cite{GXY18} that the length of a -ary linear locally recoverable code with distance is upper bounded by . Thus, it is a challenging proble…