{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T14:45:55Z","timestamp":1761057955292},"reference-count":10,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1975,1,1]],"date-time":"1975-01-01T00:00:00Z","timestamp":157766400000},"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":[[1975,1]]},"DOI":"10.1109\/tit.1975.1055337","type":"journal-article","created":{"date-parts":[[2004,4,27]],"date-time":"2004-04-27T18:27:04Z","timestamp":1083090424000},"page":"64-69","source":"Crossref","is-referenced-by-count":11,"title":["On a class of alternating cyclic convolutional codes"],"prefix":"10.1109","volume":"21","author":[{"given":"P.","family":"Piret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","first-page":"63","volume":"3","author":"layland","year":"1970","journal-title":"An upper bound on the free distance of a tree code"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1147\/rd.136.0675"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054833"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054539"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054541"},{"key":"ref8","first-page":"257","article-title":"Convolutional codes and irreducible ideals","volume":"27","author":"piret","year":"1972","journal-title":"Philips Res Rep"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1971.1054712"},{"key":"ref2","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":"ref9","author":"marcus","year":"1964","journal-title":"A Survey of Matrix Theory and Matrix Inequalities"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1965.tb01664.x"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/22682\/01055337.pdf?arnumber=1055337","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,29]],"date-time":"2024-04-29T17:36:04Z","timestamp":1714412164000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1055337\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,1]]},"references-count":10,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.1975.1055337","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,1]]}}}