{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:14:56Z","timestamp":1757618096975,"version":"3.44.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T00:00:00Z","timestamp":1748044800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1007\/s12095-025-00809-3","type":"journal-article","created":{"date-parts":[[2025,5,24]],"date-time":"2025-05-24T03:59:18Z","timestamp":1748059158000},"page":"1075-1091","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper bounds on the size of permutation codes with a Hamming distance of five"],"prefix":"10.1007","volume":"17","author":[{"given":"Alireza","family":"Abdollahi","sequence":"first","affiliation":[]},{"given":"Javad","family":"Bagherian","sequence":"additional","affiliation":[]},{"given":"Fatemeh","family":"Jafari","sequence":"additional","affiliation":[]},{"given":"Maryam","family":"Khatami","sequence":"additional","affiliation":[]},{"given":"Farzad","family":"Parvaresh","sequence":"additional","affiliation":[]},{"given":"Reza","family":"Sobhani","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,24]]},"reference":[{"key":"809_CR1","unstructured":"Abdollahi, A.: (https:\/\/mathoverflow.net\/users\/19075\/alireza-abdollahi). Possible prime divisors of $$n^2-n+2$$ which are greater than $$n$$, URL (version: 2025-01-22): https:\/\/mathoverflow.net\/q\/486408"},{"key":"809_CR2","doi-asserted-by":"publisher","first-page":"891","DOI":"10.1007\/s12095-023-00642-6","volume":"15","author":"A Abdollahi","year":"2023","unstructured":"Abdollahi, A., Bagherian, J., Jafari, F., Khatami, M., Parvaresh, F., Sobhani, R.: New upper bounds on the size of permutation codes under Kendall $$\\tau $$-metric. Cryptogr. Commun. 15, 891\u2013903 (2023)","journal-title":"Cryptogr. Commun."},{"key":"809_CR3","doi-asserted-by":"publisher","first-page":"3158","DOI":"10.1109\/TIT.2010.2048455","volume":"56","author":"A Barg","year":"2010","unstructured":"Barg, A., Mazumdar, A.: Codes in permutations and error correction for rank modulation. IEEE Trans. Inf. Theory 56, 3158\u20133165 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR4","doi-asserted-by":"publisher","first-page":"3719","DOI":"10.1109\/TIT.2022.3152392","volume":"68","author":"N Beeri","year":"2022","unstructured":"Beeri, N., Schwartz, M.: Improved rank-modulation codes for DNA storage with shotgun sequencing. IEEE Trans. Inform. Theory 68, 3719\u20133730 (2022)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"7","key":"809_CR5","doi-asserted-by":"publisher","first-page":"1659","DOI":"10.1007\/s10623-022-01039-x","volume":"90","author":"S Bereg","year":"2022","unstructured":"Bereg, S., Malouf, B., Morales, L., Stanley, T., Sudborough, I.H.: Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. 90(7), 1659\u20131677 (2022)","journal-title":"Des. Codes Cryptogr."},{"key":"809_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, 661\u2013683 (2017)","journal-title":"Des. Codes Cryptogr."},{"key":"809_CR7","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, 1095\u20131111 (2018)","journal-title":"Des. Codes Cryptogr."},{"key":"809_CR8","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."},{"key":"809_CR9","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, 311\u2013339 (2020)","journal-title":"Des. Codes Cryptogr."},{"key":"809_CR10","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1109\/TIT.1974.1055142","volume":"20","author":"IF Blake","year":"1974","unstructured":"Blake, I.F.: permutation codes for discrete channels. IEEE Trans. Inform. Theory 20, 138\u2013140 (1974)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"809_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0019-9958(79)90076-7","volume":"43","author":"IF Blake","year":"1979","unstructured":"Blake, I.F., Cohen, G., Deza, M.: Coding with permutations. Inf. Control 43, 1\u201319 (1979)","journal-title":"Inf. Control"},{"key":"809_CR12","doi-asserted-by":"publisher","first-page":"R135","DOI":"10.37236\/407","volume":"17","author":"M Bogaerts","year":"2010","unstructured":"Bogaerts, M.: New upper bounds for the size of permutation codes via linear programming. Electr. J. Comb. 17, R135 (2010)","journal-title":"Electr. J. Comb."},{"key":"809_CR13","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, 51\u201364 (2004)","journal-title":"Des. Codes Cryptogr."},{"key":"809_CR14","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn, C.J., Klove, T., Ling, A.C.H.: Permutation arrays for powerline communication and mutually orthogonal Latin squares. IEEE Trans. Inform. Theory 50, 1289\u20131291 (2004)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"809_CR15","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. Congr. Numer. 145, 5\u20138 (2000)","journal-title":"Congr. Numer."},{"key":"809_CR16","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0378-3758(78)90008-3","volume":"2","author":"M Deza","year":"1978","unstructured":"Deza, M., Vanstone, S.A.: Bounds for permutation arrays. J. Statist. Plann. Inference 2, 197\u2013209 (1978)","journal-title":"J. Statist. Plann. Inference"},{"key":"809_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/BF00535487","volume":"57","author":"P Diaconis","year":"1981","unstructured":"Diaconis, P., Shahshahani, M.: Generating a random permutation with random transpositions. Z. Wahrscheinlichkeitstheorie verw Gebiete 57, 159\u2013179 (1981)","journal-title":"Z. Wahrscheinlichkeitstheorie verw Gebiete"},{"key":"809_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s10801-009-0191-2","volume":"31","author":"P Dukes","year":"2010","unstructured":"Dukes, P., Sawchuck, N.: Bounds on permutation codes of distance four. J. Algebr. Comb. 31, 143\u2013158 (2010)","journal-title":"J. Algebr. Comb."},{"key":"809_CR19","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0097-3165(77)90009-7","volume":"22","author":"P Frankl","year":"1977","unstructured":"Frankl, P., Deza, M.: On the maximum number of permutations with given maximal or minimal distance. J. Combin. Theory Series A 22, 352\u2013360 (1977)","journal-title":"J. Combin. Theory Series A"},{"key":"809_CR20","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. Inform. Theory 59, 3059\u20133063 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"809_CR21","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511840371","volume-title":"Matrix analysis","author":"RA Horn","year":"1991","unstructured":"Horn, R.A., Johnson, C.R.: Matrix analysis. Cambridge Univ. Press, Cambridge (1991)"},{"key":"809_CR22","unstructured":"James, G., Kerber, A.: The representation theory of the symmetric group. Encyclopedia Math. Appl., 16, Addison-Wesley Publishing Co., Reading, Mass. (1981)"},{"key":"809_CR23","unstructured":"Jiang, A., Schwartz, M., Bruck, J.: Error-correcting codes for rank modulation. Proc. IEEE Int. Symp. Inf. Theory, 6-11 (2008)"},{"key":"809_CR24","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1109\/TIT.2010.2043764","volume":"56","author":"A Jiang","year":"2010","unstructured":"Jiang, A., Schwartz, M., Bruck, J.: Correcting charge-constrained errors in the rank modulation scheme. IEEE Trans. Inf. Theory 56, 2112\u20132120 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"809_CR25","unstructured":"Montemanni, R., Barta, J., Smith, D.H.: Permutation codes: a branch and bound approach. In: Proceedings of the International Conference on Informatics and Advanced Computing 1-3 (2014)"},{"issue":"7","key":"809_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"},{"key":"809_CR27","doi-asserted-by":"publisher","unstructured":"Parvaresh, F., Sobhani, R., Abdollahi, A., Bagherian, J., Jafari, F., Khatami, M.: Improved bounds on the size of permutation codes under Kendall $$\\tau $$-metric. IEEE Trans. Inf. Theory (2025). https:\/\/ieeexplore.ieee.org\/abstract\/document\/10965831https:\/\/doi.org\/10.1109\/TIT.2025.3561119","DOI":"10.1109\/TIT.2025.3561119"},{"key":"809_CR28","unstructured":"qwenty (https:\/\/math.stackexchange.com\/users\/202599\/qwenty), Infiniteness of the set of primes such $$f$$ have root mode $$ p$$, URL (version: 2024-03-28): https:\/\/math.stackexchange.com\/q\/1250302"},{"key":"809_CR29","doi-asserted-by":"publisher","first-page":"175","DOI":"10.2140\/pjm.1966.18.175","volume":"18","author":"O Rothaus","year":"1966","unstructured":"Rothaus, O., Thompson, J.: A combinatorial problem in the symmetric group. Pacific J. Math. 18, 175\u2013178 (1966)","journal-title":"Pacific J. Math."},{"key":"809_CR30","unstructured":"Schrijver, A.: Theory of linear and integer programming. John Wiley and Sons, (1998)"},{"key":"809_CR31","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, 241\u2013253 (2012)","journal-title":"Des. Codes Cryptogr."},{"issue":"1","key":"809_CR32","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1006\/eujc.1998.0272","volume":"20","author":"H Tarnanen","year":"1999","unstructured":"Tarnanen, H.: Upper bounds on permutation codes via linear programming. European J. Combin. 20(1), 101\u2013114 (1999)","journal-title":"European J. Combin."},{"issue":"1","key":"809_CR33","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0024-3795(75)90112-3","volume":"11","author":"JM Varah","year":"1975","unstructured":"Varah, J.M.: A lower bound for the smallest singular value of a matrix. Linear Algebra Appl. 11(1), 3\u20135 (1975)","journal-title":"Linear Algebra Appl."},{"key":"809_CR34","unstructured":"Vinck, A.J.H.: Coded modulation for power line communications. In: AE Int. J. Electron. and Commun, 45-49 (2011)"},{"issue":"6","key":"809_CR35","doi-asserted-by":"publisher","first-page":"1440","DOI":"10.3934\/amc.2021058","volume":"17","author":"X Wang","year":"2021","unstructured":"Wang, X., Yin, W.: New non-existence results on perfect permutation codes under the Hamming metric. Adv. Math. Commun. 17(6), 1440\u20131452 (2021)","journal-title":"Adv. Math. Commun."},{"key":"809_CR36","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.W., Yang, Y.T., Ge, G.N.: New bounds of permutation codes under Hamming metric and Kendall\u2019s $$\\tau $$-metric. Des. Codes Cryptogr. 85, 533\u2013545 (2017)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00809-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-025-00809-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-025-00809-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T15:20:26Z","timestamp":1757172026000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-025-00809-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,24]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2025,7]]}},"alternative-id":["809"],"URL":"https:\/\/doi.org\/10.1007\/s12095-025-00809-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2025,5,24]]},"assertion":[{"value":"19 June 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}]}}