{"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":1743913436177,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,5,20]],"date-time":"2016-05-20T00:00:00Z","timestamp":1463702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,5,20]],"date-time":"2016-05-20T00:00:00Z","timestamp":1463702400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP0209243"],"award-info":[{"award-number":["DP0209243"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Portuguese Foundation for Science and Technology","award":["UID\/MAT\/04106\/2013"],"award-info":[{"award-number":["UID\/MAT\/04106\/2013"]}]},{"name":"Center for Research and Development in Mathematics and Applications","award":["UID\/MAT\/04106\/2013"],"award-info":[{"award-number":["UID\/MAT\/04106\/2013"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10623-016-0226-3","type":"journal-article","created":{"date-parts":[[2016,5,21]],"date-time":"2016-05-21T10:59:09Z","timestamp":1463828349000},"page":"283-305","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings"],"prefix":"10.1007","volume":"83","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9223-9550","authenticated-orcid":false,"given":"M.","family":"Kuijper","sequence":"first","affiliation":[]},{"given":"R.","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,5,20]]},"reference":[{"key":"226_CR1","doi-asserted-by":"publisher","DOI":"10.1090\/gsm\/003","volume-title":"An Introduction to Gr\u00f6bner Bases","author":"WW Adams","year":"1994","unstructured":"Adams, W.W., Loustaunau, P.: An Introduction to Gr\u00f6bner Bases. Graduate Studies in Mathematics. American Mathematical Society, Providence (1994)"},{"key":"226_CR2","doi-asserted-by":"publisher","first-page":"6718","DOI":"10.1109\/TIT.2011.2165803","volume":"57","author":"M Ali","year":"2011","unstructured":"Ali, M., Kuijper, M.: A parametric approach to list decoding of Reed-Solomon codes using interpolation. IEEE Trans. Inf. Theory 57, 6718\u20136728 (2011)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR3","volume-title":"Algebraic Coding Theory","author":"ER Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"key":"226_CR4","volume-title":"Theory and Practice of Error Control Codes","author":"RE Blahut","year":"1983","unstructured":"Blahut, R.E.: Theory and Practice of Error Control Codes. Addison-Wesley, Boston (1983)"},{"key":"226_CR5","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1006\/jsco.2001.0442","volume":"31","author":"E Byrne","year":"2001","unstructured":"Byrne, E., Fitzpatrick, P.: Gr\u00f6bner bases over Galois rings with an application to decoding alternant codes. J. Symbolic Comput. 31, 565\u2013584 (2001)","journal-title":"J. Symbolic Comput."},{"key":"226_CR6","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1109\/18.986002","volume":"48","author":"E Byrne","year":"2002","unstructured":"Byrne, E., Fitzpatrick, P.: Hamming metric decoding of alternant codes over Galois rings. IEEE Trans. Inf. Theory 48, 683\u2013694 (2002)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR7","doi-asserted-by":"publisher","first-page":"1290","DOI":"10.1109\/18.412677","volume":"41","author":"P Fitzpatrick","year":"1995","unstructured":"Fitzpatrick, P.: On the key equation. IEEE Trans. Inf. Theory 41, 1290\u20131302 (1995)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR8","unstructured":"Fitzpatrick P., Jennings S.: Comparison of two algorithms for decoding BCH codes. In: Proceedings 1997 IEEE International Symposium on Information Theory, ISIT\u201997, Ulm, pp. 325 (1997)."},{"key":"226_CR9","unstructured":"Forney G.D.: Convolutional codes I: algebraic structure. IEEE Trans. Inf. Theory 16, 720\u2013738 (1970). (note: correction in, vol. 17, p. 360, 1971)."},{"key":"226_CR10","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1137\/0313029","volume":"13","author":"GD Forney Jr","year":"1975","unstructured":"Forney Jr., G.D.: Minimal bases of rational vector spaces, with applications to multivariable linear systems. SIAM J. Control 13, 493\u2013520 (1975)","journal-title":"SIAM J. Control"},{"key":"226_CR11","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1515\/156939204774148820","volume":"14","author":"EV Gorbatov","year":"2004","unstructured":"Gorbatov, E.V.: Standard basis of a polynomial ideal over commutative Artinian chain ring. Discret. Math. Appl. 14, 75\u2013101 (2004)","journal-title":"Discret. Math. Appl."},{"key":"226_CR12","doi-asserted-by":"publisher","first-page":"6672","DOI":"10.1007\/s10958-006-0384-3","volume":"139","author":"EV Gorbatov","year":"2006","unstructured":"Gorbatov, E.V.: Standard basis concordant with the norm and computations in ideals and polylinear recurring sequences. J. Math. Sci. 139, 6672\u20136707 (2006)","journal-title":"J. Math. Sci."},{"key":"226_CR13","doi-asserted-by":"publisher","first-page":"1013","DOI":"10.1109\/18.568713","volume":"43","author":"JC Interlando","year":"1997","unstructured":"Interlando, J.C., Palazzo, R., Elia, M.: On the decoding of Reed-solomon and BCH codes over integer residue rings. IEEE Trans. Inf. Theory 43, 1013\u20131021 (1997)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR14","unstructured":"Kuijper M., Pinto R.: Parametrization of linear recurrence relations by row reduction for sequences over a finite ring. In: Proceeding of the 18th International Symposium on Mathematical Theory of Networks and Systems (MTNS), Virginia Tech, Blacksburg, July 2008, pp. 1\u201312."},{"key":"226_CR15","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1016\/j.laa.2007.04.015","volume":"425","author":"M Kuijper","year":"2007","unstructured":"Kuijper, M., Pinto, R., Polderman, J.W.: The predictable degree property and row reducedness for systems over a finite ring. Linear Algebra Appl. 425, 776\u2013796 (2007)","journal-title":"Linear Algebra Appl."},{"key":"226_CR16","doi-asserted-by":"crossref","unstructured":"Kuijper M., Schindelar K.: The predictable leading monomial property for polynomial vectors over a ring. In: Proceedings 2010 IEEE International Symposium in Information Theory (ISIT), Austin pp. 1133\u20131137 (2010).","DOI":"10.1109\/ISIT.2010.5513685"},{"key":"226_CR17","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.laa.2010.08.030","volume":"434","author":"M Kuijper","year":"2011","unstructured":"Kuijper, M., Schindelar, K.: Minimal Gr\u00f6bner bases and the predictable leading monomial property. Linear Algebra Appl. 434, 104\u2013116 (2011)","journal-title":"Linear Algebra Appl."},{"key":"226_CR18","doi-asserted-by":"publisher","first-page":"1554","DOI":"10.1109\/9.649704","volume":"42","author":"M Kuijper","year":"1997","unstructured":"Kuijper, M., Willems, J.C.: On constructing a shortest linear recurrence relation. IEEE Trans. Autom. Control 42, 1554\u20131558 (1997)","journal-title":"IEEE Trans. Autom. Control"},{"key":"226_CR19","doi-asserted-by":"crossref","unstructured":"Kuijper M., Wu X., Parampalli U.: Behavioral models over rings-minimal representations and applications to coding and sequences. In: Proceedings of the 16th IFAC World Congress, Prague, Czech Republic, 4\u20138 July 2005, pp. 1\u20136.","DOI":"10.3182\/20050703-6-CZ-1902.00201"},{"key":"226_CR20","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1515\/dma.1998.8.5.441","volume":"8","author":"VL Kurakin","year":"1998","unstructured":"Kurakin, V.L.: The Berlekamp-Massey algorithm over finite rings, modules, and bimodules. Discret. Math. Appl. 8, 441\u2013474 (1998)","journal-title":"Discret. Math. Appl."},{"key":"226_CR21","doi-asserted-by":"publisher","first-page":"2793","DOI":"10.1007\/BF02362772","volume":"76","author":"VL Kurakin","year":"1995","unstructured":"Kurakin, V.L., Kuzmin, A.S., Mikhalev, A.V., Nechaev, A.A.: Linear recurring sequences over rings and modules. J. Math. Sci. 76, 2793\u20132915 (1995)","journal-title":"J. Math. Sci."},{"key":"226_CR22","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1016\/j.jsc.2008.01.002","volume":"43","author":"K Lee","year":"2008","unstructured":"Lee, K., O\u2019Sullivan, M.E.: List decoding of Reed-Solomon codes from a Gr\u00f6bner basis perspective. J. Symbolic Comput. 43, 645\u2013658 (2008)","journal-title":"J. Symbolic Comput."},{"key":"226_CR23","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"JL Massey","year":"1969","unstructured":"Massey, J.L.: Shift-register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15, 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR24","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00047168","volume":"42","author":"AV Michalev","year":"1996","unstructured":"Michalev, A.V., Nechaev, A.A.: Linear recurring sequences over modules. Acta Appl. Math. 42, 161\u2013202 (1996)","journal-title":"Acta Appl. Math."},{"key":"226_CR25","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1515\/dma.1992.2.6.659","volume":"2","author":"AA Nechaev","year":"1992","unstructured":"Nechaev, A.A.: Linear recurring sequences over commutative rings. Discret. Math. Appl. 2, 659\u2013683 (1992)","journal-title":"Discret. Math. Appl."},{"key":"226_CR26","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1515\/dma.2001.11.6.545","volume":"11","author":"AA Nechaev","year":"2001","unstructured":"Nechaev, A.A., Mikhailov, D.A.: Canonical generating system of a monic polynomial ideal over a commutative artinian chain ring. Discret. Math. Appl. 11, 545\u2013586 (2001)","journal-title":"Discret. Math. Appl."},{"key":"226_CR27","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1023\/A:1008341129955","volume":"16","author":"G Norton","year":"1999","unstructured":"Norton, G.: On minimal realization over a finite chain ring. Des. Codes Cryptogr. 16, 161\u2013178 (1999)","journal-title":"Des. Codes Cryptogr."},{"key":"226_CR28","doi-asserted-by":"publisher","first-page":"4643","DOI":"10.1109\/TIT.2010.2054150","volume":"56","author":"G Norton","year":"2010","unstructured":"Norton, G.: Minimal polynomial algorithms for finite sequences. IEEE Trans. Inf. Theory 56, 4643\u20134645 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR29","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S1071-5797(03)00003-0","volume":"9","author":"G Norton","year":"2003","unstructured":"Norton, G., Salagean, A.: Cyclic codes and minimal strong Gr\u00f6bner bases over a principal ideal ring. Finite Fields Appl. 9, 237\u2013249 (2003)","journal-title":"Finite Fields Appl."},{"key":"226_CR30","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1137\/0214038","volume":"14","author":"JA Reeds","year":"1985","unstructured":"Reeds, J.A., Sloane, N.J.A.: Shift-register synthesis (modulo m). SIAM J. Comput. 14, 505\u2013513 (1985)","journal-title":"SIAM J. Comput."},{"key":"226_CR31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Cyphers","author":"RA Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Cyphers. Springer, New York (1986)"},{"key":"226_CR32","unstructured":"Salagean A.: An algorithm for computing minimal bidirectional linear recurrence relations. IEEE Trans. Inf. Theory 55, 4695\u20134700 (2009). (correction, vol. 56, p. 4180, 2010)."},{"key":"226_CR33","volume-title":"Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness","author":"IE Shparlinski","year":"2013","unstructured":"Shparlinski, I.E.: Cryptographic Applications of Analytic Number Theory: Complexity Lower Bounds and Pseudorandomness, vol. 22. Birkh\u00e4user, Boston (2013)"},{"key":"226_CR34","doi-asserted-by":"publisher","first-page":"1839","DOI":"10.1109\/18.556679","volume":"42","author":"VV Vazirani","year":"1996","unstructured":"Vazirani, V.V., Saran, H., Rajan, B.S.: An efficient algorithm for constructing minimal trellises for codes over finite abelian groups. IEEE Trans. Inf. Theory 42, 1839\u20131854 (1996)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"226_CR35","doi-asserted-by":"publisher","first-page":"3611","DOI":"10.1109\/TIT.2008.926355","volume":"54","author":"Y Wu","year":"2008","unstructured":"Wu, Y.: New list decoding algorithms for Reed-Solomon and BCH codes. IEEE Trans. Inf. Theory 54, 3611\u20133630 (2008)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0226-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0226-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0226-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0226-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:34:58Z","timestamp":1589722498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0226-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,20]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["226"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0226-3","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,5,20]]},"assertion":[{"value":"21 October 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 April 2016","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2016","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2016","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}