Trace Representation and Linear Complexity of Binary eth Power Residue Sequences of Period [Rho]

• Published in: IEEE transactions on information theory Vol. 57; no. 3; p. 1530
• Main Authors: Dai, Zongduo, Gong, Guang, Song, Hong-Yeop, Ye, Dingfeng
• Format: Journal Article
• Language: English
• Published: New York The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 01.03.2011
• Subjects: Codes; Coding theory; Information theory; Linear codes; Polynomials
• ISSN: 0018-9448; 1557-9654

Let p = ef + 1 be an odd prime for some e and e and let f, be the finite field with ... 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 ... in ... * (...) 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 ... in ... * 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. (ProQuest: ... denotes formulae/symbols omitted.)