5 citations · 18 across the 19 of their papers we have counts for
4 papers · 1 filter
Improved error bounds for the distance distribution of Reed-Solomon codes
Zhicheng Gao, Jiyou Li
We use the generating function approach to derive simple expressions for the factorial moments of the distance distribution over Reed-Solomon codes. We obtain better upper bounds f…
On the minimum distance of elliptic curve codes
Jiyou Li, Daqing Wan, Jun Zhang
Computing the minimum distance of a linear code is one of the fundamental problems in algorithmic coding theory. Vardy [14] showed that it is an \np-hard problem for general linear…
On Determining Deep Holes of Generalized Reed-Solomon Codes
Qi Cheng, Jiyou Li, Jincheng Zhuang
For a linear code, deep holes are defined to be vectors that are further away from codewords than all other vectors. The problem of deciding whether a received word is a deep hole…
On the average sensitivity of laced Boolean functions
Jiyou Li
In this paper we obtain the average sensitivity of the laced Boolean functions. This confirms a conjecture of Shparlinski. We also compute the weights of the laced Boolean function…