{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T20:02:58Z","timestamp":1726516978138},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1973,10,1]],"date-time":"1973-10-01T00:00:00Z","timestamp":118281600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"content-version":"vor","delay-in-days":14535,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1973,10]]},"DOI":"10.1016\/s0019-9958(73)90739-0","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"288-300","source":"Crossref","is-referenced-by-count":2,"title":["On capacity and random coding exponent of a DMC"],"prefix":"10.1016","volume":"23","author":[{"given":"M.C.","family":"Cheng","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(73)90739-0_bib1","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","article-title":"An algorithm for computing the capacity of arbitrary discrete memoryless channels","volume":"IT-18","author":"Arimoto","year":"1972","journal-title":"IEEE Trans. Information Theory"},{"year":"1965","series-title":"Information Theory","author":"Ash","key":"10.1016\/S0019-9958(73)90739-0_bib2"},{"year":"1968","series-title":"Transmission of Information","author":"Fano","key":"10.1016\/S0019-9958(73)90739-0_bib3"},{"year":"1968","series-title":"Information Theory and Reliable Communication","author":"Gallager","key":"10.1016\/S0019-9958(73)90739-0_bib4"},{"year":"1967","series-title":"Convex Polytope","author":"Gr\u00fcnbaum","key":"10.1016\/S0019-9958(73)90739-0_bib5"},{"key":"10.1016\/S0019-9958(73)90739-0_bib6","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0019-9958(67)90600-6","article-title":"On the capacity of a discrete, constant channel","volume":"11","author":"Meister","year":"1967","journal-title":"Information and Control"},{"issue":"No. 4","key":"10.1016\/S0019-9958(73)90739-0_bib7","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1143\/JPSJ.8.484","article-title":"On the capacity of a discrete channel I","volume":"8","author":"Muroga","year":"1953","journal-title":"J. Phy. Soc. Japan"},{"year":"1949","series-title":"The Mathematical Theory of Communication","author":"Shannon","key":"10.1016\/S0019-9958(73)90739-0_bib8"},{"year":"1961","series-title":"Coding Theorems of Information Theory","author":"Wolfowitz","key":"10.1016\/S0019-9958(73)90739-0_bib9"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995873907390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995873907390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:25:52Z","timestamp":1548926752000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995873907390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1973,10]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1973,10]]}},"alternative-id":["S0019995873907390"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(73)90739-0","relation":{},"ISSN":["0019-9958"],"issn-type":[{"type":"print","value":"0019-9958"}],"subject":[],"published":{"date-parts":[[1973,10]]}}}