{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:22:13Z","timestamp":1740122533686,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T00:00:00Z","timestamp":1558051200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Grant No. 11431003","Grant No. 61571310"],"award-info":[{"award-number":["Grant No. 11431003","Grant No. 61571310"]}],"id":[{"id":"10.13039\/501100001809","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":[[2019,11]]},"DOI":"10.1007\/s10623-019-00641-w","type":"journal-article","created":{"date-parts":[[2019,5,17]],"date-time":"2019-05-17T15:42:42Z","timestamp":1558107762000},"page":"2625-2637","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["New theoretical bounds and constructions of permutation codes under block permutation metric"],"prefix":"10.1007","volume":"87","author":[{"given":"Zixiang","family":"Xu","sequence":"first","affiliation":[]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,17]]},"reference":[{"issue":"3","key":"641_CR1","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/0097-3165(80)90030-8","volume":"29","author":"M Ajtai","year":"1980","unstructured":"Ajtai M., Koml\u00f3s J., Szemer\u00e9di E.: A note on Ramsey numbers. J. Comb. Theory Ser. A 29(3), 354\u2013360 (1980).","journal-title":"J. Comb. Theory Ser. A"},{"key":"641_CR2","volume-title":"Random Graphs","author":"B Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s B.: Random Graphs. Academic Press, London (1985)."},{"issue":"6","key":"641_CR3","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":"641_CR4","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"},{"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, HI, USA, June 29\u2013July 4, 2014, pp. 2959\u20132963 (2014).","key":"641_CR5"},{"issue":"5","key":"641_CR6","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":"5","key":"641_CR7","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\u2013Varshamov bound for permutation codes. IEEE Trans. Inf. Theory 59(5), 3059\u20133063 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"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, China, June 14\u201319, 2015, pp. 1726\u20131730 (2015).","key":"641_CR8"},{"issue":"1","key":"641_CR9","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/TIT.1980.1056141","volume":"26","author":"RL Graham","year":"1980","unstructured":"Graham R.L., Sloane N.J.A.: Lower bounds for constant weight codes. IEEE Trans. Inf. Theory 26(1), 37\u201343 (1980).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"641_CR10","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":"8","key":"641_CR11","doi-asserted-by":"publisher","first-page":"1655","DOI":"10.1109\/TIT.2004.831751","volume":"50","author":"T Jiang","year":"2004","unstructured":"Jiang T., Vardy A.: Asymptotic improvement of the Gilbert\u2013Varshamov bound on the size of binary codes. IEEE Trans. Inf. Theory 50(8), 1655\u20131664 (2004).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"641_CR12","volume-title":"Rank Correlation Methods. A Charles Griffin Title","author":"M Kendall","year":"1990","unstructured":"Kendall M., Gibbons J.D.: Rank Correlation Methods. A Charles Griffin Title, 5th edn. Edward Arnold, London (1990).","edition":"5"},{"issue":"2","key":"641_CR13","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"},{"unstructured":"Tait M., Vardy A., Verstra\u00ebte J.: Asymptotic improvement of the Gilbert\u2013Varshamov bound on the size of permutation codes (2013). CoRR \n                    arXiv:1311.4925","key":"641_CR14"},{"issue":"1","key":"641_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/0095-8956(80)90044-1","volume":"29","author":"TW Tillson","year":"1980","unstructured":"Tillson T.W.: A Hamiltonian decomposition of $$K^{^{\\ast } }_{2m}$$, $$2m\\geqslant 8$$. J. Comb. Theory Ser. B 29(1), 68\u201374 (1980).","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"641_CR16","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."},{"unstructured":"Yang S., Schoeny C., Dolecek L.: Theoretical bounds and constructions of codes in the generalized Cayley metric. IEEE Trans. Inform. Theory (to appear). CoRR \n                    arXiv:1803.04314","key":"641_CR17"},{"issue":"1","key":"641_CR18","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1109\/TIT.2015.2502602","volume":"62","author":"Y Zhang","year":"2016","unstructured":"Zhang Y., Ge G.: Snake-in-the-box codes for rank modulation under Kendall\u2019s $$\\tau $$-metric. IEEE Trans. Inf. Theory 62(1), 151\u2013158 (2016).","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00641-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-019-00641-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-019-00641-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T23:24:54Z","timestamp":1589585094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-019-00641-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,17]]},"references-count":18,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10623-019-00641-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2019,5,17]]},"assertion":[{"value":"12 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 May 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 May 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}