{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:54:22Z","timestamp":1725771262055},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642545245"},{"type":"electronic","value":"9783642545252"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54525-2_45","type":"book-chapter","created":{"date-parts":[[2014,2,7]],"date-time":"2014-02-07T14:26:22Z","timestamp":1391783182000},"page":"512-519","source":"Crossref","is-referenced-by-count":0,"title":["On the k-error Joint Linear Complexity and Error Multisequence over F q (char F q \u2009=\u2009p, prime)"],"prefix":"10.1007","author":[{"given":"M.","family":"Sindhu","sequence":"first","affiliation":[]},{"given":"M.","family":"Sethumadhavan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"The Stability Theory of Stream Ciphers","year":"1991","unstructured":"Ding, C., Xiao, G., Shan, W. (eds.): The Stability Theory of Stream Ciphers. LNCS, vol.\u00a0561. Springer, Heidelberg (1991)"},{"key":"45_CR2","doi-asserted-by":"crossref","unstructured":"Kaida, T.: On Algorithms for the k-Error Linear Complexity of Sequences over GF(p\n                  \n                    m\n                  \n                  ) with Period p\n                  \n                    n\n                  , Ph. D. Thesis, Kyusu Institute of Tech. (1999)","DOI":"10.1007\/978-1-4471-0551-0_21"},{"issue":"1-2","key":"45_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/inco.1998.2768","volume":"151","author":"T. Kaida","year":"1999","unstructured":"Kaida, T., Uehara, S., Imamaura, K.: An Algorithm for the k-Error Linear Complexity of Sequences over GF(p\n                    m\n                  ) with period p\n                    n\n                  , p a prime. Information and Computation\u00a0151(1-2), 137\u2013147 (1999)","journal-title":"Information and Computation"},{"key":"45_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/11423461_10","volume-title":"Sequences and Their Applications - SETA 2004","author":"T. Kaida","year":"2005","unstructured":"Kaida, T.: On the generalized Lauder Paterson algorithm and profiles of the k-error linear complexity for exponent periodic sequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 166\u2013178. Springer, Heidelberg (2005)"},{"issue":"1","key":"45_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 Transactions on Information Theory\u00a049(1), 273\u2013281 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11423461_5","volume-title":"Sequences and Their Applications - SETA 2004","author":"W. Meidl","year":"2005","unstructured":"Meidl, W.: Discrete Fourier Transform, Joint Linear Complexity and Generalised Joint Linear Complexity of Multisequences. In: Helleseth, T., Sarwate, D., Song, H.-Y., Yang, K. (eds.) SETA 2004. LNCS, vol.\u00a03486, pp. 101\u2013112. Springer, Heidelberg (2005)"},{"issue":"2","key":"45_CR7","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/j.jco.2006.10.005","volume":"23","author":"W. Meidl","year":"2007","unstructured":"Meidl, W., Niederreiter, H., Venkateswarlu, A.: Error linear complexity Measures for Multisequences. Journal of Complexity\u00a023(2), 169\u2013192 (2007)","journal-title":"Journal of Complexity"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0885-064X(02)00009-2","volume":"19","author":"W. Meidl","year":"2003","unstructured":"Meidl, W., Niederreiter, H.: The expected value of the joint linear complexity of periodic multisequences. Journal of Complexity\u00a019(1), 61\u201372 (2003)","journal-title":"Journal of Complexity"},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24582-7_1","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"H. Niederreiter","year":"2003","unstructured":"Niederreiter, H.: Linear Complexity and Related Complexity Measures for Sequences. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 1\u201317. Springer, Heidelberg (2003)"},{"issue":"3","key":"45_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1080\/09720529.2008.10698185","volume":"11","author":"M. Sethumadhavan","year":"2008","unstructured":"Sethumadhavan, M., Sindhu, M., Srinivasan, C., Kavitha, C.: An algorithm for k-error joint linear complexity of binary multisequences. Journal of Discrete Mathematical Sciences & Cryptography\u00a011(3), 297\u2013304 (2008)","journal-title":"Journal of Discrete Mathematical Sciences & Cryptography"},{"issue":"2","key":"45_CR11","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1080\/09720529.2006.10698076","volume":"9","author":"M. Sethumadhavan","year":"2006","unstructured":"Sethumadhavan, M., Yogha Laxmie, C., Vijaya Govindan, C.: A construction of p-ary balanced sequence with large k-error linear complexity. Journal of Discrete Mathematical Sciences and Cryptography\u00a09(2), 253\u2013261 (2006)","journal-title":"Journal of Discrete Mathematical Sciences and Cryptography"},{"key":"45_CR12","first-page":"6","volume":"16","author":"M. Sindhu","year":"2013","unstructured":"Sindhu, M., Sethumadhavan, M.: Linear Complexity Measures of Binary Multisequences. International Journal of Computer Applications\u00a016, 6\u201310 (2013)","journal-title":"International Journal of Computer Applications"},{"key":"45_CR13","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. Inf. Theory\u00a039, 1398\u20131407 (1993)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"45_CR14","unstructured":"Venkateswarlu, Studies on error linear complexity measures for multisequences, PhD thesis (2007)"}],"container-title":["Communications in Computer and Information Science","Recent Trends in Computer Networks and Distributed Systems Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54525-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T07:10:46Z","timestamp":1558854646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54525-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642545245","9783642545252"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54525-2_45","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2014]]}}}