{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:31:09Z","timestamp":1759336269119,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T00:00:00Z","timestamp":1655683200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1718994"],"award-info":[{"award-number":["CCF-1718994"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10623-022-01039-x","type":"journal-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T07:05:38Z","timestamp":1655708738000},"page":"1659-1677","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Using permutation rational functions to obtain permutation arrays with large hamming distance"],"prefix":"10.1007","volume":"90","author":[{"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[]},{"given":"Brian","family":"Malouf","sequence":"additional","affiliation":[]},{"given":"Linda","family":"Morales","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Stanley","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-9891","authenticated-orcid":false,"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,6,20]]},"reference":[{"issue":"5","key":"1039_CR1","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s10623-017-0381-1","volume":"86","author":"S Bereg","year":"2018","unstructured":"Bereg S., Levy A., Sudborough I.H.: Constructing permutation arrays from groups. Des. Codes Cryptogr. 86(5), 1095\u20131111 (2018).","journal-title":"Des. Codes Cryptogr."},{"key":"1039_CR2","doi-asserted-by":"publisher","unstructured":"Bereg S., Malouf B., Morales L., Stanley T., Sudborough I.H.: Improved lower bounds for permutation arrays using permutation rational functions. In: Bajard J., Topuzoglu A. (eds.), 8th International Workshop on the Arithmetic of Finite Fields (WAIFI 2020), volume 12542 of Lecture Notes in Computer Science, pp. 234\u2013252. Springer, (2020) https:\/\/doi.org\/10.1007\/978-3-030-68869-1_14.","DOI":"10.1007\/978-3-030-68869-1_14"},{"key":"1039_CR3","unstructured":"Bereg S., Malouf B., Morales L., Stanley T., Sudborough I.H., Wong A.: Equivalence relations for computing permutation polynomials. arXiv e-prints, arXiv:1911.12823, (2019)."},{"key":"1039_CR4","doi-asserted-by":"publisher","first-page":"2105","DOI":"10.1007\/s10623-019-00607-y","volume":"87","author":"S Bereg","year":"2019","unstructured":"Bereg S., Miller Z., Mojica L.G., Morales L., Sudborough I.H.: New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87, 2105\u20132128 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1039_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-019-00684-z","volume":"88","author":"S Bereg","year":"2020","unstructured":"Bereg S., Mojica L.G., Morales L., Sudborough I.H.: Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88(2), 311\u2013339 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"3","key":"1039_CR6","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10623-016-0263-y","volume":"83","author":"S Bereg","year":"2017","unstructured":"Bereg S., Morales L., Sudborough I.H.: Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3), 661\u2013683 (2017).","journal-title":"Des. Codes Cryptogr."},{"issue":"1\u20133","key":"1039_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/B:DESI.0000029212.52214.71","volume":"32","author":"W Chu","year":"2004","unstructured":"Chu W., Colbourn C.J., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32(1\u20133), 51\u201364 (2004).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1039_CR8","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","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(6), 1289\u20131291 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1039_CR9","first-page":"5","volume":"145","author":"DR de la Torre","year":"2000","unstructured":"de la Torre D.R., Colbourn C.J., Ling A.C.H.: An application of permutation arrays to block ciphers. Cong. Numer. 145, 5\u20137 (2000).","journal-title":"Cong. Numer."},{"key":"1039_CR10","unstructured":"Ding Z., Zieve M.E.: Low-degree permutation rational functions over finite fields. arXiv: 2010.15657, (2020)."},{"key":"1039_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ffa.2019.05.001","volume":"59","author":"X Fan","year":"2019","unstructured":"Fan X.: A classification of permutation polynomials of degree 7 over finite fields. Finite Fields Appl. 59, 1\u201321 (2019).","journal-title":"Finite Fields Appl."},{"key":"1039_CR12","doi-asserted-by":"crossref","unstructured":"Fan X.: Permutation polynomials of degree 8 over finite fields of characteristic 2. arXiv e-prints, page arXiv:1903.10309, (2019).","DOI":"10.1016\/j.ffa.2020.101662"},{"key":"1039_CR13","doi-asserted-by":"crossref","unstructured":"Fan X.: Permutation polynomials of degree 8 over finite fields of odd characteristic. Bull. Aust. Math. Soc. 1\u201316 (2019).","DOI":"10.1017\/S0004972719000674"},{"key":"1039_CR14","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1007\/s10623-020-00715-0","volume":"88","author":"A Ferraguti","year":"2020","unstructured":"Ferraguti A., Micheli G.: Full classification of permutation rational functions and complete rational functions of degree 3. Des. Codes Cryptogr. 88, 867\u2013886 (2020).","journal-title":"Des. Codes Cryptogr."},{"issue":"5","key":"1039_CR15","first-page":"2401","volume":"2000","author":"HC Ferreira","year":"2000","unstructured":"Ferreira H.C., Vinck A.J.H.: Interference cancellation with permutation trellis codes. IEEE-VTC Fall Veh. Technol. Conf. 2000(5), 2401\u20132407 (2000).","journal-title":"IEEE-VTC Fall Veh. Technol. Conf."},{"issue":"5","key":"1039_CR16","doi-asserted-by":"publisher","first-page":"3059","DOI":"10.1109\/TIT.2013.2237945","volume":"59","author":"F Gao","year":"2013","unstructured":"Gao F., Yang Y., Ge G.: An improvement on the Gilbert-Varshamov bound for permutation codes. IEEE Trans. Inf. Theory 59(5), 3059\u20133063 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"318","key":"1039_CR17","doi-asserted-by":"publisher","first-page":"2005","DOI":"10.1090\/mcom\/3400","volume":"88","author":"FA Guidi","year":"2019","unstructured":"Guidi F.A., Lindqvist S., Micheli G.: Full orbit sequences in affine spaces via fractional jumps and pseudorandom number generation. Math. Comput. 88(318), 2005\u20132025 (2019).","journal-title":"Math. Comput."},{"key":"1039_CR18","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.ffa.2014.10.001","volume":"32","author":"X Hou","year":"2015","unstructured":"Hou X.: Permutation polynomials over finite fields\u2014a survey of recent advances. Finite Fields Appl. 32, 82\u2013119 (2015).","journal-title":"Finite Fields Appl."},{"key":"1039_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101758","volume":"68","author":"X Hou","year":"2020","unstructured":"Hou X., Sze C.: On a type of permutation rational functions over finite fields. Finite Fields Appl. 68, 101758 (2020).","journal-title":"Finite Fields Appl."},{"key":"1039_CR20","unstructured":"Hou X.-D.: Rational functions of degree four that permute the projective line over a finite field. arXiv: 2005.07213v2, (2020)."},{"issue":"1849","key":"1039_CR21","doi-asserted-by":"publisher","first-page":"3199","DOI":"10.1098\/rsta.2006.1885","volume":"364","author":"S Huczynska","year":"2006","unstructured":"Huczynska S.: Powerline communication and the 36 officers problem. Philoa. Trans. R. Soc. A 364(1849), 3199\u20133214 (2006).","journal-title":"Philoa. Trans. R. Soc. A"},{"issue":"3","key":"1039_CR22","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-014-9930-z","volume":"75","author":"I Janiszczak","year":"2015","unstructured":"Janiszczak I., Lempken W., \u00d6sterg\u00e5rd P.R.J., Staszewski R.: Permutation codes invariant under isometries. Des. Codes Cryptogr. 75(3), 497\u2013507 (2015).","journal-title":"Des. Codes Cryptogr."},{"issue":"9","key":"1039_CR23","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1002\/jcd.21661","volume":"27","author":"I Janiszczak","year":"2019","unstructured":"Janiszczak I., Staszewski R.: Isometry invariant permutation codes and mutually orthogonal latin squares. J. Comb. Des. 27(9), 541\u2013551 (2019).","journal-title":"J. Comb. Des."},{"key":"1039_CR24","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/j.ffa.2010.07.001","volume":"16","author":"J Li","year":"2010","unstructured":"Li J., Chandler D.B., Xiang Q.: Permutation polynomials of degree 6 or 7 over finite fields of characteristic 2. Finite Fields Appl. 16, 406\u2013419 (2010).","journal-title":"Finite Fields Appl."},{"issue":"1","key":"1039_CR25","doi-asserted-by":"publisher","first-page":"71","DOI":"10.2307\/2324822","volume":"100","author":"R Lidl","year":"1993","unstructured":"Lidl R., Mullen G.L.: When does a polynomial over a finite field permute the elements of the fields II? Am. Math. Monthly 100(1), 71\u201374 (1993).","journal-title":"Am. Math. Monthly"},{"issue":"7","key":"1039_CR26","doi-asserted-by":"publisher","first-page":"4019","DOI":"10.1109\/TIT.2019.2957354","volume":"66","author":"G Micheli","year":"2020","unstructured":"Micheli G., Neri A.: New lower bounds for permutation codes using linear block codes. IEEE Trans. Inf. Theory 66(7), 4019\u20134025 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1039_CR27","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/MCOM.2003.1193972","volume":"41","author":"N Pavlidou","year":"2003","unstructured":"Pavlidou N., Vinck A.H., Yazdani J., Honary B.: Power line communications: state of the art and future trends. IEEE Commun. Mag. 41(4), 34\u201340 (2003).","journal-title":"IEEE Commun. Mag."},{"key":"1039_CR28","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.ffa.2012.12.003","volume":"20","author":"CJ Shallue","year":"2013","unstructured":"Shallue C.J., Wanless I.M.: Permutation polynomials and orthomorphism polynomials of degree six. Finite Fields Appl. 20, 84\u201392 (2013).","journal-title":"Finite Fields Appl."},{"issue":"2","key":"1039_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10623-011-9551-8","volume":"63","author":"DH Smith","year":"2012","unstructured":"Smith D.H., Montemanni R.: A new table of permutation codes. Des. Codes Cryptogr. 63(2), 241\u2013253 (2012).","journal-title":"Des. Codes Cryptogr."},{"issue":"10","key":"1039_CR30","doi-asserted-by":"publisher","first-page":"2335","DOI":"10.1007\/s10623-019-00621-0","volume":"87","author":"R Sobhani","year":"2019","unstructured":"Sobhani R., Abdollahi A., Bagherian J., Khatami M.: A note on good permutation codes from Reed-Solomon codes. Des. Codes Cryptogr. 87(10), 2335\u20132340 (2019).","journal-title":"Des. Codes Cryptogr."},{"key":"1039_CR31","unstructured":"Vinck A.J.H.: Coded modulation for power line communication. AE Int. J. Electron. Commun. 45\u201349 (2011)."},{"issue":"3","key":"1039_CR32","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10623-016-0321-5","volume":"85","author":"X Wang","year":"2017","unstructured":"Wang X., Zhang Y., Yang Y., Ge G.: New bounds of permutation codes under hamming metric and kendall\u2019s $$\\tau $$ -metric. Des. Codes Cryptogr. 85(3), 533\u2013545 (2017).","journal-title":"Des. Codes Cryptogr."},{"key":"1039_CR33","unstructured":"Yang L., Chen K., Yuan L.: New constructions of permutation arrays. arXiv e-prints, arXiv:0801.3987v1, (2006)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01039-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01039-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01039-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T15:17:37Z","timestamp":1657293457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01039-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,20]]},"references-count":33,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["1039"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01039-x","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2022,6,20]]},"assertion":[{"value":"20 March 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 March 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 June 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}