IEEE Transactions on Information Theory · 1988 · 118 citations · 17 references
ComputingComputer EngineeringComputer ScienceAlgorithmsCombinatoricsData StructuresError-correcting CodesMatrix ComputationPseudorandom FunctionsPseudorandom GeneratorsPseudorandom Permutations
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.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
17
K.W. Cattermole · Electronics and Power · 1968 · 1.3K citations
de Ng Dick Bruijn · Data Archiving and Networked Services (DANS) · 1946 · 1.3K citations · Full text
Pseudo-random sequences and arrays
F. MacWilliams, N. J. A. Sloane · Proceedings of the IEEE · 1976 · 737 citations