{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T16:07:18Z","timestamp":1764173238120},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1959,4,1]],"date-time":"1959-04-01T00:00:00Z","timestamp":-339379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,15]],"date-time":"2014-05-15T00:00:00Z","timestamp":1400112000000},"content-version":"vor","delay-in-days":20133,"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":[[1959,4]]},"DOI":"10.1016\/s0019-9958(59)90066-x","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"25-44","source":"Crossref","is-referenced-by-count":34,"title":["On the coding theorem and its converse for finite-memory channels"],"prefix":"10.1016","volume":"2","author":[{"given":"A.","family":"Feinstein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(59)90066-X_bib1","series-title":"Foundations of Information Theory","author":"Feinstein","year":"1958"},{"key":"10.1016\/S0019-9958(59)90066-X_bib2","series-title":"Trans. First Prague Conf. on Information Theory, Statistical Decision Functions, Random Processes","article-title":"The capacity of a discrete channel","author":"Nedoma","year":"1956"},{"issue":"1","key":"10.1016\/S0019-9958(59)90066-X_bib3","first-page":"84","article-title":"On the capacity of a stationary channel with finite memory","volume":"3","author":"Tsaregradsky","year":"1958","journal-title":"Theory of Probability and its Applications"},{"key":"10.1016\/S0019-9958(59)90066-X_bib4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1215\/ijm\/1255380682","article-title":"The coding of messages subject to chance errors","volume":"1","author":"Wolfowitz","year":"1957","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0019-9958(59)90066-X_bib5","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1215\/ijm\/1255380841","article-title":"An upper bound on the rate of transmission of messages","volume":"2","author":"Wolfowitz","year":"1958","journal-title":"Illinois J. Math."},{"key":"10.1016\/S0019-9958(59)90066-X_bib6","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1215\/ijm\/1255454549","article-title":"The maximum achievable length of an error correcting code","volume":"2","author":"Wolfowitz","year":"1958","journal-title":"Illinois J. Math."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999585990066X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S001999585990066X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T18:43:47Z","timestamp":1586025827000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S001999585990066X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1959,4]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1959,4]]}},"alternative-id":["S001999585990066X"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(59)90066-x","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1959,4]]}}}