{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T20:26:52Z","timestamp":1769286412536,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,4,22]],"date-time":"2006-04-22T00:00:00Z","timestamp":1145664000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[2006,6]]},"DOI":"10.1007\/s00200-006-0014-9","type":"journal-article","created":{"date-parts":[[2006,4,21]],"date-time":"2006-04-21T12:16:43Z","timestamp":1145621803000},"page":"151-170","source":"Crossref","is-referenced-by-count":13,"title":["On Doubly-Cyclic Convolutional Codes"],"prefix":"10.1007","volume":"17","author":[{"given":"Heide","family":"Gluesing-Luerssen","sequence":"first","affiliation":[]},{"given":"Wiland","family":"Schmale","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,4,22]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/s00200-004-0151-y","volume":"15","author":"J.A. Dom\u00ednguez P\u00e9rez","year":"2004","unstructured":"Dom\u00ednguez P\u00e9rez J.A., Mu\u00f1oz Porras J.M., Serrano Sotelo G. (2004). Convolutional codes of Goppa type. Appl Algebra Eng Comm Comput 15:51\u201361","journal-title":"Appl Algebra Eng Comm Comput"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"720","DOI":"10.1109\/TIT.1970.1054541","volume":"IT-16","author":"G.D. Forney Jr.","year":"1970","unstructured":"Forney G.D. Jr. (1970). Convolutional codes I: Algebraic structure. IEEE Trans Inform Theory IT-16:720\u2013738; (see also corrections in IEEE Trans Inform Theory, vol 17, 1971, p. 360)","journal-title":"IEEE Trans Inform Theory"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1137\/0313029","volume":"13","author":"G.D. Forney Jr.","year":"1975","unstructured":"Forney G.D. Jr. (1975). Minimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J Contr 13:493\u2013520","journal-title":"SIAM J Contr"},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1016\/j.laa.2005.06.023","volume":"408","author":"H. Gluesing-Luerssen","year":"2005","unstructured":"Gluesing-Luerssen H. (2005). On the weight distribution of convolutional codes. Linear Algebra Appl 408:298\u2013326","journal-title":"Linear Algebra Appl"},{"key":"14_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1142\/S0219498806001570","volume":"5","author":"H. Gluesing-Luerssen","year":"2006","unstructured":"Gluesing-Luerssen H., Langfeld B. (2006). On the algebraic parameters of convolutional codes with cyclic structure. J Algebra Appl 5:53\u201376","journal-title":"J Algebra Appl"},{"key":"14_CR6","unstructured":"Gluesing-Luerssen, H., Schmale, W.: Distance bounds for convolutional codes and some optimal codes. Available at http:\/\/arxiv.org\/pdf\/math.RA\/0305135 (2003) (in press)"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1023\/B:ACAP.0000027534.61242.09","volume":"82","author":"H. Gluesing-Luerssen","year":"2004","unstructured":"Gluesing-Luerssen H., Schmale W. (2004). On cyclic convolutional codes. Acta Appl Math 82:183\u2013237","journal-title":"Acta Appl Math"},{"key":"14_CR8","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1109\/TIT.2005.862100","volume":"52","author":"H. Gluesing-Luerssen","year":"2006","unstructured":"Gluesing-Luerssen H., Rosenthal J., Smarandache R. (2006). Strongly MDS convolutional codes. IEEE Trans Inform Theory 52:584\u2013598","journal-title":"IEEE Trans Inform Theory"},{"key":"14_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/j.sysconle.2004.06.005","volume":"54","author":"R. Hutchinson","year":"2005","unstructured":"Hutchinson R., Rosenthal J., Smarandache R. (2005). Convolutional codes with maximum profile. Syst Contr Lett 54:53\u201363","journal-title":"Syst Contr Lett"},{"key":"14_CR10","doi-asserted-by":"crossref","DOI":"10.1109\/9780470544693","volume-title":"Fundamentals of convolutional coding","author":"R. Johannesson","year":"1999","unstructured":"Johannesson R., Zigangirov K.S. (1999). Fundamentals of convolutional coding. IEEE Press, New York"},{"key":"14_CR11","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/18.54876","volume":"IT-36","author":"J. Justesen","year":"1990","unstructured":"Justesen J., Paaske E., Ballan M. (1990). Quasi-cyclic unit memory convolutional codes. IEEE Trans Inform Theory IT-36:540\u2013547","journal-title":"IEEE Trans Inform Theory"},{"key":"14_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58575-3","volume-title":"Introduction to coding theory","author":"J.H.V. Lint","year":"1999","unstructured":"Lint J.H.V. (1999). Introduction to coding theory, 3 edn. Springer, Berlin Heidelberg New York","edition":"3"},{"key":"14_CR13","first-page":"1065","volume-title":"Handbook of coding theory, vol 1","author":"R.J. McEliece","year":"1998","unstructured":"McEliece R.J. (1998). The algebraic theory of convolutional codes. In: Pless V., Huffman W. (eds) Handbook of coding theory, vol 1. Elsevier, Amsterdam, pp 1065\u20131138"},{"key":"14_CR14","first-page":"121","volume-title":"Communications and coding (P. G. Farrell 60th birthday celebration)","author":"R.J. McEliece","year":"1998","unstructured":"McEliece R.J. (1998). How to compute weight enumerators for convolutional codes. In: Darnell M., Honory B. (eds) Communications and coding (P. G. Farrell 60th birthday celebration). Wiley, New York, pp 121\u2013141"},{"key":"14_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1109\/TIT.1976.1055531","volume":"IT-22","author":"P. Piret","year":"1976","unstructured":"Piret P. (1976). Structure and constructions of cyclic convolutional codes. IEEE Trans Inform IT-22:147\u2013155","journal-title":"IEEE Trans Inform"},{"key":"14_CR16","first-page":"441","volume":"43","author":"P. Piret","year":"1988","unstructured":"Piret P. (1988). A convolutional equivalent to Reed-Solomon codes. Philips J Res 43:441\u2013458","journal-title":"Philips J Res"},{"key":"14_CR17","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TIT.1979.1056108","volume":"IT-25","author":"C. Roos","year":"1979","unstructured":"Roos C. (1979). On the structure of convolutional and cyclic convolutional codes. IEEE Trans Inform Theory IT-25:676\u2013683","journal-title":"IEEE Trans Inform Theory"},{"key":"14_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/s002000050120","volume":"10","author":"J. Rosenthal","year":"1999","unstructured":"Rosenthal J., Smarandache R. (1999). Maximum distance separable convolutional codes. Appl Algebra Eng Commun Comput 10:15\u201332","journal-title":"Appl Algebra Eng Commun Comput"},{"key":"14_CR19","doi-asserted-by":"crossref","first-page":"2045","DOI":"10.1109\/18.930938","volume":"IT-47","author":"R. Smarandache","year":"2001","unstructured":"Smarandache R., Gluesing-Luerssen H., Rosenthal J. (2001). Constructions of MDS-convolutional codes. IEEE Trans Inform Theory IT-47:2045\u20132049","journal-title":"IEEE Trans Inform Theory"},{"key":"14_CR20","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TIT.1983.1056739","volume":"IT-29","author":"C. Thommesen","year":"1983","unstructured":"Thommesen C., Justesen J. (1983). Bounds on distances and error exponents of unit memory codes. IEEE Trans Inform Theory IT-29:637\u2013649","journal-title":"IEEE Trans Inform Theory"}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-006-0014-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00200-006-0014-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00200-006-0014-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:24:19Z","timestamp":1558625059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00200-006-0014-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,22]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,6]]}},"alternative-id":["14"],"URL":"https:\/\/doi.org\/10.1007\/s00200-006-0014-9","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4,22]]}}}