{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T09:13:09Z","timestamp":1649149989511},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1977,1,1]],"date-time":"1977-01-01T00:00:00Z","timestamp":220924800000},"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":13347,"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":[[1977,1]]},"DOI":"10.1016\/s0019-9958(77)90427-2","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"56-71","source":"Crossref","is-referenced-by-count":4,"title":["Semiregular convolutional codes: definition, structure, and examples"],"prefix":"10.1016","volume":"33","author":[{"given":"Philippe","family":"Delsarte","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philippe","family":"Piret","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(77)90427-2_bib1","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(69)90497-5","article-title":"Some results on quaslcyclic codes","volume":"15","author":"Chen","year":"1969","journal-title":"Inform. Contr."},{"key":"10.1016\/S0019-9958(77)90427-2_bib2","series-title":"Representation Theory of Finite Groups and Associative Algebras","author":"Curtis","year":"1962"},{"key":"10.1016\/S0019-9958(77)90427-2_bib3","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/TIT.1970.1054541","article-title":"Convolutional codes I: Algebraic structure","volume":"IT-16","author":"Forney","year":"1970","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(77)90427-2_bib4","first-page":"63","article-title":"An upper bound on the free distance of a tree code","volume":"Vol. 3","author":"Layland","year":"1970","journal-title":"Jet Propulsion Laboratory Space Program Summary 37\u201362"},{"key":"10.1016\/S0019-9958(77)90427-2_bib5","series-title":"Combinatorial Mathematics and Its Applications","first-page":"317","article-title":"Codes and ideals in group algebras","author":"MacWilliams","year":"1967"},{"key":"10.1016\/S0019-9958(77)90427-2_bib6","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1002\/j.1538-7305.1970.tb01812.x","article-title":"Binary codes which are ideals in the group algebra of an abelian group","volume":"49","author":"MacWilliams","year":"1970","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/S0019-9958(77)90427-2_bib7","series-title":"Proceedings of the Symposium on Error Correcting Codes","article-title":"Some algebraic and distance properties of convolutional codes","author":"Massey","year":"1968"},{"key":"10.1016\/S0019-9958(77)90427-2_bib8","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1109\/TC.1968.229392","article-title":"Inverses of linear sequential circuits","volume":"C-17","author":"Massey","year":"1968","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0019-9958(77)90427-2_bib9","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1109\/TIT.1975.1055337","article-title":"On a class of alternating cyclic convolutional codes","volume":"IT-21","author":"Piret","year":"1975","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(77)90427-2_bib10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TIT.1976.1055531","article-title":"Structure and constructions of cyclic convolutional codes","volume":"IT-22","author":"Piret","year":"1976","journal-title":"IEEE Trans. Information Theory"},{"key":"10.1016\/S0019-9958(77)90427-2_bib11","series-title":"Finite Permutation Groups","author":"Wielandt","year":"1964"}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877904272?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995877904272?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,31]],"date-time":"2019-01-31T09:21:39Z","timestamp":1548926499000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995877904272"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,1]]}},"alternative-id":["S0019995877904272"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(77)90427-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1977,1]]}}}