11 citations · 11 across the 3 of their papers we have counts for
3 papers
cs.IT2019
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…
cs.IT2019★ 11 cited
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…
cs.IT2016
On the List-Decodability of Random Self-Orthogonal Codes
Lingfei Jin, Chaoping Xing, Xiande Zhang
In 2011, Guruswami-Håstad-Kopparty \cite{Gru} showed that the list-decodability of random linear codes is as good as that of general random codes. In the present paper, we further…