{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:58:41Z","timestamp":1725551921797},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540314233"},{"type":"electronic","value":"9783540314240"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11617983_28","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T12:27:38Z","timestamp":1137068858000},"page":"285-294","source":"Crossref","is-referenced-by-count":3,"title":["Long Extended BCH Codes Are Spanned by Minimum Weight Words"],"prefix":"10.1007","author":[{"given":"Tali","family":"Kaufman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"28_CR1","doi-asserted-by":"publisher","first-page":"960","DOI":"10.1109\/18.135638","volume":"38","author":"D. Augot","year":"1992","unstructured":"Augot, D., Charpin, P., Sendrier, N.: Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inform. Theory\u00a038(3), 960\u2013973 (1992)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR2","volume-title":"Algebraic Coding Theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)"},{"issue":"4","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1109\/18.508858","volume":"42","author":"G. Cohen","year":"1996","unstructured":"Cohen, G., Litsyn, S., Z\u00e9mor, G.: On the traveling salesman problem in binary Hamming spaces. IEEE Trans. Inform. Theory\u00a042(4), 1274\u20131276 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR4","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)"},{"issue":"1","key":"28_CR5","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1008299101833","volume":"10","author":"S.D. Cohen","year":"1997","unstructured":"Cohen, S.D.: The length of primitive BCH codes with minimal covering radius. Designs, Codes, and Cryptography\u00a010(1), 5\u201316 (1997)","journal-title":"Designs, Codes, and Cryptography"},{"key":"28_CR6","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/S0019-9958(70)90214-7","volume":"16","author":"P. Delsarte","year":"1970","unstructured":"Delsarte, P., Goethals, J.M., MacWilliams, F.J.: On generalized Reed-Muller codes and their relatives. Inform. and Control\u00a016, 403\u2013442 (1970)","journal-title":"Inform. and Control"},{"issue":"4","key":"28_CR7","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1109\/18.605611","volume":"43","author":"Y. Desaki","year":"1997","unstructured":"Desaki, Y., Fujiwara, T., Kasami, T.: The weight distributions of extended binary primitive BCH codes of length 128. IEEE Trans. Inform. Theory\u00a043(4), 1364\u20131371 (1997)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"28_CR8","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1109\/18.868484","volume":"46","author":"P. Ding","year":"2000","unstructured":"Ding, P., Key, J.D.: Minimum-weight codewords as generators of generalized Reed-Muller codes. IEEE Trans. Inform. Theory\u00a046(6), 2152\u20132158 (2000)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1\u20133","key":"28_CR9","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0012-365X(92)90702-H","volume":"110","author":"J. Francke","year":"1992","unstructured":"Francke, J., Meijers, J.J.H.: Super-visible codes. Discrete Math.\u00a0110(1\u20133), 119\u2013134 (1992)","journal-title":"Discrete Math."},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/ffta.1997.0192","volume":"4","author":"S. Gao","year":"1998","unstructured":"Gao, S., Key, J.D.: Bases of minimum-weight vectors for codes from designs. Finite Fields Appl.\u00a04(1), 1\u201315 (1998)","journal-title":"Finite Fields Appl."},{"key":"28_CR11","first-page":"195","volume":"154","author":"J.N. Gutie\u2019rrez","year":"2002","unstructured":"Gutie\u2019rrez, J.N., Tapia-Recillas, H.: A minimum weight basis for the binary Reed-Muller code. Congr. Numer.\u00a0154, 195\u2013199 (2002)","journal-title":"Congr. Numer."},{"key":"28_CR12","unstructured":"Handbook of Coding Theory. North Holland, Amsterdam (1997)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields, in book. In: Proc. IEEE Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.64"},{"issue":"6","key":"28_CR14","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TIT.1985.1057107","volume":"31","author":"T. Kasami","year":"1985","unstructured":"Kasami, T., Fujiwara, T., Lin, S.: An approximation to the weight distribution of binary linear codes. IEEE Trans. Inform. Theory\u00a031(6), 769\u2013780 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Kaufman, T., Ron, D.: Testing polynomials over general fields, in book. In: Proc. IEEE Symposium on Foundations of Computer Science (2004)","DOI":"10.1109\/FOCS.2004.65"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/18.746800","volume":"45","author":"O. Keren","year":"1999","unstructured":"Keren, O., Litsyn, S.: More on the distance distribution of BCH codes. IEEE Trans. Inform. Theory\u00a045(1), 251\u2013255 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"28_CR17","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/18.749023","volume":"45","author":"T. Koumoto","year":"1999","unstructured":"Koumoto, T., Takata, T., Kasami, T., Lin, S.: A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes. IEEE Trans. Inform. Theory\u00a045(2), 731\u2013741 (1999)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"28_CR18","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.382026","volume":"41","author":"I. Krasikov","year":"1995","unstructured":"Krasikov, I., Litsyn, S.: On spectra of BCH codes. IEEE Trans. Inform. Theory\u00a041(3), 786\u2013788 (1995)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"28_CR19","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1006\/eujc.1996.0129","volume":"18","author":"I. Krasikov","year":"1997","unstructured":"Krasikov, I., Litsyn, S.: Linear programming bounds for codes of small size. European J. Combin.\u00a018(6), 647\u2013654 (1997)","journal-title":"European J. Combin."},{"issue":"2","key":"28_CR20","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/A:1011220817609","volume":"23","author":"I. Krasikov","year":"2001","unstructured":"Krasikov, I., Litsyn, S.: On the distance distributions of BCH codes and their duals. Des. Codes Cryptogr.\u00a023(2), 223\u2013231 (2001)","journal-title":"Des. Codes Cryptogr."},{"key":"28_CR21","doi-asserted-by":"crossref","unstructured":"Krasikov, I., Litsyn, S.: Survey of binary Krawtchouk polynomials. In: Codes and Association Schemes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a056, pp. 199\u2013211 (2001)","DOI":"10.1090\/dimacs\/056\/16"},{"key":"28_CR22","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1109\/18.490570","volume":"42","author":"F. Levy-dit-Vehel","year":"1996","unstructured":"Levy-dit-Vehel, F., Litsyn, S.: More on the covering radius of BCH codes. IEEE Trans. Inform. Theory\u00a042, 1023\u20131028 (1996)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"28_CR23","volume-title":"The Theory of Error Correcting Codes","author":"F.J. MacWilliams","year":"1977","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)"},{"key":"28_CR24","volume-title":"Inequalities: Theory of Majorization and its Applications","author":"A.W. Marshall","year":"1979","unstructured":"Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and its Applications. Academic Press, New York (1979)"},{"key":"28_CR25","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1090\/S0002-9904-1969-12135-X","volume":"75","author":"R.J. McEliece","year":"1969","unstructured":"McEliece, R.J., Rumsey Jr., H.: Sphere-packing in the Hamming metric. Bull. Amer. Math. Soc.\u00a075, 32\u201334 (1969)","journal-title":"Bull. Amer. Math. Soc."},{"issue":"1","key":"28_CR26","first-page":"14","volume":"7","author":"V.M. Sidel\u2019nikov","year":"1971","unstructured":"Sidel\u2019nikov, V.M.: The spectrum of weights of binary Bose-Chaudhuri-Hocquenghem codes. Problemy Peredachi Informatsii\u00a07(1), 14\u201322 (1971)","journal-title":"Problemy Peredachi Informatsii"},{"issue":"1","key":"28_CR27","first-page":"38","volume":"25","author":"A.N. Skorobogatov","year":"1989","unstructured":"Skorobogatov, A.N., Vladuts, S.G.: The covering radius of long binary BCH codes. Problemy Peredachi Informatsii\u00a025(1), 38\u201345 (1989)","journal-title":"Problemy Peredachi Informatsii"},{"key":"28_CR28","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1109\/18.50398","volume":"36","author":"P. Sol\u00e9","year":"1990","unstructured":"Sol\u00e9, P.: A limit law on the distance distribution of binary codes. IEEE Trans. Inform. Theory\u00a036, 229\u2013232 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"28_CR29","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0019-9958(80)90709-3","volume":"47","author":"A. Tiet\u00e4v\u00e4inen","year":"1980","unstructured":"Tiet\u00e4v\u00e4inen, A.: Bounds for binary codes just outside the Plotkin range. Inform. and Control\u00a047(2), 85\u201393 (1980)","journal-title":"Inform. and Control"},{"key":"28_CR30","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0166-218X(87)90055-2","volume":"16","author":"A. Tiet\u00e4v\u00e4inen","year":"1987","unstructured":"Tiet\u00e4v\u00e4inen, A.: On the covering radius of long binary BCH codes. Discr. App. Math.\u00a016, 75\u201377 (1987)","journal-title":"Discr. App. Math."},{"key":"28_CR31","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1109\/18.50395","volume":"36","author":"A. Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"Tiet\u00e4v\u00e4inen, A.: An asymptotic bound on the covering radius of binary BCH codes. IEEE Trans. Inform. Theory\u00a036, 211\u2013213 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"28_CR32","first-page":"24","volume":"27","author":"S. Vladuts","year":"1991","unstructured":"Vladuts, S., Skorobogatov, A.: On spectra of subcodes over subfields of algebraic-geometric codes. Probl. Peredachi Inform.\u00a027(1), 24\u201336 (1991)","journal-title":"Probl. Peredachi Inform."},{"issue":"6","key":"28_CR33","doi-asserted-by":"publisher","first-page":"1988","DOI":"10.1109\/18.265509","volume":"39","author":"A.J. Zanten van","year":"1993","unstructured":"van Zanten, A.J.: Minimal-change order and separability in linear codes. IEEE Trans. Inform. Theory\u00a039(6), 1988\u20131989 (1993)","journal-title":"IEEE Trans. Inform. Theory"}],"container-title":["Lecture Notes in Computer Science","Applied Algebra, Algebraic Algorithms and Error-Correcting Codes"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11617983_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:11:53Z","timestamp":1619507513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11617983_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540314233","9783540314240"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11617983_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}