{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,10]],"date-time":"2025-04-10T06:07:38Z","timestamp":1744265258921},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606932"},{"type":"electronic","value":"9783540492801"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60693-9_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:54:36Z","timestamp":1330289676000},"page":"53-62","source":"Crossref","is-referenced-by-count":4,"title":["Some decoding applications of minimal realization"],"prefix":"10.1007","author":[{"given":"Graham","family":"Norton","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"8_CR1","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R. (1968). Algebraic Coding Theory. Mc-Graw Hill, New York."},{"key":"8_CR2","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1109\/TIT.1973.1055088","volume":"19","author":"E.R. Berlekamp","year":"1973","unstructured":"Berlekamp, E.R. (1973) Goppa Codes. IEEE Trans. Information Theory\n19, 590\u2013592.","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Ding, C., Xiao, G., Shan, W. (1991). The stability theory of stream ciphers. Springer Lecture Notes in Computer Science\n561.","DOI":"10.1007\/3-540-54973-0_2"},{"key":"8_CR4","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1109\/18.179340","volume":"39","author":"G.L. Feng","year":"1993","unstructured":"Feng, G.L., Rao, T.R.N. (1993) Decoding algebraic-geometric codes up to designed minimum distance. IEEE Trans. Information Theory\n39, 37\u201345.","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/18.133246","volume":"37","author":"G.L. Feng","year":"1991","unstructured":"Feng, G.L. and Tzeng, K.K. (1991). A generalization of the Berlekamp-Massey algorithm for multisequence shift register sequence synthesis with applications to decoding cyclic codes. IEEE Trans. Information Theory\n37, 1274\u20131287.","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J.L. Massey","year":"1969","unstructured":"Massey, J.L. (1969). Shift register synthesis and BCH decoding. IEEE Trans. Information Theory\n15, 122\u2013127.","journal-title":"IEEE Trans. Information Theory"},{"key":"8_CR7","volume-title":"The Theory of Information and Coding (Encyclopedia of Mathematics and its Applications3)","author":"R. McEliece","year":"1977","unstructured":"McEliece, R. (1977). The Theory of Information and Coding (Encyclopedia of Mathematics and its Applications\n3). Addison-Wesley, Reading, Mass."},{"key":"8_CR8","unstructured":"Norton, G.H. (1994). On the minimal realizations of a finite sequence. (Extended Abstract). Eurocodes '94 (C\u00f4te d'Or, October 1994), 203\u2013208."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Norton, G.H. (1995). On n-dimensional sequences. I. J. Symbolic Computation. In press.","DOI":"10.1006\/jsco.1995.1039"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Norton, G.H. (1995). On the minimal realizations of a finite sequence. J. Symbolic Computation. In press.","DOI":"10.1006\/jsco.1995.1040"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/TIT.1975.1055350","volume":"21","author":"N.J. Patterson","year":"1975","unstructured":"Patterson, N.J. (1975). The algebraic decoding of Goppa codes. IEEE Trans. IT\n21, 203\u2013207.","journal-title":"IEEE Trans. IT"},{"key":"8_CR12","first-page":"318","volume":"135","author":"T.K. Truong","year":"1988","unstructured":"Truong, T.K., Eastman, W.L., Reed, I.S., Hsu, I.S. (1988). Simplified procedure for correcting both errors and erasures of Reed-Solomon code using Euclidean algorithm. IEE Proceedings\n135, 318\u2013324.","journal-title":"IEE Proceedings"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60693-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:27:08Z","timestamp":1619573228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60693-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606932","9783540492801"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-60693-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}