{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:51:17Z","timestamp":1761486677332,"version":"3.41.2"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1023\/a:1008341129955","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T09:41:38Z","timestamp":1040550098000},"page":"161-178","source":"Crossref","is-referenced-by-count":13,"title":["On Minimal Realization Over a Finite Chain Ring"],"prefix":"10.1007","volume":"16","author":[{"given":"Graham","family":"Norton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"195207_CR1","unstructured":"M. F. Atiyah and I. G. Macdonald, Introduction to Commutative Algebra. Addison-Wesley (1969)."},{"key":"195207_CR2","volume-title":"Algebraic Coding Theory","author":"E. R. Berlekamp","year":"1968","unstructured":"E. R. Berlekamp, Algebraic Coding Theory. McGraw Hill, New York (1968)."},{"key":"195207_CR3","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1109\/TIT.1973.1055088","volume":"19","author":"E. R. Berlekamp","year":"1973","unstructured":"E. R. Berlekamp, Goppa codes, IEEE Trans. Information Theory, Vol. 19 (1973) pp. 590-592.","journal-title":"IEEE Trans. Information Theory"},{"key":"195207_CR4","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1090\/S0273-0979-1993-00426-9","volume":"29","author":"A. R. Calderbank","year":"1993","unstructured":"A. R. Calderbank, A. R. Hammons, P. V. Kumar, N. J. A. Sloane, and P. Sol\u00e9, A linear construction for certain Kerdock and Preparata codes, Bull. Amer. Math. Soc., Vol. 29 (1993) pp. 218-222.","journal-title":"Bull. Amer. Math. Soc."},{"key":"195207_CR5","unstructured":"P. Fitzpatrick, J. Nelson, G. H. Norton, A systolic version of the extended Euclidean algorithm, Proc. International Conference on Systolic Arrays, Killarney, pp. 477-487, Prentice-Hall (1989)."},{"key":"195207_CR6","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1109\/18.568713","volume":"43","author":"J. C. Interlando","year":"1997","unstructured":"J. C. Interlando, R. Palazzo, M. Elia, On the decoding of Reed-Solomon and BCH codes over integer residue rings, IEEE Trans. Information Theory, Vol. 43 (1997) pp. 1013-1021.","journal-title":"IEEE Trans. Information Theory"},{"key":"195207_CR7","unstructured":"R. Gilmer, Multiplicative Ideal Theory, Marcel Dekker (1972)."},{"key":"195207_CR8","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J. L. Massey","year":"1969","unstructured":"J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Trans. Information Theory, Vol. 15 (1969) pp. 122-127.","journal-title":"IEEE Trans. Information Theory"},{"key":"195207_CR9","unstructured":"B. R. MacDonald, Finite Rings with Identity, Marcel Dekker, Inc. (1974)."},{"key":"195207_CR10","first-page":"608","volume":"18","author":"G. H. Norton","year":"1989","unstructured":"G. H. Norton, Precise analyses of the right-and left-shift greatest common divisor algorithms for GF(q)[X], S.I.A.M. J. Computing, Vol. 18 (1989) pp. 608-624.","journal-title":"S.I.A.M. J. Computing"},{"key":"195207_CR11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1006\/jsco.1995.1040","volume":"20","author":"G. H. Norton","year":"1995","unstructured":"G. H. Norton, On the minimal realizations of a finite sequence, J. Symbolic Computation, Vol. 20 (1995) pp. 93-115.","journal-title":"J. Symbolic Computation"},{"key":"195207_CR12","unstructured":"G. H. Norton, On shortest linear recurrences, J. Symbolic Computation, submitted."},{"key":"195207_CR13","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N. J. Patterson","year":"1975","unstructured":"N. J. Patterson, The algebraic decoding of Goppa codes, IEEE Trans. IT, Vol. 21 (1975) pp. 203-207.","journal-title":"IEEE Trans. IT"},{"key":"195207_CR14","first-page":"505","volume":"14","author":"J. A. Reeds","year":"1985","unstructured":"J. A. Reeds and N. J. A. Sloane, Shift-register synthesis (modulo m), S.I.A.M. J. Computing, Vol. 14 (1985) pp. 505-513.","journal-title":"S.I.A.M. J. Computing"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008341129955.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008341129955\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008341129955.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:40:41Z","timestamp":1753760441000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008341129955"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":14,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["195207"],"URL":"https:\/\/doi.org\/10.1023\/a:1008341129955","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}