1 |
N. de Bruijn, A combinatorial problem, Proc. Nederlandse Akademie van Wetenschappen 49 (1946), 758-764
|
2 |
J. Burns and C. Mitchell, Coding Schemes for two-dimensional position sending, Cryptography and Coding III, M. Ganley Ed. London, UK: Oxford Univ. Press, pp.31-61, 1993
|
3 |
K. G. Paterson, New Classes of Perfect Maps I, J. Combin. Theory Ser. A 73 (1996), 302-334
DOI
ScienceOn
|
4 |
K. G. Paterson, New Classes of Perfect Maps II, J. Combin. Theory Ser. A 73 (1996), 335-345
DOI
ScienceOn
|
5 |
D. Rees, Note on a paper by I. J. Good, J. London Math. Soc. 21 (1946), 169-172
DOI
|
6 |
C. J. Mitchell, Aperiodic and semi-periodic perfect maps, IEEE Trans. Inform. Theory 41 (1995), 88-95
DOI
ScienceOn
|
7 |
I. J. Good, Normally recurring decimals, J. London Math. Soc. 21 (1946), 167169
|
8 |
H. Fredricksen, A survey of full length nonlinear shift register cycle algorithms, SIAM J. Algebraic and Discrete Methods 1 (1980), 107-113
DOI
|
9 |
G. Hurlbert, C. J. Mitchell, and K. G. Paterson, On the existence of de Bruijn tori with two by two windows, J. Combin. Theory Ser. A 76 (1996), 213-230
DOI
ScienceOn
|
10 |
S. Kanetkar and M. Wagh, On Construction of Matrices with distict submatrices, SIAM J. Algebraic and Discrete Methods 1 (1980), 107-113
DOI
|
11 |
S. Kim, On the existence of aperiodic perfect maps for 2 by 2 windows, Ars Combin. 65 (2002), 111-120
|