A new class of pseudo-random sequences from Mersenne numbers
by Abhijit Mitra
International Journal of Information and Coding Theory (IJICOT), Vol. 1, No. 1, 2009

Abstract: A new class of pseudo random sequences is proposed that can be constructed from modulo-2 (mod 2) operations of two different maximal length sequences (m-sequences) where the period of the input sequences are Mersenne numbers. It is shown that the output sequences have certain properties to make these sequences effective in multi-user interference suppression and communication security.

Online publication date: Tue, 24-Mar-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Coding Theory (IJICOT):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com