{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:21:16Z","timestamp":1775053276718,"version":"3.50.1"},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[1976,3,1]],"date-time":"1976-03-01T00:00:00Z","timestamp":194486400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1976,3,1]],"date-time":"1976-03-01T00:00:00Z","timestamp":194486400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1976,3,1]],"date-time":"1976-03-01T00:00:00Z","timestamp":194486400000},"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,3]]},"DOI":"10.1109\/tit.1976.1055519","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T14:27:04Z","timestamp":1083076024000},"page":"243-246","source":"Crossref","is-referenced-by-count":19,"title":["Minimum weight convolutional codewords of finite length (Corresp.)"],"prefix":"10.1109","volume":"22","author":[{"given":"G.","family":"Huth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Weber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TC.1968.229392","article-title":"inverses of linear sequential circuits","volume":"c 17","author":"masseyy","year":"1968","journal-title":"IEEE Transactions on Computers"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4842-8_12"},{"key":"ref10","author":"rosenberg","year":"1971","journal-title":"Structural properties of convolutional codes"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054263"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(68)90947-9"},{"key":"ref8","author":"odenwalder","year":"1970","journal-title":"Optimal decoding of convolutional codes"},{"key":"ref7","first-page":"171","article-title":"Short constraint length convolutional codes","volume":"iii","author":"heller","year":"1968","journal-title":"Jet Propulsion Laboratory Space Programs Summary"},{"key":"ref2","author":"golomb","year":"1967","journal-title":"Shift Register Sequences"},{"key":"ref9","author":"huth","year":"1971","journal-title":"Performance bounds for sequential decoding using minimum distance properties"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1971.1090700"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22689\/01055519.pdf?arnumber=1055519","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,9]],"date-time":"2025-07-09T23:17:17Z","timestamp":1752103037000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1055519\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,3]]},"references-count":10,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tit.1976.1055519","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1976,3]]}}}