{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T00:28:47Z","timestamp":1649118527444},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AAECC"],"published-print":{"date-parts":[[1997,1]]},"DOI":"10.1007\/s002000050052","type":"journal-article","created":{"date-parts":[[2002,8,25]],"date-time":"2002-08-25T07:30:30Z","timestamp":1030260630000},"page":"49-55","source":"Crossref","is-referenced-by-count":0,"title":["Long binary narrow-sense BCH codes are normal"],"prefix":"10.1007","volume":"8","author":[{"given":"Iiro","family":"Honkala","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yrj\u00f6","family":"Kaipainen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aimo","family":"Tiet\u00e4v\u00e4inen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60080049200_CR1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0097-3165(92)90041-R","volume":"A60","author":"A. R. Calderbank","year":"1992","unstructured":"Calderbank, A. R.: Covering bounds for codes. J. Comb. Theory A60 117\u2013122 (1992)","journal-title":"J. Comb. Theory"},{"key":"60080049200_CR2","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0012-365X(92)90536-O","volume":"106\/107","author":"A. R. Calderbank","year":"1992","unstructured":"Calderbank, A. R.: Covering machines. Discrete Mathematics 106\/107 105\u2013110 (1992)","journal-title":"Discrete Mathematics"},{"key":"60080049200_CR3","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1109\/TIT.1986.1057227","volume":"32","author":"G. D. Cohen","year":"1986","unstructured":"Cohen, G. D., Lobstein, A. C., Sloane, N. J. A.: Further results on the covering radius of codes. IEEE Trans. Inform. Theory 32, 680\u2013694 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"60080049200_CR4","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/BF02684373","volume":"43","author":"P. Deligne","year":"1974","unstructured":"Deligne, P.: La conjecture de Weil. I. Inst. Hautes Etudes Sc. Publ. Math. 43, 273\u2013307 (1974)","journal-title":"I. Inst. Hautes Etudes Sc. Publ. Math."},{"key":"60080049200_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"31","author":"R. L. Graham","year":"1985","unstructured":"Graham, R. L., Sloane, N. J. A.: On the covering radius of codes. IEEE Trans. Inform. Theory 31, 385\u2013401 (1985)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"60080049200_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/S0166-218X(85)80006-8","volume":"11","author":"T. Helleseth","year":"1985","unstructured":"Helleseth, T.: On the covering radius of cyclic linear codes and arithmetic codes. Discrete Appl. Math. 11, 157\u2013173 (1985)","journal-title":"Discrete Appl. Math."},{"key":"60080049200_CR7","volume-title":"Licentiate Thesis","author":"I. Honkala","year":"1987","unstructured":"Honkala, I.: Bounds for binary constant weight and covering codes. Licentiate Thesis, University of Turku, Finland, March 1987"},{"key":"60080049200_CR8","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1109\/18.2644","volume":"34","author":"I. S. Honkala","year":"1988","unstructured":"Honkala, I. S.: Lower bounds for binary covering codes. IEEE Trans. Inform. Theory 34, 326\u2013329 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"60080049200_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/18.75253","volume":"37","author":"I. S. Honkala","year":"1991","unstructured":"Honkala, I. S.: Modified bounds for covering codes. IEEE Trans. Inform. Theory 37, 351\u2013365 (1991)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"60080049200_CR10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0166-218X(94)90141-4","volume":"52","author":"I. Honkala","year":"1994","unstructured":"Honkala, I.: On (q, l)-subnormal q-ary covering codes. Discr. Appl. Math. 52, 213\u2013221 (1994)","journal-title":"Discr. Appl. Math."},{"key":"60080049200_CR11","unstructured":"Honkala, I., Tiet\u00e4v\u00e4inen, A.: Codes and number theory. In: Handbook of Coding Theory Brualdi, R., Huffman, C, Pless, V. (eds) in preparation"},{"key":"60080049200_CR12","unstructured":"Kaipainen, Y.: Chow variety. Licentiate Thesis, University of Turku, 1993 (in Finnish)"},{"key":"60080049200_CR13","doi-asserted-by":"crossref","first-page":"819","DOI":"10.2307\/2372655","volume":"76","author":"S. Lang","year":"1954","unstructured":"Lang, S., Weil, A.: Number of points of varieties in finite fields. Am. J. Math. 76, 819\u2013827 (1954)","journal-title":"Am. J. Math."},{"key":"60080049200_CR14","volume-title":"Finite fields. Reading","author":"R. Lidl","year":"1983","unstructured":"Lidl, R., Niederreiter, H.: Finite fields. Reading, MA: Addison Wesley 1983"},{"key":"60080049200_CR15","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. Amsterdam: North-Holland 1977"},{"key":"60080049200_CR16","unstructured":"Moreno, O., Moreno, C. J.: Constructive elementary approach to the covering radius of long BCH codes, Proceedings of 2nd International Workshop on Algebraic and Combinatorial Coding Theory, Leningrad, 1990, pp. 162\u2013165"},{"key":"60080049200_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0080437","volume-title":"Equations over Finite Fields: An Elementary Approach","author":"W. M. Schmidt","year":"1976","unstructured":"Schmidt, W. M.: Equations over Finite Fields: An Elementary Approach. Berlin, Heidelberg, New York Springer 1976"},{"key":"60080049200_CR18","first-page":"82","volume":"25","author":"I. E. Shparlinski","year":"1988","unstructured":"Shparlinski, I. E.: Addition to the Russian translation of the reference [6]. Kiberneticheskiy sbornik 25, 82\u201384 (1988)","journal-title":"Kiberneticheskiy sbornik"},{"key":"60080049200_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1806-4","volume-title":"Computational and algorithmic problems in finite fields","author":"I. E. Shparlinski","year":"1992","unstructured":"Shparlinski, I. E.: Computational and algorithmic problems in finite fields. Dordrecht Boston London: Kluwer Academic 1992"},{"key":"60080049200_CR20","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":"Tiet\u00e4v\u00e4inen, A.: On the covering radius of long binary BCH codes. Discrete Applied Math. 16, 75\u201377 (1987)","journal-title":"Discrete Applied Math."},{"key":"60080049200_CR21","doi-asserted-by":"crossref","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 radii of binary BCH codes. IEEE Trans. Inform. Theory 36, 211\u2013213 (1990)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"60080049200_CR22","first-page":"38","volume":"25","author":"S. G. Vladut","year":"1989","unstructured":"Vladut, S. G., Skorobogatov, A. N.: On the covering radius of long BCH codes. Probl. Peredach. Inform. 25, 38\u201345 (1989) (in Russian).","journal-title":"Probl. Peredach. Inform."},{"key":"60080049200_CR23","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1073\/pnas.34.5.204","volume":"34","author":"A. Weil","year":"1948","unstructured":"Weil, A.: On some exponential sums. Proc. Natl. Ac. Sci. 34, 204\u2013207 (1948)","journal-title":"Proc. Natl. Ac. Sci."}],"container-title":["Applicable Algebra in Engineering, Communication and Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002000050052.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s002000050052\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s002000050052","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T15:24:27Z","timestamp":1558625067000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s002000050052"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["60080049200"],"URL":"https:\/\/doi.org\/10.1007\/s002000050052","relation":{},"ISSN":["0938-1279","1432-0622"],"issn-type":[{"value":"0938-1279","type":"print"},{"value":"1432-0622","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}