By Topic

Trace Representation and Linear Complexity of Binary e th Power Residue Sequences of Period p

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zongduo Dai ; State Key Laboratory of Information Security, Graduate School of Chinese Academy of Sciences, Beijing, China ; Guang Gong ; Hong-Yeop Song ; Dingfeng Ye

Let p = ef + 1 be an odd prime for some e and e and let f, be the finite field with Fp elements. In this paper, we explicitly describe the trace representations of the binary characteristic sequences (of period p) of all the cyclic difference sets D which are some union of cosets of eth powers He in Fp* (=Δ Fp{0}) for e ≤ 12. For this, we define eth power residue sequences of period p, which include all the binary characteristic sequences mentioned above as special cases, and reduce the problem of determining their trace representations to that of determining the values of the generating polynomials of cosets of He in Fρ* at some primitive pth root of unity, and some properties of these values are investigated. Based on these properties, the trace representation and linear complexity not only of the characteristic sequences of all the known eth residue difference sets, but of all the sixth power residue sequences are determined. Furthermore, we have determined the linear complexity of a nonconstant eth power residue sequence for any e to be either p - 1 or p whenever (e, (p-1)/n) = 1, where n is the order of 2 mod p.

Published in:

IEEE Transactions on Information Theory  (Volume:57 ,  Issue: 3 )