{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:24Z","timestamp":1772893044777,"version":"3.50.1"},"reference-count":14,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[1982,7]]},"DOI":"10.1109\/tit.1982.1056525","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"593-599","source":"Crossref","is-referenced-by-count":47,"title":["Algebraic constructions of Shannon codes for regular channels"],"prefix":"10.1109","volume":"28","author":[{"given":"P.","family":"Delsarte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Piret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056062"},{"key":"ref11","first-page":"89","article-title":"Binary symmetric channel capacity is attained with irreducible codes","volume":"10","author":"goppa","year":"1974","journal-title":"Probl Inform Transm"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2319442"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055732"},{"key":"ref14","author":"apostol","year":"1976","journal-title":"Introduction to Analytic Number Theory"},{"key":"ref4","author":"forney","year":"1966","journal-title":"Concatenated Codes"},{"key":"ref3","author":"mceliece","year":"1977","journal-title":"The Theory of Information and Coding"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1980.1056243"},{"key":"ref5","first-page":"36","article-title":"Complexity of constructing codes with specified correction properties","volume":"15","author":"krachkovskii","year":"1979","journal-title":"Probl Inform Transm"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.21236\/AD0407946","author":"massey","year":"1963","journal-title":"Threshold Decoding"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054893"},{"key":"ref2","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055068"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22727\/01056525.pdf?arnumber=1056525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:58:39Z","timestamp":1752775119000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1056525\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":14,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.1982.1056525","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,7]]}}}