#### Filter Results:

- Full text PDF available (21)

#### Publication Year

2004

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Nian Li, Xiangyong Zeng, Lei Hu
- IEICE Transactions
- 2008

- Gaofei Wu, Nian Li, Tor Helleseth, Yuqing Zhang
- ArXiv
- 2013

In this paper, by using a powerful criterion for permutation polynomials given by Zieve, we give several classes of complete permutation monomials over Fqr. In addition, we present a class of complete permutation multinomials, which is a generalization of recent work.

- Xiangyong Zeng, Nian Li, Lei Hu
- SETA
- 2008

- Nian Li, Tor Helleseth, Xiaohu Tang
- Finite Fields and Their Applications
- 2013

- Zhengchun Zhou, Nian Li, Cuiling Fan, Tor Helleseth
- Des. Codes Cryptography
- 2016

Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of p-ary linear codes with two or three weights are constructed from quadratic Bent functions over the finite field F p , where p is an odd prime. They include some earlier linear codes as… (More)

- Cunsheng Ding, Chunlei Li, Nian Li, Zhengchun Zhou
- Discrete Mathematics
- 2016

- Nian Li, Tor Helleseth, Xiaohu Tang, Alexander Kholosha
- IEEE Transactions on Information Theory
- 2013

Several new classes of binary and <i>p</i>-ary regular bent functions are obtained in this paper. The bentness of all these functions is determined by some exponential sums over finite fields, most of which have close relations with the well-known Kloosterman sums.

- Chunming Tang, Nian Li, Yanfeng Qi, Zhengchun Zhou, Tor Helleseth
- IEEE Transactions on Information Theory
- 2016

Linear codes with a few weights have applications in consumer electronics, communication, data storage system, secret sharing, authentication codes, association schemes, and strongly regular graphs. This paper first generalizes the method of constructing two-weight and three-weight linear codes of Ding et al. and Zhou et al. to general weakly regular bent… (More)

- Chunlei Li, Nian Li, Tor Helleseth, Cunsheng Ding
- IEEE Transactions on Information Theory
- 2014

Let m ≥ 3 be an odd integer and p be an odd prime. In this paper, a number of classes of three-weight cyclic codes C(1,e) over F<sub>p</sub>, which have parity-check polynomial m<sub>1</sub>(x)m<sub>e</sub>(x), are presented by examining general conditions on the parameters p, m, and e, where m<sub>i</sub>(x) is the minimal polynomial of π-i… (More)

- T. Helleseth, Lei Hu, A. Kholosha, Xiangyong Zeng, Nian Li, Wenfeng Jiang
- IEEE Transactions on Information Theory
- 2009

This paper follows the recent work of Helleseth, Kholosha, Johansen, and Ness to study the cross correlation between an m -sequence of period 2<sup>m</sup> - 1 and the d-decimation of an m-sequence of a shorter period 2<sup>n</sup> - 1 for an even number m = 2n. Assuming that d satisfies d(2<sup>l</sup> + 1) = 2<sup>i</sup> (mod 2<sup>n</sup> - 1) for some… (More)