{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T22:46:47Z","timestamp":1648766807198},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T00:00:00Z","timestamp":1441584000000},"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":["Cryptogr. Commun."],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s12095-015-0157-2","type":"journal-article","created":{"date-parts":[[2015,9,7]],"date-time":"2015-09-07T05:40:29Z","timestamp":1441604429000},"page":"513-523","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Determining the k-error joint linear complexity spectrum for a binary multisequence with period p n"],"prefix":"10.1007","volume":"8","author":[{"given":"Fulin","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixin","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Honggang","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting","family":"Jiang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,7]]},"reference":[{"key":"157_CR1","unstructured":"Berlekamp, E.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"issue":"1","key":"157_CR2","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1109\/TIT.1969.1054260","volume":"15","author":"J Massey","year":"1969","unstructured":"Massey, J.: Shift register synthesis and BCH decoding. IEEE Trans. Inf. Theory 15(1), 122\u2013127 (1969)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"157_CR3","doi-asserted-by":"crossref","first-page":"1389","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 . IEEE Trans. Inf. Theory 39, 1389\u20131401 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"157_CR4","doi-asserted-by":"crossref","unstructured":"Ding, C., Xiao, G., Shan, W.: The stability theory of stream ciphers. Lecture Notes in Computer Science, vol. 561. Springer, Berlin (1991)","DOI":"10.1007\/3-540-54973-0"},{"key":"157_CR5","doi-asserted-by":"crossref","unstructured":"Ding, C.: Lower bounds on the weight complexities of cascaded binary sequences, in advances in Cryptology-AVSCRYPT\u201990. Lecture Notes in Computer Science. In: Seberry, J., Pieprzyk, J. (eds.) , vol. 453, pp 39\u201343. Springer, Berlin (1991)","DOI":"10.1007\/BFb0030350"},{"key":"157_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1109\/TIT.2002.807308","volume":"49","author":"H Niederreiter","year":"2003","unstructured":"Niederreiter, H.: Periodic sequences with the large k-error linear complexity. IEEE Trans. Inf. Theory 49, 501\u2013505 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"157_CR7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1109\/TIT.1983.1056619","volume":"29","author":"R Games","year":"1983","unstructured":"Games, R., Chan, A.: A fast algorithm for determining the complexity of a binary sequence with period 2 n . IEEE Trans. Inf. Theory 29(1), 144\u2013146 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"157_CR8","first-page":"33","volume":"109\u2013122","author":"W Meidl","year":"2004","unstructured":"Meidl, W.: How many bits have to be changed to decrease the linear complexity ?. Des. Codes Cryptogr. 109\u2013122, 33 (2004)","journal-title":"Des. Codes Cryptogr."},{"issue":"6","key":"157_CR9","doi-asserted-by":"crossref","first-page":"2203","DOI":"10.1109\/18.868492","volume":"46","author":"GZ Xiao","year":"2000","unstructured":"Xiao, G.Z., Wei, S.M., et al.: A fast algorithm for determining the linear complexity of a sequence with period p n over F q . IEEE Trans. Inf. Theory 46(6), 2203\u20132206 (2000)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"157_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1109\/TIT.2002.806136","volume":"49","author":"A Lauder","year":"2003","unstructured":"Lauder, A., Paterson, K.: Computing the error linear complexity spectrum of a binary sequence of period 2 n . IEEE Trans. Inf. Theory 49(1), 273\u2013280 (2003)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"157_CR11","doi-asserted-by":"crossref","first-page":"2905","DOI":"10.1109\/TIT.2004.836670","volume":"50","author":"LP Wang","year":"2004","unstructured":"Wang, L.P., Zhu, Y.F.: On the lattice basis reduction multisequences synthesis algorithm. IEEE Trans. Inf. Theory 50(11), 2905\u20132910 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"157_CR12","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1134\/S0032946011020062","volume":"47","author":"VR Sidorenko","year":"2011","unstructured":"Sidorenko, V.R., Schmidt G.: A linear algebraic approach to multisequence shift-register synthesis. Probl. Inf. Transm. 47(2), 149\u2013165 (2011)","journal-title":"Probl. Inf. Transm."},{"issue":"8","key":"157_CR13","doi-asserted-by":"crossref","first-page":"3858","DOI":"10.1109\/TIT.2009.2023714","volume":"55","author":"CP Xing","year":"2009","unstructured":"Xing, C.P., Ding, Y.: Multisequences linear with large field, k-error linear complexity from Hermitian function. IEEE Trans. Inf. Theory 55(8), 3858\u20133863 (2009)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"157_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-008-9174-x","volume":"49","author":"H Niederreiter","year":"2008","unstructured":"Niederreiter, H., Venkateswarlu, A.: Periodic multisequences with large error linear complexity. Des Codes Cryptogr. 49, 33\u201345 (2008)","journal-title":"Des Codes Cryptogr."},{"issue":"169","key":"157_CR15","first-page":"192","volume":"23","author":"W Meidl","year":"2007","unstructured":"Meidl, W., Niederreiter, H., Venkateswarlu, A.: Error linear complexity measures for multisequences. J. Complexity 23(169), 192 (2007)","journal-title":"J. Complexity"},{"issue":"6","key":"157_CR16","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1016\/S1005-8885(13)60114-4","volume":"20","author":"LI Fulin","year":"2013","unstructured":"Fulin, L.I., Shixin, Z.H.U.: Computing the k-error joint linear complexity of binary periodic multisequences. The Journal of China Universities of Posts and Telecommunications 20(6), 96\u2013101 (2013)","journal-title":"The Journal of China Universities of Posts and Telecommunications"},{"issue":"3","key":"157_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/09720529.2008.10698185","volume":"11","author":"M Sethumadhavana","year":"2008","unstructured":"Sethumadhavana, M. , Sindhua, M., Srinivasana, C., Kavithaa, C.: An algorithm for k-error joint linear complexity of binary multisequences. J. Discret. Math. Sci. Cryptogr. 11(3), 297\u2013304 (2008)","journal-title":"J. Discret. Math. Sci. Cryptogr."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0157-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12095-015-0157-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-015-0157-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,30]],"date-time":"2019-08-30T06:55:12Z","timestamp":1567148112000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12095-015-0157-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,7]]},"references-count":17,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["157"],"URL":"https:\/\/doi.org\/10.1007\/s12095-015-0157-2","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,7]]}}}