{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T04:23:56Z","timestamp":1743913436760},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T00:00:00Z","timestamp":1460678400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10623-016-0204-9","type":"journal-article","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T09:53:27Z","timestamp":1460714007000},"page":"101-114","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["On MDS convolutional codes over $${\\mathbb {Z}}_{p^{r}}$$ Z p r"],"prefix":"10.1007","volume":"83","author":[{"given":"Diego","family":"Napp","sequence":"first","affiliation":[]},{"given":"Raquel","family":"Pinto","sequence":"additional","affiliation":[]},{"given":"Marisa","family":"Toste","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,15]]},"reference":[{"key":"204_CR1","doi-asserted-by":"crossref","unstructured":"Almeida P., Napp D., Pinto R.: A new class of superregular matrices and MDP convolutional codes. Linear Algebr. Appl. 439(7), 2145\u20132157 (2013).","DOI":"10.1016\/j.laa.2013.06.013"},{"key":"204_CR2","unstructured":"Ashikhmin A., Zyablov V.: Samples of unit-memory codes over $${\\mathbb{Z}}_{4}$$ Z 4 . In: Proceedings of IEEE International Workshop on Information Theory, Moscow, Russia, pp. 119\u2013121 (1994)."},{"key":"204_CR3","doi-asserted-by":"crossref","unstructured":"Calderbank A.R., Sloane N.J.A.: Modular and p-adic cyclic codes. Des. Codes Cryptogr. 6(1), 21\u201335 (1995).","DOI":"10.1007\/BF01390768"},{"key":"204_CR4","doi-asserted-by":"crossref","unstructured":"Chang S.K., Gill A.: Algorithmic solution of the change-making problem. Assoc. Comput. Mach. 17(1), 113\u2013122 (1970).","DOI":"10.1145\/321556.321567"},{"key":"204_CR5","doi-asserted-by":"crossref","unstructured":"Chen C.J., Chen T.Y., Loeliger H.A.: Construction of linear ring codes for 6 PSK. IEEE Trans. Inf. Theory 40(2), 563\u2013566 (1994).","DOI":"10.1109\/18.312187"},{"key":"204_CR6","doi-asserted-by":"crossref","unstructured":"Fagnani F., Zampieri S.: Canonical kernel representations for behaviors over finite abelian groups. Syst. Control Lett. 32(5), 271\u2013282 (1997).","DOI":"10.1016\/S0167-6911(97)00083-2"},{"key":"204_CR7","doi-asserted-by":"crossref","unstructured":"Fagnani F., Zampieri S.: System-theoretic properties of convolutional codes over rings. IEEE Trans. Inf. Theory 47(6), 2256\u20132274 (2001).","DOI":"10.1109\/18.945247"},{"key":"204_CR8","doi-asserted-by":"crossref","unstructured":"Greferath M., Schmidt S.E.: Finite-ring combinatorics and macwilliams\u2019 equivalence theorem. J. Comb. Theory Ser. A 92(1), 17\u201328 (2000).","DOI":"10.1006\/jcta.1999.3033"},{"key":"204_CR9","doi-asserted-by":"crossref","unstructured":"Guardia G.G.L.: On classical and quantum mds-convolutional bch codes. IEEE Trans. Inf. Theory 60(1), 304\u2013312 (2014).","DOI":"10.1109\/TIT.2013.2287693"},{"key":"204_CR10","doi-asserted-by":"crossref","unstructured":"Guendaa K., Gulliver T.A.: MDS and self-dual codes over rings. Finite Fields Appl.18(6), 1061\u20131075 (2012).","DOI":"10.1016\/j.ffa.2012.09.003"},{"key":"204_CR11","doi-asserted-by":"crossref","unstructured":"Johannesson R., Wittenmark E.: Two 16-state, rate r=2\/4 trellis codes whose free distances meet the heller bound. IEEE Trans. Inf. Theory 44(4), 1602\u20131604 (1998).","DOI":"10.1109\/18.681337"},{"key":"204_CR12","doi-asserted-by":"crossref","unstructured":"Johannesson R., Zigangirov K.S.: Fundamentals of Convolutional Coding. IEEE Press, New York (1999).","DOI":"10.1109\/9780470544693"},{"key":"204_CR13","doi-asserted-by":"crossref","unstructured":"Johannesson R., Wan Z., Wittenmark E.: Some structural properties of convolutional codes over rings. IEEE Trans. Inf. Theory 44(2), 839\u2013845 (1998).","DOI":"10.1109\/18.661532"},{"key":"204_CR14","unstructured":"K\u00f6tter R., Dettmar U., Sorger U.K.: On the construction of trellis codes based on (P)UM codes over $${\\mathbb{Z}}_4$$ Z 4 . Probl. Inf. Transm. 31(2), 154\u2013161 (1995)."},{"key":"204_CR15","doi-asserted-by":"crossref","unstructured":"Kuijper M., Pinto R.: Minimal trellis construction for finite support convolutional ring codes. Lecture Notes in Computer Science. Coding Theory Appl. 5228, 95\u2013106 (2008).","DOI":"10.1007\/978-3-540-87448-5_11"},{"key":"204_CR16","doi-asserted-by":"crossref","unstructured":"Kuijper M., Pinto R.: On minimality of convolutional ring encoders. IEEE Trans. Autom. Control 55(11), 4890\u20134897 (2009).","DOI":"10.1109\/TIT.2009.2030486"},{"key":"204_CR17","doi-asserted-by":"crossref","unstructured":"Kuijper M., Pinto R., Polderman J.W.: The predictable degree property and row reducedness for systems over a finite ring. Linear Algebr. Appl. 425(2\u20133), 776\u2013796 (2007).","DOI":"10.1016\/j.laa.2007.04.015"},{"key":"204_CR18","unstructured":"Massey J.L., Mittelholzer T.: Convolutional codes over rings. In: Proceedings of 4th Joint Swedish-Soviet International Workshop Information Theory, pp. 14\u201318 (1989)."},{"key":"204_CR19","unstructured":"McDonald B.: Finite Rings with Identity. Marcel Dekker, New York (1974)."},{"key":"204_CR20","unstructured":"McEliece R.J.: The algebraic theory of convolutional codes. In: Pless V., Huffman W. (eds.) Handbook of Coding Theory, vol. 1, pp. 1065\u20131138. Elsevier Science Publishers, Amsterdam (1998)."},{"key":"204_CR21","doi-asserted-by":"publisher","unstructured":"Napp D., Smarandache R.: Constructing strongly mds convolutional codes with maximum distance profile. Adv. Math. Commun. 10(2), (2016). doi: 10.3934\/amc.2016005 .","DOI":"10.3934\/amc.2016005"},{"key":"204_CR22","doi-asserted-by":"crossref","unstructured":"Napp D., Perea C., Pinto R.: Input-state-output representations and constructions of finite support 2D convolutional codes. Adv. Math. Commun. 4(4), 533\u2013545 (2010).","DOI":"10.3934\/amc.2010.4.533"},{"key":"204_CR23","doi-asserted-by":"crossref","unstructured":"Norton G.: On minimal realization over a finite chain ring. Des Codes Cryptogr. 16(2), 161\u2013178 (1999).","DOI":"10.1023\/A:1008341129955"},{"key":"204_CR24","doi-asserted-by":"crossref","unstructured":"Norton G., Salagean A.: On the key equation over a commutative ring. Des Codes Cryptogr. 20(2), 125\u2013141 (2000).","DOI":"10.1023\/A:1008385407717"},{"key":"204_CR25","doi-asserted-by":"crossref","unstructured":"Norton G.H., Salagean A.: On the hamming distance of linear codes over a finite chain ring. IEEE Trans. Inf. Theory 46(3), 1060\u20131067 (2001).","DOI":"10.1109\/18.841186"},{"key":"204_CR26","doi-asserted-by":"crossref","unstructured":"Oued M.E., Sole P.: MDS convolutional codes over a finite ring. IEEE Trans. Inf. Theory 59(11), 7305\u20137313 (2013).","DOI":"10.1109\/TIT.2013.2277721"},{"key":"204_CR27","doi-asserted-by":"crossref","unstructured":"Rosenthal J., Smarandache R.: Maximum distance separable convolutional codes. Appl. Algebr. Eng. Commun. Comput. 10(1), 15\u201332 (1999).","DOI":"10.1007\/s002000050120"},{"key":"204_CR28","doi-asserted-by":"crossref","unstructured":"Rosenthal J., Schumacher J.M., York E.V.: On behaviors and convolutional codes. IEEE Trans. Autom. Control 42(6, part 1), 1881\u20131891 (1996).","DOI":"10.1109\/18.556682"},{"key":"204_CR29","doi-asserted-by":"crossref","unstructured":"Smarandache R., Gluesing-Luerssen H., Rosenthal J.: Constructions for MDS-convolutional codes. IEEE Trans. Autom. Control 47(5), 2045\u20132049 (2001).","DOI":"10.1109\/18.930938"},{"key":"204_CR30","doi-asserted-by":"crossref","unstructured":"Sole P., Sison V.: Quaternary convolutional codes from linear block codes over galois rings. IEEE Trans. Inf. Theory 53, 2267\u20132270 (2007).","DOI":"10.1109\/TIT.2007.896884"},{"key":"204_CR31","doi-asserted-by":"crossref","unstructured":"Vazirani V., Saran H., Rajan B.: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory 42, 1839\u20131854 (1996).","DOI":"10.1109\/18.556679"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0204-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0204-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0204-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:58:42Z","timestamp":1559231922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0204-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,15]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["204"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0204-9","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4,15]]}}}