Title :
Cross-recurrence property of m-sequences
Abstract :
A binary maximal length sequence (m-sequence) of period L = 2m - 1 can be generated by a binary m-stage linear feedback shift-register (LFSR). Tap connections of the LFSR corresponds to a binary primitive polynomial of degree m. m-sequences enjoy several well-known and unique properties. A new property for m-sequences, called cross-recurrence property, is presented in this paper and its potential applications are briefly outlined.
Keywords :
binary sequences; feedback; m-sequences; shift registers; LFSR; binary m-stage linear feedback shift-register; binary maximal length sequence; binary primitive polynomial; cross-recurrence property; m-sequences; Clocks; Delay; Galois fields; Polynomials; Table lookup; Vectors; cross-recurrence; finite fields; linear feedback shift-register; m-sequence; polynomials over GF(2);
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2012.6284681