Constructions for perfect maps and pseudorandom arrays
- 1 September 1988
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 34 (5) , 1308-1316
- https://doi.org/10.1109/18.21260
Abstract
No abstract availableThis publication has 18 references indexed in Scilit:
- Circuits and Trees in Oriented Linear GraphsPublished by Springer Nature ,2009
- An algorithm for constructing m-ary de Bruijn sequencesJournal of Algorithms, 1986
- Construction of de Bruijn sequences of minimal complexityIEEE Transactions on Information Theory, 1984
- Algorithms for the generation of full-length shift- register sequencesIEEE Transactions on Information Theory, 1984
- On the complexities of de Bruijn sequencesJournal of Combinatorial Theory, Series A, 1982
- A Survey of Full Length Nonlinear Shift Register Cycle AlgorithmsSIAM Review, 1982
- A new memoryless algorithm for de Bruijn sequencesJournal of Algorithms, 1981
- Necklaces of beads in k colors and k-ary de Bruijn sequencesDiscrete Mathematics, 1978
- A class of nonlinear de Bruijn cyclesJournal of Combinatorial Theory, Series A, 1975
- On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift RegistersIEEE Transactions on Computers, 1970