{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:55Z","timestamp":1725664255344},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601142"},{"type":"electronic","value":"9783540494409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60114-7_3","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:43:12Z","timestamp":1330278192000},"page":"21-32","source":"Crossref","is-referenced-by-count":3,"title":["On algebraic methods in covering radius problems"],"prefix":"10.1007","author":[{"given":"I.","family":"Honkala","sequence":"first","affiliation":[]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[]},{"given":"A.","family":"Tiet\u00e4v\u00e4inen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/TIT.1976.1055556","volume":"22","author":"E. F. Assmus Jr.","year":"1976","unstructured":"E. F. Assmus, Jr. and H. F. Mattson, Jr., \u201dSome 3-error-correcting BCH codes have covering radius 5,\u201d IEEE Trans. Inform. Theory\n22 (1976), 348\u2013349.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR2","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1215\/S0012-7094-57-02406-7","volume":"24","author":"L. Carlitz","year":"1957","unstructured":"L. Carlitz and S. Uchiyama, \u201dBounds for exponential sums,\u201d-Duke Math. J.\n24 (1957) 37\u201341.","journal-title":"Duke Math. J."},{"key":"3_CR3","unstructured":"S. D. Cohen, \u201dThe length of primitive BCH codes with minimal covering radius,\u201d preprint."},{"key":"3_CR4","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0195-6698(13)80076-5","volume":"12","author":"C. Delorme","year":"1991","unstructured":"C. Delorme and P. Sol\u00e9, Diameter, covering index, covering radius and eigenvalues, Europ. J. Combin.\n12 (1991), 95\u2013108.","journal-title":"Europ. J. Combin."},{"key":"3_CR5","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/S0019-9958(73)80007-5","volume":"23","author":"P. Delsarte","year":"1973","unstructured":"P. Delsarte, Four fundamental parameters of a code and their combinatorial significance, Information and Control\n23 (1973), 407\u2013438.","journal-title":"Information and Control"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1016\/S0019-9958(60)90877-9","volume":"3","author":"D. C. Gorenstein","year":"1960","unstructured":"D. C. Gorenstein, W. W. Peterson and N. Zierler, \u201dTwo-error correcting Bose-Chaudhury codes are quasi-perfect,\u201d Inform. and Control\n3 (1960), 291\u2013294","journal-title":"Inform. and Control"},{"key":"3_CR7","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/TIT.1978.1055847","volume":"24","author":"T. Helleseth","year":"1978","unstructured":"T. Helleseth, \u201dAll binary 3-error-correcting BCH codes of length 2m \u2014 1 have covering radius 5,\u201d IEEE Trans. Inform. Theory\n24 (1978), 257\u2013258.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR8","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(85)80006-8","volume":"11","author":"T. Helleseth","year":"1985","unstructured":"T. Helleseth, On the covering radius of cyclic linear codes and aritheoremetic codes, Discrete Appl. Math.\n11 (1985), 157\u2013173.","journal-title":"Discrete Appl. Math."},{"key":"3_CR9","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1109\/TIT.1978.1055928","volume":"24","author":"T. Helleseth","year":"1978","unstructured":"T. Helleseth, T. Kl\u00f8ve and J. Mykkeltveit, On the covering radius of binary codes, IEEE Trans. Information Theory\n24 (1978), 627\u2013628.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR10","unstructured":"I. Honkala, Y. Kaipainen and A. Tiet\u00e4v\u00e4inen, \u201dLong binary narrow-sense BCH codes are normal,\u201d preprint."},{"key":"3_CR11","unstructured":"I. Honkala and A. Tiet\u00e4v\u00e4inen, \u201dCodes and number theory,\u201d in: Handbook of Coding Theory, Eds. R. A. Brualdi, W. C. Huffman, and V. S. Pless, to appear."},{"key":"3_CR12","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1109\/TIT.1976.1055530","volume":"22","author":"J. A. Horst van der","year":"1976","unstructured":"J. A. van der Horst and T. Berger, \u201dComplete decoding of triple-error-correcting binary BCH codes,\u201d IEEE Trans. Inform. Theory\n22 (1976), 138\u2013147.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR13","unstructured":"Y. Kaipainen, \u201dChow variety,\u201d Licentiate Thesis, University of Turku, 1993 (in Finnish)."},{"key":"3_CR14","doi-asserted-by":"crossref","first-page":"819","DOI":"10.2307\/2372655","volume":"76","author":"S. Lang","year":"1954","unstructured":"S. Lang and A. Weil, \u201dNumber of points of varieties in finite fields,\u201d Amer. J. Math.\n76 (1954), 819\u2013827.","journal-title":"Amer. J. Math."},{"key":"3_CR15","unstructured":"F. Levy-dit-Vehel and S. Litsyn, \u201dMore on the covering radius of BCH codes,\u201d preprint."},{"key":"3_CR16","volume-title":"Finite Fields","author":"R. Lidl","year":"1983","unstructured":"R. Lidl and H. Niederreiter, Finite Fields. Reading, MA: Addison Wesley, 1983."},{"key":"3_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07998-0","volume-title":"Introduction to Coding Theory","author":"J. H. Lint van","year":"1982","unstructured":"J. H. van Lint, Introduction to Coding Theory. New York-Heidelberg-Berlin: Springer, 1982."},{"key":"3_CR18","unstructured":"S. Litsyn and A. Tiet\u00e4v\u00e4inen, Upper bounds on the covering radius of a code with a given dual distance, Europ. J. Comb., to appear."},{"key":"3_CR19","volume-title":"The Theory of Error-Correcting Codes","author":"F. J. MacWilliams","year":"1977","unstructured":"F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. Amsterdam: North-Holland 1977."},{"key":"3_CR20","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","volume":"23","author":"R. J. McEliece","year":"1977","unstructured":"R. J. McEliece, E. R. Rodemich, H. C. Rumsey, Jr. and L. R. Welch, New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities, IEEE Trans. Information Theory\n23 (1977), 157\u2013166.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR21","unstructured":"O. Moreno and C. J. Moreno, \u201dConstructive elementary approach to the covering radius of long BCH codes,\u201d preprint."},{"key":"3_CR22","unstructured":"O. Moreno and C. J. Moreno, \u201dThe MacWilliams-Sloane conjecture on the tightness of the Carlitz-Uchiyama bound and the weights of duals of BCH codes,\u201d IEEE Trans. Inform. Theory, to appear."},{"key":"3_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0080437","volume-title":"Equations over Finite Fields: An Elementary Approach","author":"W. M. Schmidt","year":"1976","unstructured":"W. M. Schmidt, Equations over Finite Fields: An Elementary Approach. Berlin: Springer, 1976."},{"key":"3_CR24","first-page":"82","volume":"25","author":"I. E. Shparlinski","year":"1985","unstructured":"I. E. Shparlinski, Addition to the Russian translation of [8], Kiberneticheskiy sbornik\n25 (1985), 82\u201384 (in Russian).","journal-title":"Kiberneticheskiy sbornik"},{"key":"3_CR25","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.59948","volume":"36","author":"P. Sol\u00e9","year":"1990","unstructured":"P. Sol\u00e9, Asymptotic bounds on the covering radius of binary codes, IEEE Trans. Information Theory\n36 (1990), 1470\u20131472.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR26","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1109\/18.61138","volume":"37","author":"P. Sol\u00e9","year":"1991","unstructured":"P. Sol\u00e9 and K. G. Mehrotra, Generalization of the Norse bounds to codes of higher strength, IEEE Trans. Information Theory\n37 (1991), 190\u2013192.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR27","doi-asserted-by":"crossref","first-page":"1195","DOI":"10.1109\/18.243438","volume":"39","author":"P. Sol\u00e9","year":"1993","unstructured":"P. Sol\u00e9 and P. Stokes, Covering radius, codimension, and dual-distance width, IEEE Trans. Information Theory\n39 (1993), 1195\u20131203.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR28","unstructured":"G. Szeg\u00f6, Orthogonal Polynomials, Amer. Math. Soc. Colloq. Publ., v. 23, Providence, RI, 1975."},{"key":"3_CR29","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0166-218X(87)90055-2","volume":"16","author":"A. Tiet\u00e4v\u00e4inen","year":"1987","unstructured":"A. Tiet\u00e4v\u00e4inen, \u201dOn the covering radius of long binary BCH codes,\u201d Discrete Appl. Math.\n16 (1987), 75\u201377.","journal-title":"Discrete Appl. Math."},{"key":"3_CR30","first-page":"190","volume-title":"Lecture Notes in Mathematics 1352","author":"A. Tiet\u00e4v\u00e4inen","year":"1988","unstructured":"A. Tiet\u00e4v\u00e4inen, \u201dIncomplete sums and two applications of Deligne's result,\u201d Lecture Notes in Mathematics\n1352, Berlin: Springer, (1988), 190\u2013205."},{"key":"3_CR31","first-page":"3","volume":"388","author":"A. Tiet\u00e4v\u00e4inen","year":"1989","unstructured":"A. Tiet\u00e4v\u00e4inen, Codes and character sums, Springer Lecture Notes in Computer Science\n388 (1989), 3\u201312.","journal-title":"Springer Lecture Notes in Computer Science"},{"key":"3_CR32","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/18.50395","volume":"36","author":"A. Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"A. Tiet\u00e4v\u00e4inen, \u201dAn asymptotic bound on the covering radii of binary BCH codes,\u201d IEEE Trans. Inform. Theory\n36 (1990), 211\u2013213.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3_CR33","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/18.59949","volume":"36","author":"A. Tiet\u00e4v\u00e4inen","year":"1990","unstructured":"A. Tiet\u00e4v\u00e4inen, An upper bound on the covering radius as a function of its dual distance, IEEE Trans. Information Theory\n36 (1990), 1472\u20131474.","journal-title":"IEEE Trans. Information Theory"},{"key":"3_CR34","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00123957","volume":"1","author":"A. Tiet\u00e4v\u00e4inen","year":"1991","unstructured":"A. Tiet\u00e4v\u00e4inen, Covering radius and dual distance, Designs, Codes and Cryptography\n1 (1991), 31\u201346.","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"3_CR35","first-page":"38","volume":"25","author":"S. G. Vladutt","year":"1989","unstructured":"S. G. Vladutt and A. N. Skorobogatov, \u201dOn the covering radius of long BCH codes,\u201d Problemy Peredachi Informacii\n25 (1) (1989), 38\u201345 (in Russian). Translated in Problems of Inform. Transmission\n25 (1) (1989), 28\u201334.","journal-title":"Problemy Peredachi Informacii"},{"key":"3_CR36","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1073\/pnas.34.5.204","volume":"34","author":"A. Weil","year":"1948","unstructured":"A. Weil, \u201dOn some exponential sums,\u201d Proc. Nat. Ac. Sc.\n34 (1948), 204\u2013207.","journal-title":"Proc. Nat. Ac. Sc."}],"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\/3-540-60114-7_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:49Z","timestamp":1619573509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60114-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601142","9783540494409"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-60114-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}