{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:19:01Z","timestamp":1780053541329,"version":"3.54.0"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1976,9,1]],"date-time":"1976-09-01T00:00:00Z","timestamp":210384000000},"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":[[1976,9]]},"DOI":"10.1109\/tit.1976.1055617","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T09:44:54Z","timestamp":1083059094000},"page":"514-517","source":"Crossref","is-referenced-by-count":150,"title":["An optimum symbol-by-symbol decoding rule for linear codes"],"prefix":"10.1109","volume":"22","author":[{"given":"C.","family":"Hartmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L.","family":"Rudolph","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","first-page":"207","author":"peterson","year":"1961","journal-title":"Error-Correcting Codes"},{"key":"ref3","author":"rudin","year":"1967","journal-title":"Fourier Analysis on Groups"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055221"},{"key":"ref6","author":"peterson","year":"1972","journal-title":"Error-Correcting Codes"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1975.1092884"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1053994"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/1016056"},{"key":"ref8","article-title":"M.A.P. bit decoding of convolutional codes","author":"mcadam","year":"1972","journal-title":"IEEE Int Symp Information Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.21236\/AD0407946","author":"massey","year":"1963","journal-title":"Threshold Decoding"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1974.1092169"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22692\/01055617.pdf?arnumber=1055617","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:25Z","timestamp":1752103045000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1055617\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,9]]},"references-count":12,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.1976.1055617","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,9]]}}}