{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:25:06Z","timestamp":1755033906268},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des Codes Crypt"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1007\/bf01397666","type":"journal-article","created":{"date-parts":[[2005,4,2]],"date-time":"2005-04-02T21:17:49Z","timestamp":1112476669000},"page":"115-138","source":"Crossref","is-referenced-by-count":11,"title":["Perfect factors in the de Bruijn graph"],"prefix":"10.1007","volume":"5","author":[{"given":"Kenneth G.","family":"Paterson","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Cryptography and Coding III","author":"J. Burns","year":"1993","unstructured":"J. Burns and C. J. Mitchell, Coding schemes for two-dimensional position sensing, InCryptography and Coding III (M. Ganley, ed.), Clarenden Press, Oxford (1993)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0097-3165(82)90038-3","volume":"33","author":"A. H. Chan","year":"1982","unstructured":"A. H. Chan, R. A. Games and E. L. Key, On the complexities of de Bruijn sequences,Journal of Combinatorial Theory, Series A, Vol 33 (1982) pp. 233?246.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(88)90095-7","volume":"70","author":"J. C. Cock","year":"1988","unstructured":"J. C. Cock, Toroidal tilings from de Bruijn-Good cyclic sequences,Discrete Mathematics, Vol. 70 (1988) pp. 209?210.","journal-title":"Discrete Mathematics"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(92)90546-R","volume":"106\/107","author":"S. Dolinar","year":"1992","unstructured":"S. Dolinar, T.-M. Ko and R. McEliece, Some VLSI decompositions of the de Bruijn graph,Discrete Mathematics, Vol. 106\/107 (1992) pp. 189?198.","journal-title":"Discrete Mathematics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0196-6774(86)90025-8","volume":"7","author":"T. Etzion","year":"1986","unstructured":"T. Etzion, An algorithm for constructingm-ary de Bruijn sequences,Journal of Algorithms, Vol. 7 (1986), pp. 331?340","journal-title":"Journal of Algorithms"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1308","DOI":"10.1109\/18.21260","volume":"34","author":"T. Etzion","year":"1988","unstructured":"T. Etzion, Constructions for perfect maps and pseudo-random arrays,IEEE Transactions on Information Theory, Vol. IT-34 (1988), pp. 1308?1316.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/TIT.1984.1056965","volume":"30","author":"T. Etzion","year":"1984","unstructured":"T. Etzion and A. Lempel, Construction of de Bruijn sequences of minimal complexity,IEEE Transactions on Information Theory, Vol. IT-30 (1984), pp. 705?709.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR8","first-page":"205","volume":"19A","author":"C. T. Fan","year":"1985","unstructured":"C. T. Fan, S. M. Fan, S. L. Ma and M. K. Siu, On de Bruijn arrays,Ars Combinatoria, Vol. 19A (1985), pp. 205?213.","journal-title":"Ars Combinatoria"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"H. Fredricksen, A survey of full length shift register cycle algorithms,SIAM Review, Vol. 24 (1982), pp. 195?221.","journal-title":"SIAM Review"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R. A. Games","year":"1983","unstructured":"R. A. Games and A. H. Chan, A fast algorithm for determining the complexity of a binary sequence with period 2 n ,IEEE Transactions on Information Theory, Vol. IT-29 (1983), pp. 144?146.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR11","volume-title":"Shift Register Sequences","author":"S. W. Golomb","year":"1967","unstructured":"S. W. Golomb,Shift Register Sequences, Holden-Day, San Francisco (1967)."},{"key":"CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BFb0046097","volume-title":"Proceedins EURO-CRYPT'87","author":"C. G. G\u00fcnther","year":"1988","unstructured":"C. G. G\u00fcnther, Alternating step generators controlled by de Bruijn sequences, InProceedins EURO-CRYPT'87 (D. Chaum and W.L. Price, eds.) Lecture Notes in Computer Science, Springer-Verlag, Berlin 304 (1988) pp. 5?14."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0097-3165(93)90087-O","volume":"64","author":"G. Hurlbert","year":"1993","unstructured":"G. Hurlbert and G. Isaak, On the de Bruijn torus problem,Journal of Combinatorial Theory, Series A, Vol. 64 (1993), pp. 50?62.","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"CR14","volume-title":"Automata, Languages and Programming Systems","author":"A. Iv\u00e1nyi","year":"1988","unstructured":"A. Iv\u00e1nyi and Z. Toth, Existence of de Bruijn words, InAutomata, Languages and Programming Systems (I. P\u00e9ak, ed.), Karl Marx University of Economics, Budapest (1988)."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","volume":"19","author":"A. Lempel","year":"1970","unstructured":"A. Lempel, On a homomorphism of the de Bruijn graph and its applications to the design of feedback shift registers,IEEE Transactions on Computers, Vol. C-19 (1970), pp. 1204?1209.","journal-title":"IEEE Transactions on Computers"},{"key":"CR16","unstructured":"R. Lidl and H. Niederreiter,Introduction to Finite Fields and their Applications, Cambridge University Press (1986)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/TIT.1984.1056947","volume":"30","author":"S. L. Ma","year":"1984","unstructured":"S. L. Ma, A note on binary arrays with a certain window property,IEEE Transactions on Information Theory, Vol. IT-30 (1984), pp. 774?775.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. L. Massey","year":"1969","unstructured":"J. L. Massey, Shift register synthesis and BCH decoding,IEEE Transactions on Information Theory, Vol. IT-15 (1969), pp. 122?127.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01388650","volume":"4","author":"C. J. Mitchell","year":"1994","unstructured":"C. J. Mitchell, Constructingc-ary perfect factors,Designs, Codes and Cryptography, Vol. 4 (1994), pp 341?368.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR20","unstructured":"C. J. Mitchell, Newc-ary perfect factors in the de Bruijn graph, Presented at4th IMA Conference in Cryptography and Coding, Royal Agricultural College, Cirencester, U.K., 13th?15th December 1993."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1007\/BF01388557","volume":"4","author":"C. J. Mitchell","year":"1994","unstructured":"C. J. Mitchell and K. G. Paterson, Decoding perfect maps,Designs, Codes and Cryptography, Vol. 4 (1994), pp. 11?30.","journal-title":"Designs, Codes and Cryptography"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"743","DOI":"10.1109\/18.335886","volume":"40","author":"K. G. Paterson","year":"1994","unstructured":"K. G. Paterson, Perfect maps,IEEE Transactions on Information Theory, Vol. IT-40 (1994), pp. 743?753.","journal-title":"IEEE Transactions on Information Theory"},{"key":"CR23","unstructured":"K. G. Paterson,On sequences and arrays with specific window properties, Ph.D. thesis, University of London, 1993."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"1167","DOI":"10.1109\/12.93750","volume":"40","author":"M. A. Sridhar","year":"1991","unstructured":"M. A. Sridhar and C. S. Raghavendra, Fault-tolerant networks based on the de Bruijn graph,IEEE Transactions on Computers, Vol. C-40 (1991), pp. 1167?1174.","journal-title":"IEEE Transactions on Computers"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(87)90072-2","volume":"16","author":"S. Xie","year":"1987","unstructured":"S. Xie, Notes on de Bruijn sequences,Discrete Mathematics, Vol. 16 (1987), pp. 157?177.","journal-title":"Discrete Mathematics"},{"key":"CR26","series-title":"Lecture Notes in Computer Science","first-page":"718","volume-title":"Proceedings of AusCrypt'92","author":"J. H. Yang","year":"1994","unstructured":"J. H. Yang and Z. D. Dai, Construction ofm-ary de Bruijn sequences, InProceedings of AusCrypt'92 (J. Seberry and Y. Zheng, eds.), Lecture Notes in Computer Science, Springer, Berlin, 718 (1994) pp. 357?363."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01397666\/fulltext.html","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01397666.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01397666\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01397666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T09:46:06Z","timestamp":1556876766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01397666"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["BF01397666"],"URL":"https:\/\/doi.org\/10.1007\/bf01397666","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,3]]}}}