{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T18:31:46Z","timestamp":1773858706830,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540772712","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77272-9_14","type":"book-chapter","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T11:56:55Z","timestamp":1196942215000},"page":"220-232","source":"Crossref","is-referenced-by-count":7,"title":["Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences"],"prefix":"10.1007","author":[{"given":"Alexandra","family":"Alecu","sequence":"first","affiliation":[]},{"given":"Ana","family":"S\u0103l\u0103gean","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"key":"14_CR2","volume-title":"The Stability Theory of Stream Ciphers","author":"C. Ding","year":"1992","unstructured":"Ding, C., Xiao, G., Shan, W.: The Stability Theory of Stream Ciphers. Springer, Heidelberg (1992)"},{"issue":"1","key":"14_CR3","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R.A. Games","year":"1983","unstructured":"Games, R.A., Chan, A.H.: A Fast Algorithm for Determining the Complexity of a Binary Sequence with Period 2\n                      n\n                    . IEEE Trans. Information Theory\u00a029(1), 144\u2013146 (1983)","journal-title":"IEEE Trans. Information Theory"},{"key":"14_CR4","first-page":"134","volume-title":"Information and Computation","author":"T. Kaida","year":"1999","unstructured":"Kaida, T., Uehara, S., Imamura, K.: An Algorithm for the k-error linear complexity of Sequences over GF(p\n                    \n                      m\n                    ) with Period p\n                    \n                      n\n                    , p a Prime. In: Information and Computation, vol.\u00a0151, pp. 134\u2013147. Academic Press, London (1999)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/TIT.2002.806136","volume":"49","author":"A.G.B. Lauder","year":"2003","unstructured":"Lauder, A.G.B., Paterson, K.G.: Computing the Error Linear Complexity Spectrum of a Binary Sequence of Period 2\n                      n\n                    . IEEE Trans. Information Theory\u00a049(1), 273\u2013283 (2003)","journal-title":"IEEE Trans. Information Theory"},{"key":"14_CR6","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-correcting Codes. North Holland, Amsterdam (1977)"},{"issue":"1","key":"14_CR7","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.: Shift-Register Synthesis and BCH Decoding. IEEE Trans. Information Theory\u00a015(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Information Theory"},{"key":"14_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-82865-2","volume-title":"Analysis and Design of Stream Ciphers","author":"R.A. Rueppel","year":"1986","unstructured":"Rueppel, R.A.: Analysis and Design of Stream Ciphers. Springer, New York (1986)"},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1109\/TIT.2004.842769","volume":"51","author":"A. Salagean","year":"2005","unstructured":"Salagean, A.: On the computation of the linear complexity and the k-error linear complexity of binary sequences with period a power of two. IEEE Trans. Information Theory\u00a051(3), 1145\u20131150 (2005)","journal-title":"IEEE Trans. Information Theory"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1398","DOI":"10.1109\/18.243455","volume":"39","author":"M. Stamp","year":"1993","unstructured":"Stamp, M., Martin, C.F.: An Algorithm for the k-Error Linear Complexity of Binary Sequences with Period 2\n                      n\n                    . IEEE Trans. Information Theory\u00a039(4), 1398\u20131401 (1993)","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77272-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:06:54Z","timestamp":1619521614000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77272-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540772712"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77272-9_14","relation":{},"subject":[]}}