By Topic

Constructions for perfect maps and pseudorandom arrays

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
$33 $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)
T. Etzion ; Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA

A construction of perfect maps, i.e. periodic r×v binary arrays in which each n×m binary matrix appears exactly once, is given. A similar construction leads to arrays in which only the zero n×m matrix does not appear and to a construction in which only a few n×m binary matrices do not appear. A generalization to the nonbinary case is given. The constructions involve an interesting problem in shift-register theory. The solution is given for almost all the case of this problem

Published in:

IEEE Transactions on Information Theory  (Volume:34 ,  Issue: 5 )