#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2007

2013

- This year (0)
- Last 5 years (2)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Guobiao Weng, Weisheng Qiu, Zeying Wang, Qing Xiang
- Des. Codes Cryptography
- 2007

Let (K, +, *) be an odd order presemifield with commutative multiplication. We show that the set of nonzero squares of (K, *) is a skew Hadamard difference set or a Paley type partial difference set in (K, +) according as q is congruent to 3 mod-ulo 4 or q is congruent to 1 modulo 4. Applying this result to the Coulter–Matthews presemifield and the… (More)

- Guobiao Weng, Lei Hu
- Des. Codes Cryptography
- 2009

- Guobiao Weng, Xiangyong Zeng
- Des. Codes Cryptography
- 2012

- Guobiao Weng, Guang Gong
- 2013

It is well known that almost perfect nonlinear (APN) functions achieve the lowest possible differential uniformity for functions defined on fields with even characteristic, and hence, from this point of view, they are the most ideal choices for S-boxes in block and stream ciphers. They are also interesting as the link to many other areas, for instance… (More)

- Guobiao Weng, Rongquan Feng, Weisheng Qiu
- Finite Fields and Their Applications
- 2007

- Kai Cai, Guobiao Weng, Xueqi Cheng
- IEEE Transactions on Information Theory
- 2010

Sequence set with lower correlation values is highly desired for engineering applications. However, theoretical results (e.g., Welch bound) show that θ<sub>max</sub> ≥ √(N) in general, that is, the maximum out-of-phase autocorrelation and cross-correlation magnitudes of a sequence set is not less than the square root of the sequence… (More)

- Guobiao Weng, Chaoping Dong
- IEEE Trans. Information Theory
- 2008

- Guobiao Weng, Chaoping Dong
- IEEE Transactions on Information Theory
- 2008

Permutation polynomials have applications in coding theory, cryptography, combinatorial designs, and they have been studied for over a hundred years. Recently, permutation polynomials over Z<sub>n</sub> have been used to construct interleavers for turbo codes. In this paper, we determine all permutation polynomials over Z<sub>n</sub> with degree no more… (More)

- ‹
- 1
- ›