{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:31:25Z","timestamp":1743071485063,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255151"},{"type":"electronic","value":"9783642255168"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-25516-8_6","type":"book-chapter","created":{"date-parts":[[2011,12,6]],"date-time":"2011-12-06T20:16:07Z","timestamp":1323202567000},"page":"79-96","source":"Crossref","is-referenced-by-count":0,"title":["On the Triple-Error-Correcting Cyclic Codes with Zero Set {1, 2 i \u2009+\u20091, 2 j \u2009+\u20091}"],"prefix":"10.1007","author":[{"given":"Vincent","family":"Herbert","sequence":"first","affiliation":[]},{"given":"Sumanta","family":"Sarkar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"1257","DOI":"10.1109\/18.508853","volume":"42","author":"D. Augot","year":"1996","unstructured":"Augot, D., Levy-dit-Vehel, F.: Bounds on the minimum distance of the duals of BCH codes. IEEE Transactions on Information Theory\u00a042(4), 1257\u20131260 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR2","first-page":"1723","volume-title":"Proceedings of the 2009 IEEE International Conference on Symposium on Information Theory, ISIT 2009","author":"C. Bracken","year":"2009","unstructured":"Bracken, C., Helleseth, T.: Triple-Error-Correcting BCH-like codes. In: Proceedings of the 2009 IEEE International Conference on Symposium on Information Theory, ISIT 2009, vol.\u00a03, pp. 1723\u20131725. IEEE Press, Piscataway (2009)"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Blahut, R.E.: Algebraic Codes for Data Transmission, 1st edn. Cambridge University Press (2002)","DOI":"10.1017\/CBO9780511800467"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/j.ffa.2003.08.004","volume":"10","author":"A.W. Bluher","year":"2004","unstructured":"Bluher, A.W.: On x q\u2009+\u20091+ax+b. Finite Fields and Their Applications\u00a010(3), 285\u2013305 (2004)","journal-title":"Finite Fields and Their Applications"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/S0019-9958(60)90287-4","volume":"3","author":"R.C. Bose","year":"1960","unstructured":"Bose, R.C., Ray-Chaudhuri, D.K.: On a class of error correcting binary group codes. Information and Control\u00a03, 68\u201379 (1960)","journal-title":"Information and Control"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1109\/18.825842","volume":"46","author":"A. Chang","year":"2000","unstructured":"Chang, A., Gaal, P., Golomb, S.W., Gong, G., Helleseth, T., Kumar, P.V.: On a conjectured ideal autocorrelation sequence, a related triple-error correcting cyclic code. IEEE Transactions on Information Theory\u00a046(2), 680\u2013687 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR7","first-page":"963","volume-title":"Handbook of Coding Theory, part I","author":"P. Charpin","year":"1998","unstructured":"Charpin, P.: Open problems on cyclic codes. In: Pless, V.S., Huffman, W.C. (eds.) Handbook of Coding Theory, part I, vol.\u00a01, ch. 11, pp. 963\u20131063. Elsevier, Amsterdam (1998)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/3-540-46035-7_14","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"P. Chose","year":"2002","unstructured":"Chose, P., Joux, A., Mitton, M.: Fast Correlation Attacks: An Algorithmic Point of View. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 209\u2013221. Springer, Heidelberg (2002)"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/3-540-39200-9_21","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"N. Courtois","year":"2003","unstructured":"Courtois, N., Meier, W.: Algebraic Attacks on Stream Ciphers with Linear Feedback. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 345\u2013359. Springer, Heidelberg (2003)"},{"issue":"4","key":"6_CR10","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1109\/18.761283","volume":"45","author":"H. Dobbertin","year":"1999","unstructured":"Dobbertin, H.: Almost perfect nonlinear power functions on GF(2 $^{\\mbox{n}}$ ): The Welch case. IEEE Transactions on Information Theory\u00a045(4), 1271\u20131275 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Helleseth, T., R\u00f8njom, S.: Simplifying algebraic attacks with univariate analysis. In: Information Theory and Applications Workshop (ITA 2011), pp. 1\u20137 (February 2011)","DOI":"10.1109\/ITA.2011.5743578"},{"issue":"5","key":"6_CR12","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1016\/S0019-9958(72)90887-X","volume":"20","author":"C.R.P. Hartmann","year":"1972","unstructured":"Hartmann, C.R.P., Tzeng, K.K.: Generalizations of the BCH bound. Information and Control\u00a020(5), 489\u2013498 (1972)","journal-title":"Information and Control"},{"key":"6_CR13","first-page":"335","volume-title":"Combinatorial Mathematics and Its Applications","author":"T. Kasami","year":"1969","unstructured":"Kasami, T.: Weight Distributions of BCH Codes. In: Combinatorial Mathematics and Its Applications, pp. 335\u2013357. University of North Carolina Press, Chapell Hill (1969)"},{"issue":"4","key":"6_CR14","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/S0019-9958(71)90473-6","volume":"18","author":"T. Kasami","year":"1971","unstructured":"Kasami, T.: The Weight Enumerators for Several Classes of Subcodes of the 2nd Order Binary Reed-Muller Codes. Information and Control\u00a018(4), 369\u2013394 (1971)","journal-title":"Information and Control"},{"issue":"3","key":"6_CR15","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1109\/TIT.1982.1056498","volume":"28","author":"J.S. Leon","year":"1982","unstructured":"Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Transactions on Information Theory\u00a028(3), 496\u2013510 (1982)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR16","unstructured":"Massey, J.L.: The discrete Fourier transform in coding and cryptography. In: IEEE Information Theory Workshop, ITW 1998, pp. 9\u201311 (1998)"},{"key":"6_CR17","unstructured":"Macwilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland Mathematical Library. North Holland (1983)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/3-540-19368-5_2","volume-title":"Coding Theory and Applications","author":"J.L. Massey","year":"1988","unstructured":"Massey, J.L., Schaub, T.: Linear Complexity in Coding Theory. In: Cohen, G., Godlewski, P. (eds.) Coding Theory 1986. LNCS, vol.\u00a0311, pp. 19\u201332. Springer, Heidelberg (1988)"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/TIT.1983.1056672","volume":"29","author":"C. Roos","year":"1983","unstructured":"Roos, C.: A new lower bound for the minimum distance of a cyclic code. IEEE Transactions on Information Theory\u00a029(3), 330\u2013332 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR20","unstructured":"Schaub, T.: A linear complexity approach to cyclic codes. PhD thesis, Swiss Federal Institute of Technology, Z\u00fcrich (1988); Diss. ETH No. 8730"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"1193","DOI":"10.1109\/18.850662","volume":"46","author":"N. Sendrier","year":"2000","unstructured":"Sendrier, N.: Finding the permutation between equivalent codes: the support splitting algorithm. IEEE Transactions on Information Theory\u00a046(4), 1193\u20131203 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"6_CR22","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1109\/18.532909","volume":"42","author":"M. Vlugt van Der","year":"1996","unstructured":"van Der Vlugt, M.: Non-BCH Triple-Error-Correcting codes. IEEE Transactions on Information Theory\u00a042(5), 1612\u20131614 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"6_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1986.1057134","volume":"32","author":"J.H. Lint van","year":"1986","unstructured":"van Lint, J.H., Wilson, R.M.: On the minimum distance of cyclic codes. IEEE Transactions on Information Theory\u00a032(1), 23\u201340 (1986)","journal-title":"IEEE Transactions on Information Theory"},{"key":"6_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0019846","volume-title":"Coding Theory and Applications","author":"J. Wolfmann","year":"1989","unstructured":"Wolfmann, J.: New bounds on cyclic codes from algebraic curves. In: Wolfmann, J., Cohen, G. (eds.) Coding Theory 1988. LNCS, vol.\u00a0388, pp. 47\u201362. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25516-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T08:40:26Z","timestamp":1561020026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25516-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255151","9783642255168"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25516-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}