{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,25]],"date-time":"2026-08-25T10:08:13Z","timestamp":1787652493720,"version":"build-2736575974"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T00:00:00Z","timestamp":1666742400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1007\/s10623-022-01132-1","type":"journal-article","created":{"date-parts":[[2022,10,26]],"date-time":"2022-10-26T14:02:44Z","timestamp":1666792964000},"page":"951-970","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A group-based structure for perfect sequence covering arrays"],"prefix":"10.1007","volume":"91","author":[{"given":"Jingzhou","family":"Na","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5296-9700","authenticated-orcid":false,"given":"Jonathan","family":"Jedwab","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shuxing","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,10,26]]},"reference":[{"key":"1132_CR1","doi-asserted-by":"crossref","unstructured":"Apilli B.: Fault-based combinatorial testing of web services. In: Proceedings of 24th ACM SIGPLAN Conference Companion on Object Oriented Programming Systems Languages and Applications, pp. 731\u2013732 (2009).","DOI":"10.1145\/1639950.1639987"},{"key":"1132_CR2","first-page":"441","volume-title":"Handbook of Combinatorial Designs","author":"FE Bennett","year":"2007","unstructured":"Bennett F.E., Mahmoodi A.: Directed designs. In: Colbourn C.J., Dinitz J.H. (eds.) Handbook of Combinatorial Designs, 2nd edn, pp. 441\u2013444. Chapman and Hall, Boca Raton (2007).","edition":"2"},{"issue":"4","key":"1132_CR3","doi-asserted-by":"publisher","first-page":"1844","DOI":"10.1137\/120894099","volume":"27","author":"YM Chee","year":"2013","unstructured":"Chee Y.M., Colbourn C.J., Horsley D., Zhou J.: Sequence covering arrays. SIAM J. Discret. Math. 27(4), 1844\u20131861 (2013).","journal-title":"SIAM J. Discret. Math."},{"key":"1132_CR4","series-title":"Coding Theory and Related Combinatorics","first-page":"99","volume-title":"Information Security","author":"CJ Colbourn","year":"2011","unstructured":"Colbourn C.J.: Covering arrays and hash families. In: Crnkovi\u0107 D., Tonchev V. (eds.) Information Security, pp. 99\u2013135. Coding Theory and Related Combinatorics. IOS Press, Amsterdam (2011)."},{"issue":"2\u20133","key":"1132_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/BF02579211","volume":"4","author":"JE Dawson","year":"1984","unstructured":"Dawson J.E., Seberry J., Skillicorn D.B.: The directed packing numbers DD$$(t, v, v)$$, $$t \\ge 4$$. Combinatorica 4(2\u20133), 121\u2013130 (1984).","journal-title":"Combinatorica"},{"issue":"2","key":"1132_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/(SICI)1098-2418(199603)8:2<97::AID-RSA1>3.0.CO;2-J","volume":"8","author":"Z F\u00fcredi","year":"1996","unstructured":"F\u00fcredi Z.: Scrambling permutations and entropy of hypergraphs. Random Struct. Algor. 8(2), 97\u2013104 (1996).","journal-title":"Random Struct. Algor."},{"key":"1132_CR7","doi-asserted-by":"crossref","unstructured":"Gentle A.R., Wanless I.M.: On perfect sequence covering arrays. Ann. Comb. (2022). arXiv:2202.01960.","DOI":"10.1007\/s00026-022-00610-6"},{"key":"1132_CR8","doi-asserted-by":"crossref","unstructured":"Huang S., Cohen M.B., Memon A.M.: Repairing GUI test suites using a genetic algorithm. In: 2010 Third International Conference on Software Testing, Verification and Validation, pp. 245\u2013254 (2010).","DOI":"10.1109\/ICST.2010.39"},{"issue":"1\u20133","key":"1132_CR9","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0012-365X(95)00087-D","volume":"159","author":"Y Ishigami","year":"1996","unstructured":"Ishigami Y.: An extremal problem of $$d$$ permutations containing every permutation of every $$t$$ elements. Discret. Math. 159(1\u20133), 279\u2013283 (1996).","journal-title":"Discret. Math."},{"issue":"1","key":"1132_CR10","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1002\/jcd.10069","volume":"12","author":"A Klein","year":"2004","unstructured":"Klein A.: On perfect deletion-correcting codes. J. Comb. Des. 12(1), 72\u201377 (2004).","journal-title":"J. Comb. Des."},{"key":"1132_CR11","doi-asserted-by":"crossref","unstructured":"Kuhn D.R., Higdon J.M., Lawrence J.F., Kacker R.N., Lei Y.: Combinatorial methods for event sequence testing. In: 2012 IEEE Fifth International Conference on Software Testing, Verification and Validation, pp. 601\u2013609 (2012).","DOI":"10.1109\/ICST.2012.147"},{"key":"1132_CR12","unstructured":"Levenshtein V.I.: Perfect deletion-correcting codes as combinatorial designs. In: II International Workshop Algebraic and Combinatorial Coding Theory, pp. 137\u2013140 (1990)."},{"key":"1132_CR13","doi-asserted-by":"crossref","unstructured":"Levenshtein V.I.: Perfect codes in the metric of deletions and insertions. Diskr. Mat. 3(1), 3\u201320 (1991). English translation in: Discret. Math. Appl. 2(3), 241\u2013258 (1992).","DOI":"10.1515\/dma.1992.2.3.241"},{"key":"1132_CR14","doi-asserted-by":"crossref","unstructured":"Mathon R.: Searching for spreads and packings. In: Hirschfeld J.W.P., Magliveras S.S., de\u00a0Resmini M.J. (eds.) Geometry, Combinatorial Designs and Related Structures. Proceedings of First Pythagorean Conference, pp. 161\u2013176. Cambridge University Press, Cambridge (1997).","DOI":"10.1017\/CBO9780511526114.014"},{"key":"1132_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1023\/A:1008353723204","volume":"18","author":"R Mathon","year":"1999","unstructured":"Mathon R., van Trung T.: Directed $$t$$-packings and directed $$t$$-Steiner systems. Des. Codes Cryptogr. 18, 187\u2013198 (1999).","journal-title":"Des. Codes Cryptogr."},{"key":"1132_CR16","unstructured":"Na J.: Perfect sequence covering arrays. Master\u2019s thesis, Simon Fraser University (2021)."},{"issue":"4","key":"1132_CR17","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1002\/rsa.10082","volume":"22","author":"J Radhakrishnan","year":"2003","unstructured":"Radhakrishnan J.: A note on scrambling permutations. Random Struct. Algor. 22(4), 435\u2013439 (2003).","journal-title":"Random Struct. Algor."},{"issue":"3\u20134","key":"1132_CR18","first-page":"349","volume":"22","author":"J Spencer","year":"1971","unstructured":"Spencer J.: Minimal scrambling sets of simple orders. Acta Math. Hung. 22(3\u20134), 349\u2013353 (1971).","journal-title":"Acta Math. Hung."},{"key":"1132_CR19","unstructured":"The GAP Group. GAP\u2014Groups, Algorithms, and Programming, Version 4.11.0 (2020)."},{"key":"1132_CR20","doi-asserted-by":"crossref","unstructured":"Wang W., Sampath S., Lei Y., Kacker R.: An interaction-based test sequence generation approach for testing web applications. In: 2008 11th IEEE High Assurance Systems Engineering Symposium, pp. 209\u2013218 (2008).","DOI":"10.1109\/HASE.2008.53"},{"key":"1132_CR21","doi-asserted-by":"crossref","unstructured":"Wang W., Lei Y., Sampath S., Kacker R., Kuhn R., Lawrence J.: A combinatorial approach to building navigation graphs for dynamic web applications. In: 2009 IEEE International Conference on Software Maintenance, pp. 211\u2013220 (2009).","DOI":"10.1109\/ICSM.2009.5306321"},{"key":"1132_CR22","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/S0195-6698(13)80046-7","volume":"11","author":"RM Wilson","year":"1990","unstructured":"Wilson R.M.: A diagonal form for the incidence matrices of $$t$$-subsets vs. $$k$$-subsets. Eur. J. Comb. 11, 609\u2013615 (1990).","journal-title":"Eur. J. Comb."},{"issue":"1","key":"1132_CR23","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1109\/TSE.2009.68","volume":"36","author":"X Yuan","year":"2010","unstructured":"Yuan X., Memon A.M.: Generating event sequence-based test cases using GUI runtime state feedback. IEEE Trans. Softw. Eng. 36(1), 81\u201395 (2010).","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"4","key":"1132_CR24","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1109\/TSE.2010.50","volume":"37","author":"X Yuan","year":"2011","unstructured":"Yuan X., Cohen M.B., Memon A.M.: GUI interaction testing: incorporating event context. IEEE Trans. Softw. Eng. 37(4), 559\u2013574 (2011).","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1132_CR25","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s10623-019-00698-7","volume":"88","author":"R Yuster","year":"2020","unstructured":"Yuster R.: Perfect sequence covering arrays. Des. Codes Cryptogr. 88, 585\u2013593 (2020).","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01132-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01132-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01132-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,10]],"date-time":"2023-03-10T18:20:57Z","timestamp":1678472457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01132-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,26]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,3]]}},"alternative-id":["1132"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01132-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10,26]]},"assertion":[{"value":"25 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 October 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}