{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T19:06:27Z","timestamp":1754161587507,"version":"3.41.2"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Designs, Codes and Cryptography"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1023\/a:1008206125050","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T08:47:34Z","timestamp":1040546854000},"page":"285-297","source":"Crossref","is-referenced-by-count":9,"title":["Bounds on Spectra of Codes with Known Dual Distance"],"prefix":"10.1007","volume":"13","author":[{"given":"Ilia","family":"Krasikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"150405_CR1","doi-asserted-by":"crossref","unstructured":"Th. Beth, H. Kalouti and D. E. Lazic, Which families of long binary linear codes have a binomial weight distribution? Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, G. Cohen, M. Giusti and T. Mora, Eds., Lecture Notes in Computer Science, v. 948, Springer, pp. 120-130.","DOI":"10.1007\/3-540-60114-7_9"},{"key":"150405_CR2","doi-asserted-by":"crossref","unstructured":"Th. Beth, D. E. Lazic and V. Senk, A family of binary codes with asymptotically good distance distribution, International Symposium on Coding Theory and Applications, Udine, Italy,Proceedings, Springer-Verlag, (1990).","DOI":"10.1007\/3-540-54303-1_115"},{"key":"150405_CR3","volume-title":"Linear Concatenated Codes","author":"E. L. Blokh","year":"1982","unstructured":"E. L. Blokh and V.V. Zyablov, Linear Concatenated CodesMoscow, Nauka, (In Russian) (1982)."},{"key":"150405_CR4","unstructured":"P. Delsarte, An algebraic approach to the association schemes of coding theory, Philips Research Reports Supplements, No. 10 (1973)."},{"issue":"4","key":"150405_CR5","first-page":"43","volume":"22","author":"I. Gashkov","year":"1986","unstructured":"I. Gashkov and V. Sidelnikov, Linear ternary quasiperfect codes correcting double errors, Probl. Peredachi Inform., Vol. 22, No.4 (1986) pp. 43-48.","journal-title":"Probl. Peredachi Inform."},{"issue":"6","key":"150405_CR6","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1109\/TIT.1985.1057107","volume":"31","author":"T. Kasami","year":"1985","unstructured":"T. Kasami, T. Fujiwara and S. Lin, An approximation to the weight distribution of binary linear codes, IEEE Trans. Inform. Theory, Vol. 31, No.6 (1985) pp. 769-780.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"3","key":"150405_CR7","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1109\/18.382026","volume":"41","author":"I. Krasikov","year":"1995","unstructured":"I. Krasikov and S. Litsyn, On spectra of BCH codes, IEEE Trans. Inform. Theory, Vol. 41, No.3 (1995) pp. 786-788.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"150405_CR8","doi-asserted-by":"publisher","first-page":"1472","DOI":"10.1109\/18.412690","volume":"41","author":"I. Krasikov","year":"1995","unstructured":"I. Krasikov and S. Litsyn, On the accuracy of the binomial approximation to the distance distribution of codes, IEEE Trans. Inform. Theory, Vol. 41, No.5 (1995) pp. 1472-1475.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"150405_CR9","first-page":"1303","volume":"41","author":"V. Levenshtein","year":"1995","unstructured":"V. Levenshtein, Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces, Vol. 41, No.5 (1995) pp. 1303-1321.","journal-title":"Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces"},{"key":"150405_CR10","doi-asserted-by":"crossref","unstructured":"J. H. van Lint, Introduction to Coding Theory, Springer-Verlag, (1992).","DOI":"10.1007\/978-3-662-00174-5"},{"key":"150405_CR11","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, New York: North-Holland, (1977)."},{"issue":"1","key":"150405_CR12","first-page":"14","volume":"7","author":"V. M. Sidelnikov","year":"1971","unstructured":"V. M. Sidelnikov, Weight spectrum of binary Bose-Chaudhuri-Hocquenghem codes, Probl. Peredachi Inform., Vol. 7, No.1 (1971) pp. 14-22.","journal-title":"Probl. Peredachi Inform."},{"issue":"1","key":"150405_CR13","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1109\/18.50398","volume":"36","author":"P. Sol\u00e9","year":"1990","unstructured":"P. Sol\u00e9, A limit law on the distance distribution of binary codes, IEEE Trans. Inform.Theory, Vol. 36, No.1 (1990) pp. 229-232.","journal-title":"IEEE Trans. Inform.Theory"},{"issue":"2","key":"150405_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01438280","volume":"5","author":"P. Sol\u00e9","year":"1994","unstructured":"P. Sol\u00e9, Weight distribution and dual distance, AAECC, vol. 5, No.2 (1994) pp. 117-122.","journal-title":"AAECC"},{"issue":"4","key":"150405_CR15","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 Ph.Stokes, Covering radius, codimension and dual distance width, IEEE Trans. Inform. Theory, Vol. 39, No.4 (1993) pp. 1195\u20131203.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"150405_CR16","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 the dual distance, IEEE Trans. Inform. Theory, Vol. 36, No.5 (1990) pp. 1472-1474.","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"1","key":"150405_CR17","doi-asserted-by":"publisher","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, Vol. 1, No.1 (1991) pp. 31-46.","journal-title":"Designs, Codes and Cryptography"},{"issue":"1","key":"150405_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1109\/18.108271","volume":"38","author":"H. N. Ward","year":"1992","unstructured":"H. N. Ward, A bound for divisible codes, IEEE Trans. Inform.Theory, Vol. 38, No.1 (1992) pp. 191-194.","journal-title":"IEEE Trans. Inform.Theory"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008206125050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008206125050\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008206125050.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,29]],"date-time":"2025-07-29T03:12:54Z","timestamp":1753758774000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008206125050"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["150405"],"URL":"https:\/\/doi.org\/10.1023\/a:1008206125050","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}