{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:13:26Z","timestamp":1759637606424},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2009,10,11]],"date-time":"2009-10-11T00:00:00Z","timestamp":1255219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10623-009-9333-8","type":"journal-article","created":{"date-parts":[[2009,10,9]],"date-time":"2009-10-09T23:40:42Z","timestamp":1255131642000},"page":"201-219","source":"Crossref","is-referenced-by-count":36,"title":["Covering arrays from cyclotomy"],"prefix":"10.1007","volume":"55","author":[{"given":"Charles J.","family":"Colbourn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,11]]},"reference":[{"issue":"4","key":"9333_CR1","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1002\/net.3230230404","volume":"23","author":"W. Ananchuen","year":"1993","unstructured":"Ananchuen W., Caccetta L.: On the adjacency properties of Paley graphs. Networks 23(4), 227\u2013236 (1993)","journal-title":"Networks"},{"key":"9333_CR2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/PL00009813","volume":"18","author":"J. Azar","year":"1998","unstructured":"Azar J., Motwani R., Naor J.: Approximating probability distributions using small sample spaces. Combinatorica 18, 151\u2013171 (1998)","journal-title":"Combinatorica"},{"issue":"4","key":"9333_CR3","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1002\/jgt.3190050414","volume":"5","author":"A. Blass","year":"1981","unstructured":"Blass A., Exoo G., Harary F.: Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory 5(4), 435\u2013439 (1981)","journal-title":"J. Graph Theory"},{"key":"9333_CR4","unstructured":"Bollob\u00e1s B.: Random Graphs. Academic Press Inc., London (1985)."},{"issue":"4","key":"9333_CR5","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1002\/jcd.10002","volume":"10","author":"M.A. Chateauneuf","year":"2002","unstructured":"Chateauneuf M.A., Kreher D.L.: On the state of strength-three covering arrays. J. Combin. Des. 10(4), 217\u2013238 (2002)","journal-title":"J. Combin. Des."},{"key":"9333_CR6","doi-asserted-by":"crossref","first-page":"2709","DOI":"10.1016\/j.disc.2006.06.036","volume":"308","author":"M.B. Cohen","year":"2008","unstructured":"Cohen M.B., Colbourn C.J., Ling A.C.H.: Constructing strength three covering arrays with augmented annealing. Discrete Math. 308, 2709\u20132722 (2008)","journal-title":"Discrete Math."},{"key":"9333_CR7","first-page":"121","volume":"58","author":"C.J. Colbourn","year":"2004","unstructured":"Colbourn C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121\u2013167 (2004)","journal-title":"Le Matematiche (Catania)"},{"key":"9333_CR8","unstructured":"Colbourn C.J.: Covering array tables. http:\/\/www.public.asu.edu\/~ccolbou\/src\/tabby , 2005\u2014present."},{"key":"9333_CR9","unstructured":"Colbourn C.J.: Distributing hash families and covering arrays. J. Combin. Inf. Syst. Sci. (to appear)."},{"key":"9333_CR10","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/978-3-642-01877-0_3","volume":"5557","author":"C.J. Colbourn","year":"2009","unstructured":"Colbourn C.J., K\u00e9ri G.: Covering arrays and existentially closed graphs. Lect. Notes Comput. Sci. 5557, 22\u201333 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9333_CR11","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-006-0020-8","volume":"41","author":"C.J. Colbourn","year":"2006","unstructured":"Colbourn C.J., Martirosyan S.S., van Trung T., Walker R.A. II: Roux-type constructions for covering arrays of strengths three and four. Des. Codes Cryptogr. 41, 33\u201357 (2006)","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"9333_CR12","doi-asserted-by":"crossref","first-page":"287","DOI":"10.6028\/jres.113.022","volume":"113","author":"M. Forbes","year":"2008","unstructured":"Forbes M., Lawrence J., Lei Y., Kacker R.N., Kuhn D.R.: Refining the in-parameter-order strategy for constructing covering arrays. J. Res. Nat. Inst. Stand. Tech. 113(5), 287\u2013297 (2008)","journal-title":"J. Res. Nat. Inst. Stand. Tech."},{"key":"9333_CR13","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1017\/S0963548300001905","volume":"5","author":"Godbole","year":"1996","unstructured":"Skipper D.E., Skipper D.E., Skipper D.E., , : t-covering arrays: upper bounds and Poisson approximations. Comb. Probab. Comput. 5, 105\u2013118 (1996)","journal-title":"Comb. Probab. Comput."},{"key":"9333_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.4153\/CMB-1971-007-1","volume":"14","author":"R.L. Graham","year":"1971","unstructured":"Graham R.L., Spencer J.H.: A constructive solution to a tournament problem. Canad. Math. Bull. 14, 45\u201348 (1971)","journal-title":"Canad. Math. Bull."},{"key":"9333_CR15","doi-asserted-by":"crossref","unstructured":"Hartman A.: Software and hardware testing using combinatorial covering suites. In: Golumbic M.C., Hartman I. B.-A. (eds.) Interdisciplinary Applications of Graph Theory, Combinatorics, and Algorithms, pp. 237\u2013266. Springer, Norwell, MA (2005).","DOI":"10.1007\/0-387-25036-0_10"},{"key":"9333_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal Arrays","author":"A.S. Hedayat","year":"1999","unstructured":"Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays. Springer, New York (1999)"},{"key":"9333_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"G. Katona","year":"1973","unstructured":"Katona G.: Two applications (for search theory and truth functions) of Sperner type theorems. Periodica Math. 3, 19\u201326 (1973)","journal-title":"Periodica Math."},{"key":"9333_CR18","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"D. Kleitman","year":"1973","unstructured":"Kleitman D., Spencer J.: Families of k-independent sets. Discrete Math. 6, 255\u2013262 (1973)","journal-title":"Discrete Math."},{"key":"9333_CR19","volume-title":"Finite Fields","author":"R. Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)","edition":"2"},{"key":"9333_CR20","first-page":"266","volume":"74","author":"S.S. Martirosyan","year":"2005","unstructured":"Martirosyan S.S., Colbourn C.J.: Recursive constructions of covering arrays. Bayreuth. Math. Schr. 74, 266\u2013275 (2005)","journal-title":"Bayreuth. Math. Schr."},{"issue":"1\u20133","key":"9333_CR21","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1023\/B:DESI.0000029232.40302.6d","volume":"32","author":"S.S. Martirosyan","year":"2004","unstructured":"Martirosyan S.S., van Trung T.: On t-covering arrays. Des. Codes Cryptogr. 32(1\u20133), 323\u2013339 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"9333_CR22","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/978-3-642-10217-2_40","volume":"5874","author":"P. Nayeri","year":"2009","unstructured":"Nayeri P., Colbourn C.J., Konjevod G.: Randomized postoptimization of covering arrays. Lect. Notes Comput. Sci. 5874, 408\u2013419 (2009)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9333_CR23","doi-asserted-by":"crossref","unstructured":"Schmidt W.M.: Equations over finite fields. An elementary approach. Lecture Notes in Mathematics, vol. 536. Springer, Berlin (1976).","DOI":"10.1007\/BFb0080437"},{"issue":"3","key":"9333_CR24","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1002\/jcd.20067","volume":"14","author":"G.B. Sherwood","year":"2006","unstructured":"Sherwood G.B., Martirosyan S.S., Colbourn C.J.: Covering arrays of higher strength from permutation vectors. J. Combin. Des. 14(3), 202\u2013213 (2006)","journal-title":"J. Combin. Des."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9333-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9333-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9333-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:27Z","timestamp":1559231907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9333-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,11]]},"references-count":24,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["9333"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9333-8","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,11]]}}}