Cross-recurrence property of m-sequences

A binary maximal length sequence (m-sequence) of period L = 2 m - 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 prop...

Full description

Saved in:
Bibliographic Details
Published in2012 IEEE International Symposium on Information Theory Proceedings pp. 851 - 854
Main Author Hemmati, F.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.07.2012
Subjects
Clocks
cross-recurrence
Delay
finite fields
Galois fields
linear feedback shift-register
m-sequence
Polynomials
polynomials over GF
Table lookup
Vectors
Online AccessGet full text

Cover

More Information
Summary:A binary maximal length sequence (m-sequence) of period L = 2 m - 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.
ISBN:9781467325806
1467325805
ISSN:2157-8095
2157-8117
DOI:10.1109/ISIT.2012.6284681