{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T22:18:22Z","timestamp":1767046702151,"version":"3.37.3"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T00:00:00Z","timestamp":1701820800000},"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":[[2024,4]]},"DOI":"10.1007\/s10623-023-01326-1","type":"journal-article","created":{"date-parts":[[2023,12,6]],"date-time":"2023-12-06T16:02:01Z","timestamp":1701878521000},"page":"1023-1039","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Improved bounds for permutation arrays under Chebyshev distance"],"prefix":"10.1007","volume":"92","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2866-6766","authenticated-orcid":false,"given":"Sergey","family":"Bereg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammadreza","family":"Haghpanah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian","family":"Malouf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. Hal","family":"Sudborough","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,6]]},"reference":[{"key":"1326_CR1","unstructured":"Bereg S., Bumpass W., Haghpanah M., Malouf B., Sudborough I.H.: Bounds for permutation arrays under Kendall tau metric. arXiv:2301.11423 (2023)"},{"key":"1326_CR2","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). https:\/\/doi.org\/10.1007\/s10623-017-0381-1.","journal-title":"Des. Codes Cryptogr."},{"key":"1326_CR3","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":"1326_CR4","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, 3241\u20133250 (2015).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1326_CR5","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":"1326_CR6","first-page":"173","volume":"23","author":"MM Deza","year":"1998","unstructured":"Deza M.M., Huang T.: Metrics on permutations, a survey. J. Comb. Inf. Syst. Sci. 23, 173\u2013185 (1998).","journal-title":"J. Comb. Inf. Syst. Sci."},{"key":"1326_CR7","unstructured":"Hagberg A.A., Schult D.A., Swart P.J.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the 7th Python in Science Conference SciPy2008, pp.\u00a011\u201315 (2008)."},{"key":"1326_CR8","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. Inform. Theory 56, 2112\u20132120 (2010).","journal-title":"IEEE Trans. Inform. Theory"},{"key":"1326_CR9","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10623-010-9454-0","volume":"59","author":"T Kl\u00f8ve","year":"2011","unstructured":"Kl\u00f8ve T.: Lower bounds on the size of spheres of permutations under the Chebyshev distance. Des. Codes Cryptogr. 59, 183\u2013191 (2011).","journal-title":"Des. Codes Cryptogr."},{"key":"1326_CR10","doi-asserted-by":"publisher","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, 2611\u20132617 (2010).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1326_CR11","doi-asserted-by":"crossref","unstructured":"Rossi R.A., Gleich D.F., Gebremedhin A.H., Patwary M.M.: A fast parallel maximum clique algorithm for large sparse graphs and temporal strong components. arXiv:1302.6256 (2013)","DOI":"10.1145\/2567948.2577283"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01326-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-023-01326-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-023-01326-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T18:08:22Z","timestamp":1713290902000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-023-01326-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,6]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["1326"],"URL":"https:\/\/doi.org\/10.1007\/s10623-023-01326-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2023,12,6]]},"assertion":[{"value":"27 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 October 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2023","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}