{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T16:59:11Z","timestamp":1706806751442},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T00:00:00Z","timestamp":1448841600000},"content-version":"tdm","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":[[2016,1]]},"DOI":"10.1007\/s10623-015-0152-9","type":"journal-article","created":{"date-parts":[[2015,11,30]],"date-time":"2015-11-30T15:00:27Z","timestamp":1448895627000},"page":"197-219","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Finite field constructions of combinatorial arrays"],"prefix":"10.1007","volume":"78","author":[{"given":"Lucia","family":"Moura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary L.","family":"Mullen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Panario","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,30]]},"reference":[{"key":"152_CR1","unstructured":"Bailey R.A., Cameron P.J., Connelly R.: Sudoku, gerechte designs, resolutions, affine space, spreads, reguli, and Hamming codes. Am. Math. Mon. 115(5), 383\u2013404 (2008)."},{"key":"152_CR2","doi-asserted-by":"crossref","unstructured":"Brouwer A.E., Shearer J.B., Sloane N.J.A., Smith W.D.: A new table of constant weight codes. IEEE Trans. Inf. Theory 36, 1334\u20131380 (1990).","DOI":"10.1109\/18.59932"},{"key":"152_CR3","doi-asserted-by":"crossref","unstructured":"Bush K.A.: Orthogonal arrays of index unity. Ann. Math. Stat. 23(3), 426\u2013434 (1952).","DOI":"10.1214\/aoms\/1177729387"},{"key":"152_CR4","unstructured":"Castoldi A., Moura L., Panario D., Stevens B.: Ordered orthogonal array constructions using LFSR sequences. Submitted (2015)."},{"key":"152_CR5","doi-asserted-by":"crossref","unstructured":"Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32, 51\u201364 (2004).","DOI":"10.1023\/B:DESI.0000029212.52214.71"},{"key":"152_CR6","unstructured":"Colbourn C.J.: Combinatorial aspects of covering arrays. Le Matematiche (Catania) 58, 121\u2013167 (2004)."},{"key":"152_CR7","doi-asserted-by":"crossref","unstructured":"Colbourn C.J.: Covering arrays from cyclotomy. Des. Codes Cryptogr. 55, 201\u2013219 (2010).","DOI":"10.1007\/s10623-009-9333-8"},{"key":"152_CR8","unstructured":"Colbourn C.J.: Covering array tables. http:\/\/www.public.asu.edu\/ccolbou\/src\/tabby\/catable.html . Accessed 4 Oct 2015."},{"key":"152_CR9","unstructured":"Colbourn C.J., Dinitz J.H. (eds.): The CRC Handbook of Combinatorial Designs, 2nd edn. CRC, Boca Raton (2007)."},{"key":"152_CR10","doi-asserted-by":"crossref","unstructured":"Colbourn C.J., Kl\u00f8ve T., Ling A.C.H.: Permutation arrays for powerline communication and mutually orthogonal latin squares. IEEE Trans. Inf. Theory 50, 1289\u20131291 (2004).","DOI":"10.1109\/TIT.2004.828150"},{"key":"152_CR11","unstructured":"Costas J.P.: Medium constraints on sonar design and performance. Class 1 Report R65EMH33, G.E. Corporation, New York (1965)."},{"key":"152_CR12","doi-asserted-by":"crossref","unstructured":"Costas J.P.: A study of a class of detection waveforms having nearly ideal range-Doppler ambiguity properties. In: Proceedings of the IEEE, vol. 72, pp. 996\u20131009 (1984).","DOI":"10.1109\/PROC.1984.12967"},{"key":"152_CR13","unstructured":"de la Torre D.R., Colbourn C.J., Ling A.C.H.: An application of permutation arrays to block ciphers. Congr. Numer. 145, 5\u20137 (2000)."},{"key":"152_CR14","unstructured":"D\u00e9nes J., Keedwell A.D.: Latin Squares and Their Applications. Academic Press, New York (1974)."},{"key":"152_CR15","doi-asserted-by":"crossref","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).","DOI":"10.1007\/s10623-007-9052-y"},{"key":"152_CR16","doi-asserted-by":"crossref","unstructured":"Deza M., Vanstone S.A.: Bounds on permutation arrays. J. Stat. Plan. Inference 2, 197\u2013209 (1978).","DOI":"10.1016\/0378-3758(78)90008-3"},{"key":"152_CR17","doi-asserted-by":"crossref","unstructured":"Drakakis K., Gow R., McGuire G.: APN permutations on $${\\mathbb{Z}}_n$$ Z n and Costas arrays. Discret. Appl. Math. 157, 3320\u20133326 (2009).","DOI":"10.1016\/j.dam.2009.06.029"},{"key":"152_CR18","doi-asserted-by":"crossref","unstructured":"Drakakis K., Iorio F., Rickard S.: The enumeration of Costas arrays of order 28 and its consequences. Adv. Math. Commun. 5, 69\u201386 (2011).","DOI":"10.3934\/amc.2011.5.69"},{"key":"152_CR19","doi-asserted-by":"crossref","unstructured":"Drakakis K., Iorio F., Rickard S., Walsh J.: Results on the enumeration of Costas arrays of order 29. Adv. Math. Commun. 5, 547\u2013553 (2011).","DOI":"10.3934\/amc.2011.5.547"},{"key":"152_CR20","doi-asserted-by":"crossref","unstructured":"Drakakis K., Requena V., McGuire G.: On the nonlinearity of exponential Welch Costas functions. IEEE Trans. Inf. Theory 56, 1230\u20131238 (2010).","DOI":"10.1109\/TIT.2009.2039164"},{"key":"152_CR21","doi-asserted-by":"crossref","unstructured":"Ethier J., Mullen G.L.: Strong forms of orthogonality for sets of hypercubes. Discret. Math. 312, 2050\u20132061 (2012).","DOI":"10.1016\/j.disc.2012.03.008"},{"key":"152_CR22","unstructured":"Ethier J., Mullen G.L.: Strong forms of orthogonality for sets of frequency hypercubes. Quasigroups Relat. Syst. 21, 185\u2013202 (2013)."},{"key":"152_CR23","doi-asserted-by":"crossref","unstructured":"Ethier J., Mullen G.L., Panario D., Stevens B., Thomson D.: Sets of orthogonal hypercubes of class $$r$$ r . J. Comb. Theory Ser. A 119, 430\u2013439 (2011).","DOI":"10.1016\/j.jcta.2011.10.001"},{"key":"152_CR24","doi-asserted-by":"crossref","unstructured":"Golomb S.W.: Algebraic constructions for Costas arrays. J. Comb. Theory Ser. A 37, 13\u201321 (1984).","DOI":"10.1016\/0097-3165(84)90015-3"},{"key":"152_CR25","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Gong G.: Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar. Cambridge University Press, Cambridge (2005).","DOI":"10.1017\/CBO9780511546907"},{"key":"152_CR26","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Gong G.: The status of Costas arrays. IEEE Trans. Inf. Theory 53, 4260\u20134265 (2007).","DOI":"10.1109\/TIT.2007.907524"},{"key":"152_CR27","doi-asserted-by":"crossref","unstructured":"Golomb S.W., Moreno O.: On periodicity properties of Costas arrays and a conjecture on permutation polynomials. IEEE Trans. Inf. Theory 42, 2252\u20132253 (1996).","DOI":"10.1109\/18.556616"},{"key":"152_CR28","doi-asserted-by":"crossref","unstructured":"Hedayat A.S., Sloane N.J.A., Stufken J.: Orthogonal Arrays: Theory and Applications. Springer, Berlin (1999).","DOI":"10.1007\/978-1-4612-1478-6"},{"key":"152_CR29","unstructured":"Huczynska S., Mullen G.L.: Constructing permutation arrays using affine resolvable designs. Preprint."},{"key":"152_CR30","doi-asserted-by":"crossref","unstructured":"Jedwab J., Wodlinger J.: The deficiency of Costas arrays. IEEE Trans. Inf. Theory 60, 7947\u20137954 (2014).","DOI":"10.1109\/TIT.2014.2360517"},{"key":"152_CR31","doi-asserted-by":"crossref","unstructured":"Lawrence K.M.: A combinatorial characterization of $$(t, m, s)$$ ( t , m , s ) . J. Comb. Des. 4, 275\u2013293 (1996).","DOI":"10.1002\/(SICI)1520-6610(1996)4:4<275::AID-JCD5>3.0.CO;2-C"},{"key":"152_CR32","unstructured":"Laywine C.F., Mullen G.L.: Discrete Mathematics Using Latin Squares. Wiley, New York (1998)."},{"key":"152_CR33","unstructured":"Lidl R., Niederreiter H.: Finite Fields, 2nd edn. Cambridge University Press, Cambridge (1997)."},{"key":"152_CR34","doi-asserted-by":"crossref","unstructured":"Martin W.J., Stinson D.R.: A generalized Rao bound for ordered orthogonal arrays and $$(t, m, s)$$ ( t , m , s ) -nets. Can. Math. Bull. 442, 359\u2013370 (1999).","DOI":"10.4153\/CMB-1999-042-x"},{"key":"152_CR35","doi-asserted-by":"crossref","unstructured":"Mavron V.C., McDonough T.P., Mullen G.L.: The geometry of sets of orthogonal frequency hypercubes. J. Comb. Des. 15, 449\u2013459 (2007).","DOI":"10.1002\/jcd.20135"},{"key":"152_CR36","doi-asserted-by":"crossref","unstructured":"Morgan I.H.: Properties of complete sets of mutually equiorthogonal frequency hypercubes. Ann. Comb. 1, 377\u2013389 (1997).","DOI":"10.1007\/BF02558488"},{"key":"152_CR37","doi-asserted-by":"crossref","unstructured":"Morgan I.H.: Construction of complete sets of mutually orthogonal frequency hypercubes. Discret. Math. 186, 237\u2013251 (1998).","DOI":"10.1016\/S0012-365X(97)00195-7"},{"key":"152_CR38","doi-asserted-by":"crossref","unstructured":"Mullen G.L.: Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order. Discret. Math. 69, 79\u201384 (1988).","DOI":"10.1016\/0012-365X(88)90179-3"},{"key":"152_CR39","unstructured":"Mullen G.L.: Latin squares. In: Mullen G.L., Panario D. (eds.) Handbook of Finite Fields, pp. 550\u2013556. CRC, Boca Raton (2013)."},{"key":"152_CR40","doi-asserted-by":"crossref","unstructured":"Mullen G.L., Panario D.: Handbook of Finite Fields. Series on Discrete Mathematics and Its Applications. CRC, Boca Raton (2013).","DOI":"10.1201\/b15006"},{"key":"152_CR41","doi-asserted-by":"crossref","unstructured":"Mullen G.L., Schmid W.C.: An equivalence between $$(t, m, s)$$ ( t , m , s ) -nets and strongly orthogonal hypercubes. J. Comb. Theory Ser. A 76, 164\u2013174 (1996).","DOI":"10.1006\/jcta.1996.0098"},{"key":"152_CR42","doi-asserted-by":"crossref","unstructured":"Mullen G.L., Whittle G.: Points sets with uniformity properties and orthogonal hypercubes. Monatsh. Math. 113, 265\u2013273 (1992).","DOI":"10.1007\/BF01301071"},{"key":"152_CR43","unstructured":"Mullen G.L., Yucas J.: Primitive polynomials over finite fields and partial orthogonal arrays. preprint."},{"key":"152_CR44","doi-asserted-by":"crossref","unstructured":"Munemasa A.: Orthogonal arrays, primitive trinomials, and shift-register sequences. Finite Fields Appl. 4(3), 252\u2013260 (1998).","DOI":"10.1006\/ffta.1998.0213"},{"key":"152_CR45","doi-asserted-by":"crossref","unstructured":"Muratovi\u0107-Ribi\u0107 A., Pott A., Thomson D., Wang Q.: On the characterization of a semi-multiplicative analogue of planar functions over finite fields. Contemp. Math. 632, 317\u2013325 (2015).","DOI":"10.1090\/conm\/632\/12635"},{"key":"152_CR46","doi-asserted-by":"crossref","unstructured":"Niederreiter H.: Point sets and sequences with small discrepancy. Monatsh. Math. 104, 273\u2013377 (1987).","DOI":"10.1007\/BF01294651"},{"key":"152_CR47","doi-asserted-by":"crossref","unstructured":"Niederreiter H.: Random number generation and quasi-Monte Carlo methods. CBMS-NSF Ser. Appl. Math. 63, SIAM, Philadelphia (1992).","DOI":"10.1137\/1.9781611970081"},{"key":"152_CR48","doi-asserted-by":"crossref","unstructured":"Panario D., Sakzad A., Stevens B., Wang Q.: Two new measures for permutations: ambiguity and deficiency. IEEE Trans. Inf. Theory 57, 7648\u20137657 (2011).","DOI":"10.1109\/TIT.2011.2159478"},{"key":"152_CR49","doi-asserted-by":"crossref","unstructured":"Panario D., Sakzad A., Stevens B., Thomson D., Wang Q.: Ambiguity and deficiency of permutations over finite fields with linearized difference map. IEEE Trans. Inf. Theory 59, 5616\u20135626 (2013).","DOI":"10.1109\/TIT.2013.2262021"},{"key":"152_CR50","doi-asserted-by":"crossref","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).","DOI":"10.1007\/s10623-011-9565-2"},{"key":"152_CR51","doi-asserted-by":"crossref","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).","DOI":"10.1007\/s10623-013-9835-2"},{"key":"152_CR52","doi-asserted-by":"crossref","unstructured":"Sherwood G.B., Martirosyan S.S., Colbourn C.J.: Covering arrays of higher strength from permutation vectors. J. Comb. Des. 14(3), 202\u2013213 (2006).","DOI":"10.1002\/jcd.20067"},{"key":"152_CR53","doi-asserted-by":"crossref","unstructured":"Tzanakis G., Moura L., Panario D., Stevens B.: Constructing new covering arrays from LFSR sequences over finite fields. Discret. Math. (to appear) (2015).","DOI":"10.1016\/j.disc.2015.10.040"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0152-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-015-0152-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-015-0152-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T02:15:21Z","timestamp":1567390521000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-015-0152-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,30]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["152"],"URL":"https:\/\/doi.org\/10.1007\/s10623-015-0152-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,30]]}}}