On the Existence of de Bruijn Tori with Two by Two Windows
暂无分享,去创建一个
Kenneth G. Paterson | Glenn H. Hurlbert | Chris J. Mitchell | K. Paterson | C. Mitchell | G. Hurlbert
[1] Chris J. Mitchell. De Bruijn Sequences and Perfect Factors , 1997, SIAM J. Discret. Math..
[2] Glenn H. Hurlbert,et al. A MESHING TECHNIQUE FOR de BRUIJN TORI , 1994 .
[3] I. Good. Normal Recurring Decimals , 1946 .
[4] Chris J. Mitchell,et al. Coding Schemes for Two-Dimensional Position Sensing , 1992 .
[5] de Ng Dick Bruijn,et al. Circuits and Trees in Oriented Linear Graphs , 1951 .
[6] Siu Lun Ma. A note on binary arrays with a certain window property , 1984, IEEE Trans. Inf. Theory.
[7] Glenn H. Hurlbert,et al. On the de Bruijn Torus Problem , 1993, J. Comb. Theory, Ser. A.
[8] de Ng Dick Bruijn. A combinatorial problem , 1946 .
[9] Chris J. Mitchell. Constructingc-ary Perfect Factors , 1994, Des. Codes Cryptogr..
[10] Kenneth G. Paterson. Perfect maps , 1994, IEEE Trans. Inf. Theory.
[11] Tuvi Etzion,et al. Constructions for perfect maps and pseudorandom arrays , 1988, IEEE Trans. Inf. Theory.
[12] John C. Cock. Toroidal tilings from de Bruijn-Good cyclic sequences , 1988, Discret. Math..
[13] Kenneth G. Paterson,et al. New Classes of Perfect Maps I , 1996, J. Comb. Theory, Ser. A.
[14] H. Fredricksen. A Survey of Full Length Nonlinear Shift Register Cycle Algorithms , 1982 .
[15] Glenn H. Hurlbert,et al. New constructions for De Bruijn tori , 1995, Des. Codes Cryptogr..
[16] KENNETH G. PATERSON. New Classes of Perfect Maps II , 1996, J. Comb. Theory, Ser. A.
[17] Kenneth G. Paterson. Perfect factors in the de Bruijn graph , 1995, Des. Codes Cryptogr..