{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:54:17Z","timestamp":1762955657119,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T00:00:00Z","timestamp":1482105600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s10623-016-0316-2","type":"journal-article","created":{"date-parts":[[2016,12,19]],"date-time":"2016-12-19T06:38:33Z","timestamp":1482129513000},"page":"437-456","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Covering arrays from m-sequences and character sums"],"prefix":"10.1007","volume":"85","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9091-7503","authenticated-orcid":false,"given":"Georgios","family":"Tzanakis","sequence":"first","affiliation":[]},{"given":"Lucia","family":"Moura","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[]},{"given":"Brett","family":"Stevens","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,19]]},"reference":[{"issue":"2","key":"316_CR1","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s00200-008-0058-0","volume":"19","author":"TL Alderson","year":"2008","unstructured":"Alderson T.L., Bruen A.: Maximal AMDS codes. Appl. Algebra Eng. Commun. Comput. 19(2), 87\u201398 (2008).","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"316_CR2","volume-title":"Gauss and Jacobi Sums","author":"BC Berndt","year":"2016","unstructured":"Berndt B.C., Evans R.J., Williams K.S.: Gauss and Jacobi Sums. Wiley, New York (2016)."},{"key":"316_CR3","first-page":"107","volume":"8","author":"RC Bose","year":"1947","unstructured":"Bose R.C.: Mathematical theory of the symmetrical factorial design. Sankhya 8, 107\u2013166 (1947).","journal-title":"Sankhya"},{"issue":"1","key":"316_CR4","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1002\/stvr.393","volume":"19","author":"RC Bryce","year":"2009","unstructured":"Bryce R.C., Colbourn C.J.: A density-based greedy algorithm for higher strength covering arrays. Softw. Test. Verif. Reliab. 19(1), 37\u201353 (2009).","journal-title":"Softw. Test. Verif. Reliab."},{"issue":"5","key":"316_CR5","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1109\/52.536462","volume":"13","author":"DM Cohen","year":"1996","unstructured":"Cohen D.M., Siddhartha R.D., Parelius J., Patton G.C.: The combinatorial design approach to automatic test generation. IEEE Softw. 13(5), 83 (1996).","journal-title":"IEEE Softw."},{"key":"316_CR6","first-page":"121","volume":"58","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121\u2013167 (2004).","journal-title":"Le Matematiche (Catania)"},{"issue":"2\u20133","key":"316_CR7","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10623-009-9333-8","volume":"55","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn C.J.: Covering arrays from cyclotomy. Des. Codes Cryptogr. 55(2\u20133), 201\u2013219 (2010).","journal-title":"Des. Codes Cryptogr."},{"key":"316_CR8","doi-asserted-by":"crossref","DOI":"10.1201\/9781003040897","volume-title":"CRC Handbook of Combinatorial Designs","author":"CJ Colbourn","year":"2010","unstructured":"Colbourn C.J., Dinitz J.H.: CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (2010)."},{"key":"316_CR9","unstructured":"Colbourn C.J.: Covering array tables. www.public.asu.edu\/ccolbou\/src\/tabby\/catable.html ."},{"issue":"2","key":"316_CR10","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF00124590","volume":"9","author":"MA Boer De","year":"1996","unstructured":"De Boer M.A.: Almost MDS codes. Des. Codes Cryptogr. 9(2), 143\u2013155 (1996).","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"316_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10623-007-9052-y","volume":"45","author":"M Dewar","year":"2007","unstructured":"Dewar M., Moura L., Panario D., Stevens B., Wang Q.: Division of trinomials by pentanomials and orthogonal arrays. Des. Codes Cryptogr. 45(1), 1\u201317 (2007).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"316_CR12","doi-asserted-by":"crossref","first-page":"1163","DOI":"10.4153\/CJM-1985-063-1","volume":"37","author":"GL Ebert","year":"1985","unstructured":"Ebert G.L.: Partitioning projective geometries into caps. Can. J. Math. 37(6), 1163\u20131175 (1985).","journal-title":"Can. J. Math."},{"key":"316_CR13","unstructured":"Giulietti, M.: On near-MDS elliptic codes. arXiv:math\/0211107 (2002)"},{"key":"316_CR14","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546907","volume-title":"Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar","author":"SW Golomb","year":"2005","unstructured":"Golomb S.W., Gong G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005)."},{"key":"316_CR15","volume-title":"Orthogonal Arrays: Theory and Applications","author":"AS Hedayat","year":"2012","unstructured":"Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays: Theory and Applications. Springer, New York (2012)."},{"key":"316_CR16","doi-asserted-by":"crossref","unstructured":"Hirschfeld J.W.P., Storme L.: The packing problem in statistics, coding theory and finite projective spaces: update 2001. In: Finite Geometries, pp. 201\u2013246. Springer, New York (2001).","DOI":"10.1007\/978-1-4613-0283-4_13"},{"issue":"1\u20132","key":"316_CR17","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF02018457","volume":"3","author":"GOH Katona","year":"1973","unstructured":"Katona G.O.H.: Two applications (for search theory and truth functions) of Sperner type theorems. Period. Math. Hung. 3(1\u20132), 19\u201326 (1973).","journal-title":"Period. Math. Hung."},{"key":"316_CR18","doi-asserted-by":"publisher","unstructured":"Kim R., Song O.H., Ri M.H.: Division of tetranomials by type II pentanomials and orthogonal arrays. Vietnam J. Math. (2016). doi: 10.1007\/s10013-015-0182-7 .","DOI":"10.1007\/s10013-015-0182-7"},{"issue":"3","key":"316_CR19","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/0012-365X(73)90098-8","volume":"6","author":"DJ Kleitman","year":"1973","unstructured":"Kleitman D.J., Spencer J.: Families of $$k$$ k -independent sets. Discret. Math. 6(3), 255\u2013262 (1973).","journal-title":"Discret. Math."},{"issue":"6","key":"316_CR20","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1109\/TSE.2004.24","volume":"30","author":"DR Kuhn","year":"2004","unstructured":"Kuhn D.R., Wallace D.R., Gallo Jr. A.M.: Software fault interactions and implications for software testing. IEEE Trans. Softw. Eng. 30(6), 418\u2013421 (2004).","journal-title":"IEEE Trans. Softw. Eng."},{"key":"316_CR21","volume-title":"Finite Fields","author":"R Lidl","year":"1997","unstructured":"Lidl R., Niederreiter H.: Finite Fields, vol. 20. Cambridge University Press, Cambridge (1997)."},{"issue":"1","key":"316_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10623-015-0152-9","volume":"78","author":"L Moura","year":"2016","unstructured":"Moura L., Mullen G.L., Panario D.: Finite field constructions of combinatorial arrays. Des. Codes Cryptogr. 78(1), 197\u2013219 (2016).","journal-title":"Des. Codes Cryptogr."},{"key":"316_CR23","doi-asserted-by":"crossref","DOI":"10.1201\/b15006","volume-title":"Handbook of Finite Fields","author":"GL Mullen","year":"2013","unstructured":"Mullen G.L., Panario D.: Handbook of Finite Fields. CRC Press, Boca Raton (2013)."},{"issue":"3","key":"316_CR24","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1006\/ffta.1998.0213","volume":"4","author":"A Munemasa","year":"1998","unstructured":"Munemasa A.: Orthogonal arrays, primitive trinomials, and shift-register sequences. Finite Fields Appl. 4(3), 252\u2013260 (1998).","journal-title":"Finite Fields Appl."},{"issue":"3","key":"316_CR25","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/s10623-011-9565-2","volume":"63","author":"D Panario","year":"2012","unstructured":"Panario D., Sosnovski O., Stevens B., Wang Q.: Divisibility of polynomials over finite fields and combinatorial applications. Des. Codes Cryptogr. 63(3), 425\u2013445 (2012).","journal-title":"Des. Codes Cryptogr."},{"key":"316_CR26","first-page":"1","volume":"134","author":"B Qvist","year":"1952","unstructured":"Qvist B.: Some remarks concerning curves of the second degree in a finite plane. Suomalainen Tiedeakatemia 134, 1\u201327 (1952).","journal-title":"Suomalainen Tiedeakatemia"},{"issue":"3","key":"316_CR27","doi-asserted-by":"crossref","first-page":"949","DOI":"10.1007\/s10623-013-9835-2","volume":"73","author":"S Raaphorst","year":"2014","unstructured":"Raaphorst S., Moura L., Stevens B.: A construction for strength-3 covering arrays from linear feedback shift register sequences. Des. Codes Cryptogr. 73(3), 949\u2013968 (2014).","journal-title":"Des. Codes Cryptogr."},{"key":"316_CR28","volume-title":"Foundations of Probability","author":"A R\u00e9nyi","year":"1971","unstructured":"R\u00e9nyi A.: Foundations of Probability. Wiley, New York (1971)."},{"key":"316_CR29","unstructured":"Stein W.A., Abbott T., Abshoff M.: Sage mathematics software (2011)."},{"key":"316_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3810-9","volume-title":"Algebraic-Geometric Codes","author":"M Tsfasman","year":"1991","unstructured":"Tsfasman M., Vl\u0103dut S.G.: Algebraic-Geometric Codes. Kluwer, Dordrecht (1991)."},{"issue":"3","key":"316_CR31","doi-asserted-by":"crossref","first-page":"1158","DOI":"10.1016\/j.disc.2015.10.040","volume":"339","author":"G Tzanakis","year":"2016","unstructured":"Tzanakis G., Moura L., Panario D., Stevens B.: Constructing new covering arrays from LFSR sequences over finite fields. Discret. Math. 339(3), 1158\u20131171 (2016).","journal-title":"Discret. Math."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0316-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0316-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0316-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T01:04:08Z","timestamp":1658106248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0316-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,19]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["316"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0316-2","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,12,19]]}}}