{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T04:54:23Z","timestamp":1725425663519},"reference-count":5,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/isit.2004.1365131","type":"proceedings-article","created":{"date-parts":[[2004,12,23]],"date-time":"2004-12-23T04:34:17Z","timestamp":1103776457000},"page":"94-94","source":"Crossref","is-referenced-by-count":7,"title":["Bounds on the expected cost of one-to-one codes"],"prefix":"10.1109","author":[{"given":"S.A.","family":"Savari","sequence":"first","affiliation":[]},{"given":"A.","family":"Naheta","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(62)90183-3"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90365-8"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055891"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.272477"},{"article-title":"The Mathematical Theory of Communication","year":"1949","author":"shannon","key":"ref1"}],"event":{"name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","location":"Chicago, Illinois, USA"},"container-title":["International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/9423\/29909\/01365131.pdf?arnumber=1365131","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T23:47:05Z","timestamp":1489448825000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1365131\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":5,"URL":"https:\/\/doi.org\/10.1109\/isit.2004.1365131","relation":{},"subject":[]}}