{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:24:57Z","timestamp":1758273897577,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T00:00:00Z","timestamp":1677801600000},"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":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2023,6]]},"DOI":"10.1007\/s10623-023-01197-6","type":"journal-article","created":{"date-parts":[[2023,3,3]],"date-time":"2023-03-03T12:02:37Z","timestamp":1677844957000},"page":"2255-2271","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A new metric on symmetric groups and applications to block permutation codes"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5393-514X","authenticated-orcid":false,"given":"Zihan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,3,3]]},"reference":[{"issue":"6","key":"1197_CR1","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. Inf. Theory 61(6), 3241\u20133250 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"1197_CR2","doi-asserted-by":"publisher","first-page":"3113","DOI":"10.1109\/TIT.2016.2543739","volume":"62","author":"S Buzaglo","year":"2016","unstructured":"Buzaglo S., Yaakobi E., Etzion T., Bruck J.: Systematic error-correcting codes for permutations and multi-permutations. IEEE Trans. Inf. Theory 62(6), 3113\u20133124 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1197_CR3","doi-asserted-by":"crossref","unstructured":"Chee, Y.M., Van Khu, V.: Breakpoint analysis and permutation codes in generalized Kendall tau and Cayley metrics. In: 2014 IEEE International Symposium on Information Theory, Honolulu, June 29\u2013July 4, 2014, pp. 2959\u20132963 (2014)","DOI":"10.1109\/ISIT.2014.6875376"},{"issue":"1","key":"1197_CR4","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., Dukes P.: Constructions for permutation codes in powerline communications. Des. Codes Cryptogr. 32(1), 51\u201364 (2004).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"1197_CR5","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"C Colbourn","year":"2004","unstructured":"Colbourn C., Klove T., Ling A.: 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"},{"issue":"2","key":"1197_CR6","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. Stat. Plan. Inference 2(2), 197\u2013209 (1978).","journal-title":"J. Stat. Plan. Inference"},{"issue":"4","key":"1197_CR7","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1109\/18.992812","volume":"48","author":"C Ding","year":"2002","unstructured":"Ding C., Fu F., Klove T., Wei V.: Constructions of permutation arrays. IEEE Trans. Inf. Theory 48(4), 977\u2013980 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"1197_CR8","doi-asserted-by":"publisher","first-page":"3003","DOI":"10.1109\/TIT.2013.2239700","volume":"59","author":"F Farnoud","year":"2013","unstructured":"Farnoud F., Skachek V., Milenkovic O.: Error-correction in flash memories via codes in the Ulam metric. IEEE Trans. Inf. Theory 59(5), 3003\u20133020 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1197_CR9","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. Comb. Theory Ser. A 22(3), 352\u2013360 (1977).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"5","key":"1197_CR10","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1109\/TIT.2004.826659","volume":"50","author":"F Fu","year":"2004","unstructured":"Fu F., Klove T.: Two constructions of permutation arrays. IEEE Trans. Inf. Theory 50(5), 881\u2013883 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1197_CR11","doi-asserted-by":"crossref","unstructured":"G\u00f6loglu, F., Lember, J., Riet, A., Skachek, V.: New bounds for permutation codes in Ulam metric. In: IEEE International Symposium on Information Theory, ISIT 2015, Hong Kong, June 14\u201319, 2015, pp. 1726\u20131730 (2015)","DOI":"10.1109\/ISIT.2015.7282751"},{"issue":"5","key":"1197_CR12","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1109\/JSAC.2014.140512","volume":"32","author":"FF Hassanzadeh","year":"2014","unstructured":"Hassanzadeh F.F., Milenkovic O.: Multipermutation codes in the Ulam metric for nonvolatile memories. IEEE J. Sel. Areas Commun. 32(5), 919\u2013932 (2014).","journal-title":"IEEE J. Sel. Areas Commun."},{"issue":"1","key":"1197_CR13","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/TIT.2015.2500561","volume":"62","author":"L Jin","year":"2016","unstructured":"Jin L.: A construction of permutation codes from rational function fields and improvement to the Gilbert\u2013Varshamov bound. IEEE Trans. Inf. Theory 62(1), 159\u2013162 (2016).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1197_CR14","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1006\/jcta.2002.3279","volume":"99","author":"A Myers","year":"2002","unstructured":"Myers A.: Counting permutations by their rigid patterns. J. Comb. Theory Ser. A 99(2), 345\u2013357 (2002).","journal-title":"J. Comb. Theory Ser. A"},{"key":"1197_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107325951","volume-title":"Rational Points on Curves Over Finite Fields, LMS 285","author":"H Niederreiter","year":"2001","unstructured":"Niederreiter H., Xing C.: Rational Points on Curves Over Finite Fields, LMS 285. Cambridge University Press, Cambridge (2001)."},{"issue":"2","key":"1197_CR16","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."},{"key":"1197_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76878-4","volume-title":"Algebraic Function Fields and Codes. GTM 254","author":"H Stichtenoth","year":"2009","unstructured":"Stichtenoth H.: Algebraic Function Fields and Codes. GTM 254. Springer, New York (2009)."},{"key":"1197_CR18","unstructured":"Tait, M., Vardy, A., Verstra\u00ebte, J.: Asymptotic improvement of the Gilbert\u2013Varshamov bound on the size of permutation codes. CoRR. http:\/\/arxiv.org\/abs\/1311.4925 (2013)"},{"issue":"11","key":"1197_CR19","doi-asserted-by":"publisher","first-page":"2995","DOI":"10.1109\/TIT.2002.804110","volume":"48","author":"C Xing","year":"2002","unstructured":"Xing C.: Constructions of codes from residue rings of polynomials. IEEE Trans. Inf. Theory 48(11), 2995\u20132997 (2002).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"3","key":"1197_CR20","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TIT.2004.824922","volume":"50","author":"C Xing","year":"2004","unstructured":"Xing C.: Linear codes from narrow ray class groups of algebraic curves. IEEE Trans. Inf. Theory 50(3), 541\u2013543 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1197_CR21","doi-asserted-by":"publisher","first-page":"2625","DOI":"10.1007\/s10623-019-00641-w","volume":"87","author":"Z Xu","year":"2019","unstructured":"Xu Z., Zhang Y., Ge G.: New theoretical bounds and constructions of permutation codes under block permutation metric. Des. Codes Cryptogr. 87(11), 2625\u20132637 (2019).","journal-title":"Des. Codes Cryptogr."},{"issue":"8","key":"1197_CR22","doi-asserted-by":"publisher","first-page":"4746","DOI":"10.1109\/TIT.2019.2899868","volume":"65","author":"S Yang","year":"2019","unstructured":"Yang S., Schoeny C., Dolecek L.: Theoretical bounds and constructions of codes in the generalized Cayley metric. IEEE Trans. Inf. Theory 65(8), 4746\u20134763 (2019).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01197-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01197-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01197-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T16:13:02Z","timestamp":1685031182000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01197-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,3]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,6]]}},"alternative-id":["1197"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01197-6","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,3,3]]},"assertion":[{"value":"22 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 August 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 March 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}