{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:44:58Z","timestamp":1720640698695},"reference-count":21,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s1571-0653(04)00152-0","type":"journal-article","created":{"date-parts":[[2005,4,9]],"date-time":"2005-04-09T13:34:04Z","timestamp":1113053644000},"page":"4-14","source":"Crossref","is-referenced-by-count":2,"special_numbering":"C","title":["Estimates of the Distance Distribution of Codes and Designs"],"prefix":"10.1016","volume":"6","author":[{"given":"A.","family":"Ashikhmin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Barg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB1","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/18.748994","article-title":"Binomial moments of the distance distribution: Bounds and applications","volume":"45","author":"Ashikhmin","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 4","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB2","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/18.761280","article-title":"New bounds on generalized weights","volume":"45","author":"Ashikhmin","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB3","series-title":"Codes and Association Schemes","article-title":"Estimates of the distance distribution of nonbinary codes, with applications","author":"Ashikhmin","year":"2001"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB4","first-page":"1","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"Delsarte","year":"1973","journal-title":"Philips Research Repts Suppl"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB5","doi-asserted-by":"crossref","first-page":"769","DOI":"10.1109\/TIT.1985.1057107","article-title":"An approximation to the weight distribution of binary linear codes","volume":"31","author":"Kasami","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 4","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB6","first-page":"19","article-title":"Spectra of algebraic-geometric codes","volume":"23","author":"Katsman","year":"1987","journal-title":"Problemy Peredachi Informatsii"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB7","series-title":"Coding theory and algebraic geometry (Luminy, 1991)","first-page":"82","article-title":"Spectra of linear codes and error probability of decoding","author":"Katsman","year":"1992"},{"issue":"no. 1","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB8","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1109\/18.746800","article-title":"More on the distance distribution of BCH codes","volume":"45","author":"Keren","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 5","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB9","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1109\/18.412690","article-title":"On the accuracy of the binomial approximation to the distance distribution of codes","volume":"41","author":"Krasikov","year":"1995","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 3","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB10","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1109\/18.568707","article-title":"Estimates for the range of binomiality in codes' spectra","volume":"43","author":"Krasikov","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 4","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB11","doi-asserted-by":"crossref","first-page":"1238","DOI":"10.1109\/18.605587","article-title":"Linear programming bounds for doubly-even self-dual codes","volume":"43","author":"Krasikov","year":"1997","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 3","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB12","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1008206125050","article-title":"Bounds on spectra of codes with known dual distance","volume":"13","author":"Krasikov","year":"1998","journal-title":"Des. Codes Cryptogr"},{"issue":"no. 4","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB13_1","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0019-9958(75)90300-9","article-title":"On the minimal redundancy of binary error-correcting codes","volume":"28","author":"Levenshtein","year":"1975","journal-title":"Information and Control"},{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB13_2","first-page":"26","volume":"10","author":"Odlyzko","year":"1974","journal-title":"Problemy Pereda\u010di Informacii"},{"issue":"no. 40","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB14","first-page":"43","article-title":"Bounds for packings of metric spaces and some of their applications","author":"Levenshtein","year":"1983","journal-title":"Problemy Kibernet"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB15","first-page":"463","article-title":"An updated table of the best binary codes known","volume":"vol. 1","author":"Litsyn","year":"1998"},{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/18.748991","article-title":"New upper bounds on error exponents","volume":"45","author":"Litsyn","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"no. 2","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB17","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1109\/TIT.1977.1055688","article-title":"New upper bound on the rate of a code via the Delsarte-Mac Williams inequalities","volume":"23","author":"McEliece","year":"1977","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB18","unstructured":"A. Samorodnitsky, On the optimum of Delsarte's linear program, (1998), preprint."},{"issue":"no. 1","key":"10.1016\/S1571-0653(04)00152-0_NEWBIB19","first-page":"14","article-title":"The spectrum of weights of binary Bose-Chaudhuri-Hocquenghem codes","volume":"7","author":"Sidelnikov","year":"1971","journal-title":"Problemy Pereda\u010di Informacii"},{"key":"10.1016\/S1571-0653(04)00152-0_NEWBIB20","doi-asserted-by":"crossref","unstructured":"J.-P. Tillich, and G. Z\u00e9mor, Discrete isoperimetric inequalities and the probability of decoding error, Combinatorics, Probability and Computing, to appear.","DOI":"10.1017\/S0963548300004466"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001520?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065304001520?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,10]],"date-time":"2019-02-10T15:41:53Z","timestamp":1549813313000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065304001520"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":21,"alternative-id":["S1571065304001520"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(04)00152-0","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}