{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:12Z","timestamp":1770972372855,"version":"3.50.1"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T00:00:00Z","timestamp":1687392000000},"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":[[2023,9]]},"DOI":"10.1007\/s12095-023-00642-6","type":"journal-article","created":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T12:15:38Z","timestamp":1687436138000},"page":"891-903","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["New upper bounds on the size of permutation codes under Kendall $$\\tau$$-metric"],"prefix":"10.1007","volume":"15","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":[[2023,6,22]]},"reference":[{"issue":"7","key":"642_CR1","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. Inform. Theory 56(7), 3158\u20133165 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"642_CR2","doi-asserted-by":"publisher","first-page":"3241","DOI":"10.1109\/TIT.2015.2424701","volume":"61","author":"S Buzaglo","year":"2015","unstructured":"Buzaglo, S., Etzion, T.: Bounds on the size of permutation codes with the Kendall $$\\tau$$-metric. IEEE Trans. Inform. Theory 61(6), 3241\u20133250 (2015)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"642_CR3","unstructured":"The CPLEX Group, Version 12.10, (2019). http:\/\/www.ibm.com\/products\/ilog-cplex-optimization-studio"},{"key":"642_CR4","unstructured":"Dudley, U.: A Guide to Elementary Number Theory, The Dolciani Mathematical Expositions, 41. MAA Guides, 5. Mathematical Association of America, Washington, DC (2009)"},{"key":"642_CR5","doi-asserted-by":"publisher","first-page":"47","DOI":"10.2140\/pjm.1990.143.47","volume":"143","author":"PH Edelman","year":"1990","unstructured":"Edelman, P.H., White, D.: Codes transforms and the spectrum of the symmetric group. Pacific J. Math. 143, 47\u201367 (1990)","journal-title":"Pacific J. Math."},{"key":"642_CR6","unstructured":"The GAP Group, GAP-Groups, Algorithms, and Programming, version 4.11.1. (2021). http:\/\/www.gap-system.org"},{"key":"642_CR7","doi-asserted-by":"crossref","unstructured":"G\u00f6lo\u01e7lu, F., Lember, J., Riet, A.E., Skachek, V.: New bounds for permutation codes in Ulam metric, in Proc. IEEE Int. Symp. Inf. Theory (ISIT), pp. 1726-1730 (2015)","DOI":"10.1109\/ISIT.2015.7282751"},{"key":"642_CR8","unstructured":"James, G., Kerber, A.: The representation theory of the symmetric group, Encyclopedia of Mathematics and its Applications, 16, Addison-Wesley Publishing Co., Reading, Mass. (1981)"},{"key":"642_CR9","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1109\/TIT.2010.2043764","volume":"56","author":"A Jiang","year":"2010","unstructured":"Jiang, A., Mateescu, R., Schwartz, M., Bruck, J.: Correcting charge-constrained errors in the rank-modulation scheme. IEEE Trans. Inform. Theory 56, 2112\u20132120 (2010)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"642_CR10","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. Eur. J. Combinat. 20, 101\u2013114 (1999)","journal-title":"Eur. J. Combinat."},{"key":"642_CR11","first-page":"1912","volume":"10","author":"S Vijayakumaran","year":"2016","unstructured":"Vijayakumaran, S.: Largest permutation codes with the Kendall $$\\tau$$-metric in $$S_5$$ and $$S_6$$, IEEE Comm. Letters, No. 10, 1912\u20131915 (2016)","journal-title":"Letters, No."},{"issue":"3","key":"642_CR12","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."},{"issue":"11","key":"642_CR13","doi-asserted-by":"publisher","first-page":"2511","DOI":"10.1007\/s10623-021-00934-z","volume":"89","author":"X Wang","year":"2021","unstructured":"Wang, X., Wang, Y., Yin, W., Fu, F.-W.: Nonexistence of perfect permutation codes under the Kendall $$\\tau$$-metric. Des. Codes Cryptogr. 89(11), 2511\u20132531 (2021)","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-023-00642-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-023-00642-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-023-00642-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,12]],"date-time":"2023-09-12T07:11:45Z","timestamp":1694502705000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-023-00642-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,22]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2023,9]]}},"alternative-id":["642"],"URL":"https:\/\/doi.org\/10.1007\/s12095-023-00642-6","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,22]]},"assertion":[{"value":"12 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable. The current manuscript does not report on or involve the use of any animal or human data or tissue.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval and Consent to participate"}},{"value":"The authors declare that they have no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable. The current manuscript does not contain data from any individual person.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}]}}