{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:31:17Z","timestamp":1780705877260,"version":"3.54.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T00:00:00Z","timestamp":1483056000000},"content-version":"unspecified","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 Nos. 11431003 and 61571310"],"award-info":[{"award-number":["Grant Nos. 11431003 and 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":[[2017,12]]},"DOI":"10.1007\/s10623-016-0321-5","type":"journal-article","created":{"date-parts":[[2016,12,30]],"date-time":"2016-12-30T06:14:00Z","timestamp":1483078440000},"page":"533-545","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["New bounds of permutation codes under Hamming metric and Kendall\u2019s \n                $$\\tau $$\n                \n                    \n                                    \n                        \u03c4\n                    \n                \n            -metric"],"prefix":"10.1007","volume":"85","author":[{"given":"Xin","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiwei","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiting","family":"Yang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gennian","family":"Ge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,12,30]]},"reference":[{"issue":"7","key":"321_CR1","doi-asserted-by":"crossref","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(7), 3158\u20133165 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"321_CR2","doi-asserted-by":"crossref","unstructured":"Bose R.C., Chowla S.: Theorems in the additive theory of numbers. Comment. Math. Helv. 37, 141\u2013147 (1962\/1963).","DOI":"10.1007\/BF02566968"},{"issue":"6","key":"321_CR3","doi-asserted-by":"crossref","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 \n                        $$\\tau $$\n                        \n                            \n                                            \n                                \u03c4\n                            \n                        \n                    -metric. IEEE Trans. Inf. Theory 61(6), 3241\u20133250 (2015).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"321_CR4","volume-title":"M\u00e9moire sur les nombres premiers","author":"PL \u010ceby\u0161ev","year":"1850","unstructured":"\u010ceby\u0161ev P.L.: M\u00e9moire sur les nombres premiers. Acad\u00e9mie Imp\u00e9riale des Sciences, Saint Petersburg (1850)."},{"issue":"1\u20133","key":"321_CR5","doi-asserted-by":"crossref","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(1\u20133), 51\u201364 (2004).","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"321_CR6","doi-asserted-by":"crossref","first-page":"1289","DOI":"10.1109\/TIT.2004.828150","volume":"50","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn C.J., Kl\u00f8ve T., Ling A.C.H.: 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"},{"key":"321_CR7","first-page":"5","volume":"145","author":"DR Torre de\u00a0la","year":"2000","unstructured":"de\u00a0la Torre D.R., Colbourn C.J., Ling A.C.H.: An application of permutation arrays to block ciphers. Congr. Numer. 145, 5\u20137 (2000).","journal-title":"Congr. Numer."},{"key":"321_CR8","volume-title":"The Independent Set Algorithm","author":"A Dharwadker","year":"2006","unstructured":"Dharwadker A.: The Independent Set Algorithm. Yoda, New Delhi (2006)."},{"issue":"5","key":"321_CR9","doi-asserted-by":"crossref","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"},{"key":"321_CR10","doi-asserted-by":"crossref","unstructured":"Ferreira H.C., Vinck A.J.H.: Interference cancellation with permutation trellis codes. In: 2000 VTC- Fall VTS 52nd Vehicular Technology Conference, vol. 5, pp. 2401\u20132407 (2000).","DOI":"10.1109\/VETECF.2000.883295"},{"issue":"3","key":"321_CR11","doi-asserted-by":"crossref","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":"321_CR12","doi-asserted-by":"crossref","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).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"321_CR13","volume-title":"Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207","author":"C Godsil","year":"2001","unstructured":"Godsil C., Royle G.: Algebraic Graph Theory. Graduate Texts in Mathematics, vol. 207. Springer, New York (2001)."},{"issue":"6","key":"321_CR14","doi-asserted-by":"crossref","first-page":"2659","DOI":"10.1109\/TIT.2009.2018336","volume":"55","author":"A Jiang","year":"2009","unstructured":"Jiang A., Mateescu R., Schwartz M., Bruck J.: Rank modulation for flash memories. IEEE Trans. Inf. Theory 55(6), 2659\u20132673 (2009).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"5","key":"321_CR15","doi-asserted-by":"crossref","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(5), 2112\u20132120 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"6","key":"321_CR16","doi-asserted-by":"crossref","first-page":"2611","DOI":"10.1109\/TIT.2010.2046212","volume":"56","author":"T Kl\u00f8ve","year":"2010","unstructured":"Kl\u00f8ve T., Lin T.-T., Tsai S.-C., Tzeng W.-G.: Permutation arrays under the Chebyshev distance. IEEE Trans. Inf. Theory 56(6), 2611\u20132617 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"321_CR17","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1109\/TIT.2012.2221121","volume":"59","author":"A Mazumdar","year":"2013","unstructured":"Mazumdar A., Barg A., Z\u00e9mor G.: Constructions of rank modulation codes. IEEE Trans. Inf. Theory 59(2), 1018\u20131029 (2013).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"321_CR18","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/MCOM.2003.1193972","volume":"41","author":"N Pavlidou","year":"2003","unstructured":"Pavlidou N., Vinck A.J.H., Yazdani J., Honary B.: Power line communications: state of the art and future trends. IEEE Commun. Mag. 41(4), 34\u201340 (2003).","journal-title":"IEEE Commun. Mag."},{"key":"321_CR19","unstructured":"Tait M., Vardy A., Verstraete J.: Asymptotic improvement of the Gilbert-Varshamov bound on the size of permutation codes. arXiv preprint \n                        arXiv:1311.4925\n                        \n                     (2013)."},{"issue":"6","key":"321_CR20","doi-asserted-by":"crossref","first-page":"2551","DOI":"10.1109\/TIT.2010.2046241","volume":"56","author":"I Tamo","year":"2010","unstructured":"Tamo I., Schwartz M.: Correcting limited-magnitude errors in the rank-modulation scheme. IEEE Trans. Inf. Theory 56(6), 2551\u20132560 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"321_CR21","first-page":"45","volume":"54","author":"AJH Vinck","year":"2011","unstructured":"Vinck A.J.H.: Coded modulation for power line communications. AE Int. J. Electron. Commun. 54, 45\u201349 (2011).","journal-title":"AE Int. J. Electron. Commun."},{"key":"321_CR22","unstructured":"Wang X., Zhang Y., Yang Y., Ge G.: New bounds of permutation codes under hamming metric and kendall\u2019s \n                        $$\\tau $$\n                        \n                            \n                                            \n                                \u03c4\n                            \n                        \n                    -metric. arXiv preprint \n                        arXiv:1611.07188\n                        \n                     (2016)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0321-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0321-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0321-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,9,11]],"date-time":"2017-09-11T17:17:46Z","timestamp":1505150266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0321-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,30]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["321"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0321-5","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,30]]}}}