{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:57:50Z","timestamp":1775012270343,"version":"3.50.1"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2005,11,1]],"date-time":"2005-11-01T00:00:00Z","timestamp":1130803200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Program Comput Soft"],"published-print":{"date-parts":[[2005,11]]},"DOI":"10.1007\/s11086-005-0039-z","type":"journal-article","created":{"date-parts":[[2005,12,19]],"date-time":"2005-12-19T09:58:56Z","timestamp":1134986336000},"page":"301-309","source":"Crossref","is-referenced-by-count":0,"title":["Test Sequence Construction Using Minimum Information on the Tested System"],"prefix":"10.1007","volume":"31","author":[{"given":"V. V.","family":"Kuliamin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"39_CR1","unstructured":"Hartman, A., Software and Hardware Testing Using Combinatorial Covering Suites. Haifa Workshop on Interdisciplinary Applications and Graph Theory, Combinatorics and Algorithms, June 2002, http:\/\/www.agedis.de\/documents\/d435_1\/CombinatorialProblemsinSWTesting-finalDraft180703.pdf."},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.disc.2003.11.029","volume":"284","author":"A. Hartman","year":"2004","unstructured":"Hartman, A. and Raskin, L., Problems and Algorithms for Covering Arrays, Discrete Math., 2004, vol. 284, pp. 149\u2013156, http:\/\/www.agedis.de\/documents\/d434_1\/AlgorithmsForCoveringArrays-Publication191203.pdf.","journal-title":"Discrete Math."},{"key":"39_CR3","unstructured":"Colbourn, C.J., Combinatorial Aspects of Covering Arrays, Proc. of Combinatorics 2004, Capomulini, Italy, September 2004, http:\/\/www.dmi.unict.it\/combinatorics04\/documenti%20pdf\/colbourn.pdf."},{"key":"39_CR4","unstructured":"Fredricksen, H. and Maiorana, J., The Baltimore Hilton Problem, Technol. Rev., June 1980, vol. 83, no.7."},{"key":"39_CR5","first-page":"107","volume":"1","author":"F.-S. Marie","year":"1894","unstructured":"Marie, F.-S., Solution to Problem Number 58, L'Inermediaire des Mathematiciens, 1894, vol. 1, pp. 107\u2013110.","journal-title":"L'Inermediaire des Mathematiciens"},{"key":"39_CR6","first-page":"758","volume":"49","author":"N.G. De Bruijn","year":"1946","unstructured":"De Bruijn, N.G., A Combinatorial Problem, Koninklijke Nederlandse Akademie van Wetenschappen, 1946, vol. 49, pp. 758\u2013764.","journal-title":"Koninklijke Nederlandse Akademie van Wetenschappen"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Martin, M.H., A Problem in Arrangements, Bull. Am. Math. Soc., 1934, no. 40, pp. 859\u2013864.","DOI":"10.1090\/S0002-9904-1934-05988-3"},{"key":"39_CR8","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1112\/jlms\/s1-21.3.167","volume":"21","author":"I.J. Good","year":"1946","unstructured":"Good, I.J., Normally Recurring Decimals, J. London Math. Soc., 1946, vol. 21, pp. 167\u2013169.","journal-title":"J. London Math. Soc."},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1112\/jlms\/s1-21.3.169","volume":"21","author":"D. Rees","year":"1946","unstructured":"Rees, D., Note on a Paper by I.J. Good, J. London Math. Soc., 1946, vol. 21, pp. 169\u2013172.","journal-title":"J. London Math. Soc."},{"key":"39_CR10","volume-title":"The Art of Computer Programming, vol. 1: Fundamental Algorithms","author":"D.E. Knuth","year":"1968","unstructured":"Knuth, D.E., The Art of Computer Programming, vol. 1: Fundamental Algorithms, Reading: Addison-Wesley, 1968. Translated under the title Iskusstvo programmirovaniya, tom 1: Osnovnye algoritmy, Moscow: Vil'yams, 2002."},{"issue":"2","key":"39_CR11","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1137\/1024041","volume":"24","author":"H. Fredricksen","year":"1982","unstructured":"Fredricksen, H., A Survey of Full Length Nonlinear Shift Register Cycle Algorithm, SIAM Rev., 1982, vol. 24, no.2, pp. 195\u2013221.","journal-title":"SIAM Rev."},{"key":"39_CR12","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1109\/PROC.1976.10411","volume":"64","author":"F.J. MacWilliams","year":"1976","unstructured":"MacWilliams, F.J. and Sloane N.J.A., Pseudo-Random Sequences and Arrays, Proc. IEEE, 1976, vol. 64, pp. 1715\u20131729.","journal-title":"Proc. IEEE"},{"issue":"4","key":"39_CR13","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1137\/S0036144595295272","volume":"39","author":"C.D. Savage","year":"1997","unstructured":"Savage, C.D., A Survey of Combinatorial Gray Codes, SIAM Rev., 1997, vol. 39, no.4, pp. 605\u2013629.","journal-title":"SIAM Rev."},{"key":"39_CR14","unstructured":"Fan Chung and Cooper, J.N., De Bruijn Cycles for Covering Codes, 2003, http:\/\/arxiv.org\/abs\/math\/0310385."},{"key":"39_CR15","unstructured":"Zhang, L., Curless, B., and Seitz, S.M., Rapid Shape Acquisition Using Color Structured Light and Multi-Pass Dynamic Programming, Int. Symp. on 3D Data Processing Visualization and Transmission, Padova, Italy, June 2002, pp. 24\u201336."},{"key":"39_CR16","doi-asserted-by":"crossref","unstructured":"Pages, J. and Salvi, J., A New Optimized De Bruijn Coding Strategy for Structured Light Patterns, 17th Int. Conf. on Pattern Recognition ICPR 2004, Cambridge, UK, 23\u201326 August, 2004.","DOI":"10.1109\/ICPR.2004.1333759"},{"key":"39_CR17","volume-title":"Shift Register Sequences","author":"S.W. Golomb","year":"1981","unstructured":"Golomb, S.W., Shift Register Sequences, Laguna Hills: Aegean Park, 1981."},{"key":"39_CR18","doi-asserted-by":"crossref","first-page":"1204","DOI":"10.1109\/T-C.1970.222859","volume":"19","author":"A. Lempel","year":"1970","unstructured":"Lempel, A., On a Homomorphism of the de Bruijn Graph and its Applications to the Design of Feedback Shift Registers, IEEE Trans. Comput., 1970, vol. 19, pp. 1204\u20131209.","journal-title":"IEEE Trans. Comput."},{"key":"39_CR19","unstructured":"Robinson, H., Graph Theory Techniques in Model-Based Testing, 1999 Int. Conf. on Testing Comput. Software, 1999, http:\/\/www.geocities.com\/harry_robinson_testing\/graph_theory.htm."},{"key":"39_CR20","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0012-365X(78)90002-X","volume":"23","author":"H. Fredricksen","year":"1978","unstructured":"Fredricksen, H. and Maiorana, J., Necklaces of Beads in k Colors and k-ary de Bruijn Sequences, Discrete Math., 1978, vol. 23, pp. 207\u2013210.","journal-title":"Discrete Math."},{"key":"39_CR21","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1109\/TIT.1984.1056919","volume":"30","author":"T. Etzion","year":"1984","unstructured":"Etzion, T. and Lempel, A., Algorithms for the Generation of Full-Length Shift-Register Sequences, IEEE Trans. Information Theory, 1984, vol. 30, pp. 480\u2013484.","journal-title":"IEEE Trans. Information Theory"},{"key":"39_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0196-6774(86)90025-8","volume":"7","author":"T. Etzion","year":"1986","unstructured":"Etzion, T., An Algorithm for Constructing m-ary de Bruijn Sequences, J. Algorithms, 1986, vol. 7, pp. 331\u2013340.","journal-title":"J. Algorithms"},{"key":"39_CR23","doi-asserted-by":"crossref","first-page":"843","DOI":"10.1109\/TIT.1983.1056764","volume":"29","author":"R.A. Games","year":"1983","unstructured":"Games, R.A., A Generalized Recursive Construction for de Bruijn Sequences, IEEE Trans. Information Theory, 1983, vol. 29, pp. 843\u2013850.","journal-title":"IEEE Trans. Information Theory"},{"key":"39_CR24","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1109\/18.133272","volume":"37","author":"C.J.A. Jansen","year":"1991","unstructured":"Jansen, C.J.A., Franx, W.G., and Boekee, D.E., An Efficient Algorithm for the Generation of de Bruijn Cycles, IEEE Trans. Information Theory, 1991, vol. 37, pp. 1475\u20131478.","journal-title":"IEEE Trans. Information Theory"},{"key":"39_CR25","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/0196-6774(81)90007-9","volume":"2","author":"A. Ralston","year":"1981","unstructured":"Ralston, A., A New Memoryless Algorithm for de Bruijn Sequences, J. Algorithms, 1981, vol. 2, pp. 50\u201362.","journal-title":"J. Algorithms"},{"key":"39_CR26","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1080\/00029890.1971.11992920","volume":"78","author":"E. Roth","year":"1971","unstructured":"Roth, E., Permutations Arranged around a Circle, The Am. Math. Monthly, 1971, vol. 78, pp. 990\u2013992.","journal-title":"The Am. Math. Monthly"},{"key":"39_CR27","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0166-218X(87)90072-2","volume":"16","author":"S. Xie","year":"1987","unstructured":"Xie, S., Notes on de Bruijn Sequences, Discrete Math., 1987, vol. 16, pp. 157\u2013177.","journal-title":"Discrete Math."},{"issue":"2","key":"39_CR28","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/12.565596","volume":"46","author":"F.S. Annexstein","year":"1997","unstructured":"Annexstein, F.S., Generating de Bruijn Sequences: An Efficient Implementation, IEEE Trans. Comput., 1997, vol. 46, no.2, pp. 198\u2013200.","journal-title":"IEEE Trans. Comput."},{"key":"39_CR29","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1093\/comjnl\/35.1.88","volume":"35","author":"M. Vassallo","year":"1992","unstructured":"Vassallo, M. and Ralston, A., Algorithms for de Bruijn Sequences\u2014a Case Study in the Empirical Analysis of Algorithms, The Comput. J., 1992, vol. 35, pp. 88\u201390.","journal-title":"The Comput. J."},{"key":"39_CR30","unstructured":"O'Brien, M.J., De Bruijn Graphs and the Ehrenfeucht-Mycielski Sequence, Master's Thesis, Mathematical Science Department, Carnegie Mellon University, 2001."},{"key":"39_CR31","unstructured":"Ivanyi, A., On the d-Complexity of Words, Ann. Univ. Sci. Budapest. Sect. Comput., 1987, no. 8, pp. 69\u201390."},{"key":"39_CR32","doi-asserted-by":"crossref","unstructured":"Flaxman, A., Harrow, A.W., and Sorkin, G.B., Strings with Maximally Many Distinct Subsequences and Substrings, Electronic J. Combinatorics, 2004, vol. 11, no.1, http:\/\/www.combinatorics.org\/Volume_11\/PDF\/v11i1r8.pdf.","DOI":"10.37236\/1761"},{"key":"39_CR33","doi-asserted-by":"crossref","unstructured":"Aleliunas, R., Karp. R.M., Lipton, R.J., Lovasz, L., and Rackoff, C.W., Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems, Proc. of 20th Ann. Symp. on Foundations of Computer Sci, San Juan, Puerto Rico, October 1979, pp. 218\u2013223.","DOI":"10.1109\/SFCS.1979.34"}],"container-title":["Programming and Computer Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11086-005-0039-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11086-005-0039-z","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11086-005-0039-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11086-005-0039-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T01:54:38Z","timestamp":1775008478000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11086-005-0039-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,11]]},"references-count":33,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2005,11]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s11086-005-0039-z","relation":{},"ISSN":["0361-7688","1608-3261"],"issn-type":[{"value":"0361-7688","type":"print"},{"value":"1608-3261","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,11]]}}}