{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:18:23Z","timestamp":1780053503353,"version":"3.54.0"},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1971,9,1]],"date-time":"1971-09-01T00:00:00Z","timestamp":52531200000},"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":15296,"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":[[1971,9]]},"DOI":"10.1016\/s0019-9958(71)90783-2","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T09:12:12Z","timestamp":1103101932000},"page":"146-158","source":"Crossref","is-referenced-by-count":7,"title":["Bounds on algebraic code capacities for noisy channels. II"],"prefix":"10.1016","volume":"19","author":[{"given":"R.","family":"Ahlswede","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Gemma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"No. 1","key":"10.1016\/S0019-9958(71)90783-2_bib1","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1214\/aoms\/1177693508","article-title":"Group codes do not achieve Shannon's channel capacity for general discrete channels","volume":"42","author":"Ahlswede","year":"1971","journal-title":"Ann. Math. Stat."},{"key":"10.1016\/S0019-9958(71)90783-2_bib2","article-title":"Bounds on algebraic code capacities for noisy channels, I","author":"Ahlswede","year":"1971","journal-title":"Information and Control"},{"key":"10.1016\/S0019-9958(71)90783-2_bib3","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF00534915","article-title":"The capacity of a channel with arbitrarily varying channel probability functions and binary output alphabet","volume":"15","author":"Ahlswede","year":"1970","journal-title":"Z. Wahrscheinlichkeitstheorie und Verw. Gebiete"},{"key":"10.1016\/S0019-9958(71)90783-2_bib4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1137\/1108003","article-title":"Asymptotic optimality of group and systematic codes for some channels","volume":"8","author":"Dobrushin","year":"1963","journal-title":"Theor. Probability Appl."},{"key":"10.1016\/S0019-9958(71)90783-2_bib5","first-page":"37","article-title":"Coding for noisy channels","author":"Elias","year":"1955","journal-title":"IRE Convention Record"},{"key":"10.1016\/S0019-9958(71)90783-2_bib6","series-title":"Coding Theorems of Information Theory","author":"Wolfowitz","year":"1964"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871907832?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995871907832?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T14:50:23Z","timestamp":1548946223000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995871907832"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1971,9]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1971,9]]}},"alternative-id":["S0019995871907832"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(71)90783-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1971,9]]}}}