Title :
Synthesis and uniqueness of m-sequences over GF(qn) as n-phase sequences over GF(q)
Author :
Gong, Guang ; Xiao, Guo Zheng
Author_Institution :
Dept. of Appl. Math., Univ. of Electron. Sci. & Technol. of China, Chengdu, China
fDate :
8/1/1994 12:00:00 AM
Abstract :
The construction of m-sequences over GF(qn) from known m-sequences over GF(q) is discussed. An algorithm is given which generates m-sequences over GF(qn) from m-sequences over GF(q), where n phase shifts of known m-sequences over GF(q) are determined by the iterative polynomials. It is shown that n shift distinct m-sequences over GF(qn) generated by the same m-sequences over GF(q) are unique when the elements of GF(qn) are represented by n-tuples of the elements from GF(q)
Keywords :
binary sequences; iterative methods; polynomials; series (mathematics); algorithm; iterative polynomials; linear feedback shift register; linear feedforward functions; m-sequences construction; n-phase sequences; n-tuples; phase shifts; uniqueness; Character generation; Codes; Communications Society; Cryptography; Galois fields; Helium; Information security; Iterative algorithms; Mathematics; Polynomials;
Journal_Title :
Communications, IEEE Transactions on
