{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T08:46:49Z","timestamp":1770972409114,"version":"3.50.1"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T00:00:00Z","timestamp":1751328000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-2313372"],"award-info":[{"award-number":["CCF-2313372"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["825876"],"award-info":[{"award-number":["825876"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,7]]},"DOI":"10.1109\/tit.2025.3566600","type":"journal-article","created":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T17:16:35Z","timestamp":1746206195000},"page":"5082-5088","source":"Crossref","is-referenced-by-count":1,"title":["Explicit Good Codes Approaching Distance 1 in Ulam Metric"],"prefix":"10.1109","volume":"71","author":[{"given":"Elazar","family":"Goldenberg","sequence":"first","affiliation":[{"name":"School of Computer Science, The Academic College of Tel Aviv-Yaffo, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mursalin","family":"Habib","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9105-364X","authenticated-orcid":false,"given":"Karthik","family":"C. S.","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rutgers University, Piscataway, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/isit57864.2024.10619215"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1965.3680"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2009.03.044"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284273"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9872-x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2043764"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOMW.2010.5700265"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046241"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90076-7"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828150"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2239700"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1515\/dma.1992.2.3.241"},{"key":"ref13","article-title":"Longest common subsequences in sets of permutations","author":"Beame","year":"2009","journal-title":"arXiv:0904.1615"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282751"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2014.140512"},{"key":"ref16","first-page":"691","article-title":"Nonexistence of perfect permutation codes in the Ulam metric","volume-title":"Proc. Int. Symp. Inf. Theory Appl. (ISITA)","author":"Kong"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s11856-023-2498-4"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4842-8_3"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1968-0228216-8"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-99-00796-X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1006\/jnth.1996.0147"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.945244"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00037-009-0281-5"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11045245\/10982108.pdf?arnumber=10982108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:21:15Z","timestamp":1750746075000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10982108\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7]]},"references-count":23,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3566600","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,7]]}}}