{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:16:28Z","timestamp":1761718588146,"version":"3.37.3"},"reference-count":49,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2017,10,1]],"date-time":"2017-10-01T00:00:00Z","timestamp":1506816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","award":["130\/14"],"award-info":[{"award-number":["130\/14"]}],"id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/tit.2017.2697423","type":"journal-article","created":{"date-parts":[[2017,4,24]],"date-time":"2017-04-24T18:11:13Z","timestamp":1493057473000},"page":"6227-6239","source":"Crossref","is-referenced-by-count":12,"title":["Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric"],"prefix":"10.1109","volume":"63","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1449-0026","authenticated-orcid":false,"given":"Moshe","family":"Schwartz","sequence":"first","affiliation":[]},{"given":"Pascal O.","family":"Vontobel","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2069253"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282752"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1978","author":"macwilliams","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070007"},{"key":"ref31","first-page":"273","article-title":"Permutations with strongly restricted displacements","author":"lehmer","year":"1970","journal-title":"Combinatorial Theory and its Applications II"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046212"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2011.02.008"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2008.10.029"},{"key":"ref35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/1161","article-title":"A survey on packing and covering problems in the Hamming permutation space","volume":"13","author":"quistorff","year":"2006","journal-title":"Electron J Combinat"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2221121"},{"key":"ref28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.37236\/193","article-title":"Generating functions for the number of permutations with limited displacement","volume":"16","author":"kl\u00f8ve","year":"2009","journal-title":"Electron J Combinat"},{"article-title":"Spheres of permutations under the infinity norm&#x2014;Permutations with limited displacement","year":"2008","author":"kl\u00f8ve","key":"ref27"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-010-9454-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2048455"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2008.12.027"},{"key":"ref20","article-title":"Concrete mathematics","author":"graham","year":"1994","journal-title":"Foundation of Computer Science"},{"journal-title":"Unleashing the power of Schrijver&#x2019;s permanental inequality with the help of the Bethe approximation","year":"2011","author":"gurvits","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0255-y"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2018336"},{"journal-title":"Approximating the Permanent with Belief Propagation","year":"2009","author":"huang","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-006-0017-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043764"},{"journal-title":"Covering Codes","year":"1997","author":"cohen","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2016-7"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177703591"},{"key":"ref12","first-page":"173","article-title":"Metrics on permutations, a survey","volume":"23","author":"deza","year":"1998","journal-title":"J Combinat Inf Syst Sci"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(78)90008-3"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0097-3165(77)90009-7","article-title":"On the maximum number of permutations with given maximal or minimal distance","volume":"22","author":"deza","year":"1977","journal-title":"J Combinat Theory A"},{"key":"ref15","first-page":"65","article-title":"Proof of the van der Waerden conjecture for permanents (in Russian)","volume":"22","author":"egorychev","year":"1981","journal-title":"Sibirsk Mat Zh"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BF01163285"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2504521"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2239700"},{"key":"ref19","first-page":"1726","article-title":"New bounds for permutation codes in Ulam metric","author":"g\u00f6lo?lu","year":"2015","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055142"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875261"},{"key":"ref5","first-page":"2391","article-title":"Perfect permutation codes with the Kendall&#x2019;s $\\tau$ -metric","author":"buzaglo","year":"2014","journal-title":"Proc IEEE Int Symp Inf Theory"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2004.08.024"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2009.03.044"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2365499"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054291"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2485270"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ITA.2014.6804280"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541815"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2196755"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046241"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2227109"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204035"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8036324\/07908949.pdf?arnumber=7908949","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T03:00:04Z","timestamp":1633921204000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7908949\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":49,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2697423","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2017,10]]}}}