arXiv subjects
Publications and source records attributed to Rongjun Wu.
Determining deep holes is an important topic in decoding Reed-Solomon codes. In a previous paper [8], we showed that the received word $u$ is a deep hole of the standard Reed-Solomon codes $[q-1, k]_q$ if its Lagrange interpolation polynomial is the sum of monomial of degree $q-2$ and a polynomial of degree at most $k-1$. In this paper, we extend this result by giving a new class of deep holes of the generalized Reed-Solomon codes.
Nonlinearity of rotation symmetric Boolean functions is an important topic on cryptography algorithm. Let $e\ge 1$ be any given integer. In this paper, we investigate the following question: Is the nonlinearity of the quartic rotation symmetric Boolean function generated by the monomial $x_0x_ex_{2e}x_{3e}$ equal to its weight? We introduce some new simple sub-functions and develop new technique to get several recursive formulas. Then we use these recursive formulas to show that the nonlinearity of the quartic rotation symmetric Boolean function generated by the monomial $x_0x_ex_{2e}x_{3e}$ is the same as its weight. So we answer the above question affirmatively. Finally, we conjecture that if $l\ge 4$ is an integer, then the nonlinearity of the rotation symmetric Boolean function generated by the monomial $x_0x_ex_{2e}...x_{le}$ equals its weight.
For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $α\geq a$ and $r\geq \max(a, l-1)$ and $n\geq lαr$, we have $$L_n\geq u_0r^{(l-1)α+a-l}(r+1)^n.$$ Particularly, letting $l=3$ yields an improvement to the best previous lower bound on $L_n$ obtained by Hong and Kominers.
Determining deep holes is an important open problem in decoding Reed-Solomon codes. It is well known that the received word is trivially a deep hole if the degree of its Lagrange interpolation polynomial equals the dimension of the Reed-Solomon code. For the standard Reed-Solomon codes $[p-1, k]_p$ with $p$ a prime, Cheng and Murray conjectured in 2007 that there is no other deep holes except the trivial ones. In this paper, we show that this conjecture is not true. In fact, we find a new class of deep holes for standard Reed-Solomon codes $[q-1, k]_q$ with $q$ a prime power of $p$. Let $q \geq 4$ and $2 \leq k\leq q-2$. We show that the received word $u$ is a deep hole if its Lagrange interpolation polynomial is the sum of monomial of degree $q-2$ and a polynomial of degree at most $k-1$. So there are at least $2(q-1)q^k$ deep holes if $k \leq q-3$.