DocumentCode
893530
Title
Constructions for perfect maps and pseudorandom arrays
Author
Etzion, Tuvi
Author_Institution
Dept. of Electr. Eng.-Syst., Univ. of Southern California, Los Angeles, CA, USA
Volume
34
Issue
5
fYear
1988
fDate
9/1/1988 12:00:00 AM
Firstpage
1308
Lastpage
1316
Abstract
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
Keywords
binary sequences; encoding; information theory; matrix algebra; shift registers; binary arrays; binary matrix; encoding; perfect maps; pseudorandom arrays; shift-register theory; Binary sequences; Computer science; Feedback; Shift registers;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.21260
Filename
21260
Link To Document