{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T07:50:10Z","timestamp":1761292210033},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,5,1]],"date-time":"1990-05-01T00:00:00Z","timestamp":641520000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8478,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1990,5]]},"DOI":"10.1016\/0890-5401(90)90022-a","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T15:34:26Z","timestamp":1103211266000},"page":"1-13","source":"Crossref","is-referenced-by-count":9,"title":["On numerical methods of calculating the capacity of continuous-input discrete-output memoryless channels"],"prefix":"10.1016","volume":"86","author":[{"given":"Chain-I","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon C.","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee D.","family":"Davisson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/0890-5401(90)90022-A_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. Inform. Theory"},{"issue":"No. 4","key":"10.1016\/0890-5401(90)90022-A_BIB2","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1109\/TIT.1972.1054855","article-title":"Computation of channel capacity and rate-distortion function","volume":"IT-18","author":"Blahut","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90022-A_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/18.50379","article-title":"Two iterative algorithms for finding minimax solutions","author":"Chang","year":"1990","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 5","key":"10.1016\/0890-5401(90)90022-A_BIB4","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/18.21223","article-title":"On calculating the capacity of an infinite-input finite (infinite)-output channel","volume":"IT-34","author":"Chang","year":"1988","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90022-A_BIB5","series-title":"Proceedings, 1988 Conference on Information Science and Systems","first-page":"365","article-title":"A simple method of calculating channel capacity and finding minimax codes for source matching problems","author":"Chang","year":"1988"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90022-A_BIB6","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1109\/TIT.1980.1056167","article-title":"A source matching approach to finding minimax codes","volume":"IT-26","author":"Davisson","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"No. 3","key":"10.1016\/0890-5401(90)90022-A_BIB7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1109\/TIT.1981.1056355","article-title":"Efficient universal noiseless source codes","volume":"IT-27","author":"Davisson","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90022-A_BIB8","article-title":"A Numerical Study of Computation of the Capacity of Continuous-input Discrete-Output Memoryless Channels","author":"Fan","year":"1989"},{"issue":"No. 2","key":"10.1016\/0890-5401(90)90022-A_BIB9","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TIT.1980.1056165","article-title":"Optimal encoding of discrete-time continuous-amplitude memoryless sources with finite output alphabets","volume":"IT-26","author":"Finamore","year":"1980","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0890-5401(90)90022-A_BIB10","author":"Gallager","year":"1968"},{"key":"10.1016\/0890-5401(90)90022-A_BIB11","doi-asserted-by":"crossref","first-page":"1643","DOI":"10.1214\/aoms\/1177699153","article-title":"Minimax solution of statistical decision problems by iteration","volume":"37","author":"Nelson","year":"1966","journal-title":"Ann. Math. Statist."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090022A?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019090022A?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T20:25:59Z","timestamp":1548879959000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019090022A"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,5]]}},"alternative-id":["089054019090022A"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(90)90022-a","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1990,5]]}}}