Cart (Loading....) | Create Account
Close category search window
 

Minimum linear span approximation of binary sequences

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kolokotronis, N. ; Dept. of Informatics & Telecommun., Nat. & Kapodistrian Univ. of Athens, Greece ; Rizomiliotis, P. ; Kalouptsidis, N.

The determination of the minimum linear span sequence that differs from a given binary sequence, of period N=2n-1, by at most one digit is discussed and three methods are presented: the sequential divisions method, the congruential equations method, and the phase synchronization method. High-level algorithm organizations are provided. Finally, guidelines on sequence characterization and design via the notion of robustness are given.

Published in:

Information Theory, IEEE Transactions on  (Volume:48 ,  Issue: 10 )

Date of Publication:

Oct 2002

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.