By Topic

Binary Sequences and Redundancy

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

1 Author(s)
Kak, Subhash ; Department of Electrical Engineering, Indian Institute of Technology, New Delhi, India.

The computational-complexity approach and entropy using nominal frequencies lead to different measures to characterize patterns in finite binary sequences. These have been compared to a measure obtained on taking integral transforms of the sequences. The transforms considered in this paper are the Walsh and the discrete Legendre. Pattern characterization through integral transforms turns out to be intuitively satisfying. In particular, Walsh transform characterization appears natural for binary sequences as does the use of discrete Legendre transforms for more general (nonbinary) sequences.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-4 ,  Issue: 4 )