{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,14]],"date-time":"2025-12-14T08:22:55Z","timestamp":1765700575883,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030688684"},{"type":"electronic","value":"9783030688691"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-68869-1_14","type":"book-chapter","created":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:24:44Z","timestamp":1613694284000},"page":"234-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2866-6766","authenticated-orcid":false,"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2795-9265","authenticated-orcid":false,"given":"Brian","family":"Malouf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0929-4386","authenticated-orcid":false,"given":"Linda","family":"Morales","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9618-1955","authenticated-orcid":false,"given":"Thomas","family":"Stanley","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7192-9891","authenticated-orcid":false,"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,17]]},"reference":[{"issue":"5","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1007\/s10623-017-0381-1","volume":"86","author":"S Bereg","year":"2017","unstructured":"Bereg, S., Levy, A., Sudborough, I.H.: Constructing permutation arrays from groups. Des. Codes Crypt. 86(5), 1095\u20131111 (2017). https:\/\/doi.org\/10.1007\/s10623-017-0381-1","journal-title":"Des. Codes Crypt."},{"key":"14_CR2","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)"},{"issue":"9","key":"14_CR3","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 Crypt. 87(9), 2105\u20132128 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00607-y","journal-title":"Des. Codes Crypt."},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s10623-019-00684-z","volume":"88","author":"S Bereg","year":"2019","unstructured":"Bereg, S., Mojica, L.G., Morales, L., Sudborough, H.: Constructing permutation arrays using partition and extension. Des. Codes Crypt. 88(2), 311\u2013339 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00684-z","journal-title":"Des. Codes Crypt."},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1007\/s10623-016-0263-y","volume":"83","author":"S Bereg","year":"2016","unstructured":"Bereg, S., Morales, L., Sudborough, I.H.: Extending permutation arrays: improving MOLS bounds. Des. Codes Crypt. 83(3), 661\u2013683 (2016). https:\/\/doi.org\/10.1007\/s10623-016-0263-y","journal-title":"Des. Codes Crypt."},{"issue":"1\u20133","key":"14_CR6","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 Crypt. 32(1\u20133), 51\u201364 (2004). https:\/\/doi.org\/10.1023\/b:desi.0000029212.52214.71","journal-title":"Des. Codes Crypt."},{"issue":"6","key":"14_CR7","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/tit.2004.828150","volume":"50","author":"C Colbourn","year":"2004","unstructured":"Colbourn, C., Kl\u00f8ve, T., Ling, A.C.: Permutation arrays for powerline communication and mutually orthogonal latin squares. IEEE Trans. Inf. Theory 50(6), 1289\u20131291 (2004). https:\/\/doi.org\/10.1109\/tit.2004.828150","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR8","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). https:\/\/doi.org\/10.1016\/j.ffa.2019.05.001","journal-title":"Finite Fields Appl."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"101662","DOI":"10.1016\/j.ffa.2020.101662","volume":"64","author":"X Fan","year":"2020","unstructured":"Fan, X.: Permutation polynomials of degree 8 over finite fields of characteristic 2. Finite Fields Their Appl. 64, 101662 (2020). https:\/\/doi.org\/10.1016\/j.ffa.2020.101662","journal-title":"Finite Fields Their Appl."},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1017\/S0004972719000674","volume":"101","author":"X Fan","year":"2020","unstructured":"Fan, X.: Permutation polynomials of degree 8 over finite fields of odd characteristic. Bull. Aust. Math. Soc. 101(1), 40\u201355 (2020). https:\/\/doi.org\/10.1017\/S0004972719000674","journal-title":"Bull. Aust. Math. Soc."},{"issue":"5","key":"14_CR11","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 three over finite fields. Des. Codes Crypt. 88(5), 867\u2013886 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00715-0","journal-title":"Des. Codes Crypt."},{"issue":"5","key":"14_CR12","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). https:\/\/doi.org\/10.1109\/tit.2013.2237945","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR13","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 - a survey of recent advances. Finite Fields Appl. 32, 82\u2013119 (2015). https:\/\/doi.org\/10.1016\/j.ffa.2014.10.001","journal-title":"Finite Fields Appl."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10623-014-9930-z","volume":"75","author":"I Janiszczak","year":"2014","unstructured":"Janiszczak, I., Lempken, W., \u00d6sterg\u00e5rd, P.R.J., Staszewski, R.: Permutation codes invariant under isometries. Des. Codes Crypt. 75(3), 497\u2013507 (2014). https:\/\/doi.org\/10.1007\/s10623-014-9930-z","journal-title":"Des. Codes Crypt."},{"issue":"9","key":"14_CR15","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. Combin. Des. 27(9), 541\u2013551 (2019). https:\/\/doi.org\/10.1002\/jcd.21661","journal-title":"J. Combin. Des."},{"key":"14_CR16","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). https:\/\/doi.org\/10.1016\/j.ffa.2010.07.001","journal-title":"Finite Fields Appl."},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1080\/00029890.1993.11990369","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). https:\/\/doi.org\/10.1080\/00029890.1993.11990369","journal-title":"Am. Math. Monthly"},{"key":"14_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781139172769","volume-title":"Introduction to Finite Fields and Their Applications","author":"R Lidl","year":"1994","unstructured":"Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1994). https:\/\/doi.org\/10.1017\/cbo9781139172769. Revised edn."},{"issue":"7","key":"14_CR19","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). https:\/\/doi.org\/10.1109\/tit.2019.2957354","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"14_CR20","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). https:\/\/doi.org\/10.1109\/mcom.2003.1193972","journal-title":"IEEE Commun. Mag."},{"key":"14_CR21","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). https:\/\/doi.org\/10.1016\/j.ffa.2012.12.003","journal-title":"Finite Fields Appl."},{"issue":"3","key":"14_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10623-016-0321-5","volume":"85","author":"X Wang","year":"2016","unstructured":"Wang, X., Zhang, Y., Yang, Y., Ge, G.: New bounds of permutation codes under Hamming metric and Kendall\u2019s $$\\tau $$-metric. Des. Codes Crypt. 85(3), 533\u2013545 (2016). https:\/\/doi.org\/10.1007\/s10623-016-0321-5","journal-title":"Des. Codes Crypt."},{"key":"14_CR23","unstructured":"Yang, L., Chen, K., Yuan, L.: New constructions of permutation arrays. arXiv e-prints (2006). https:\/\/arxiv.org\/pdf\/0801.3987.pdf"}],"container-title":["Lecture Notes in Computer Science","Arithmetic of Finite Fields"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-68869-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,19]],"date-time":"2021-02-19T00:29:15Z","timestamp":1613694555000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-68869-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030688684","9783030688691"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-68869-1_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 February 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAIFI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on the Arithmetic of Finite Fields","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rennes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waifi2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/waifi.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"22","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}