{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T09:23:20Z","timestamp":1648805000544},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1979,3,1]],"date-time":"1979-03-01T00:00:00Z","timestamp":289094400000},"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":12558,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Control"],"published-print":{"date-parts":[[1979,3]]},"DOI":"10.1016\/s0019-9958(79)90819-2","type":"journal-article","created":{"date-parts":[[2004,12,15]],"date-time":"2004-12-15T04:12:12Z","timestamp":1103083932000},"page":"332-334","source":"Crossref","is-referenced-by-count":0,"title":["Addendum to \u201cGeneralized permutations in convolutional codes\u201d"],"prefix":"10.1016","volume":"40","author":[{"given":"Philippe","family":"Piret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0019-9958(79)90819-2_bib1","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1109\/TIT.1974.1055223","article-title":"Free distance bounds for convolutional codes","volume":"IT-20","author":"Costello","year":"1974","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(79)90819-2_bib2","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1137\/0134049","article-title":"Automorphism groups of convolutional codes","volume":"34","author":"Delsarte","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0019-9958(79)90819-2_bib3","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1109\/TIT.1970.1054539","article-title":"Use of sequential decoder to analyze convolutional code structure","volume":"IT-16","author":"Forney","year":"1970","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0019-9958(79)90819-2_bib4","first-page":"37","article-title":"An upper bound on the free distance of a tree code","author":"Layland","year":"1970","journal-title":"Jet Prop. Lab. Space Program Summary"},{"key":"10.1016\/S0019-9958(79)90819-2_bib5","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0019-9958(78)90186-9","article-title":"Generalized permutations in convolutional codes","volume":"38","author":"Piret","year":"1978","journal-title":"Inform. Contr."}],"container-title":["Information and Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995879908192?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0019995879908192?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T10:20:25Z","timestamp":1556706025000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0019995879908192"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,3]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,3]]}},"alternative-id":["S0019995879908192"],"URL":"https:\/\/doi.org\/10.1016\/s0019-9958(79)90819-2","relation":{},"ISSN":["0019-9958"],"issn-type":[{"value":"0019-9958","type":"print"}],"subject":[],"published":{"date-parts":[[1979,3]]}}}