By Topic

Characterizing the autocorrelations 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

2 Author(s)

The class of autocorrelation functions of binary sequences is studied in terms of their finite-dimensional projections; that is, the vector ranges of finite sets of consecutive correlation coefficients. These are convex polyhedra whose extreme points can be generated by binary sequences of bounded periods. Algorithms are given for the calculation of the extreme points. Tables are presented for the extreme points and supporting hyperplanes of projections of dimensions up to five. Some conclusions about the general class of autocorrelations of binary sequences are drawn from these tables.

Published in:

Information Theory, IEEE Transactions on  (Volume:29 ,  Issue: 4 )