{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:49:16Z","timestamp":1764132556917},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,12,27]],"date-time":"2009-12-27T00:00:00Z","timestamp":1261872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10623-009-9356-1","type":"journal-article","created":{"date-parts":[[2009,12,26]],"date-time":"2009-12-26T07:55:53Z","timestamp":1261814153000},"page":"127-138","source":"Crossref","is-referenced-by-count":5,"title":["Weight distribution moments of random linear\/coset codes"],"prefix":"10.1007","volume":"57","author":[{"given":"Vladimir","family":"Blinovsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uri","family":"Erez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simon","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,27]]},"reference":[{"issue":"2","key":"9356_CR1","first-page":"50","volume":"23","author":"V. Blinovsky","year":"1987","unstructured":"Blinovsky V.: A lower bound on the number of words of a linear code in an arbitrary sphere with given radius in $${\\mathbb{F}^n_q}$$ . Problemy Peredachi Informatsii (Russian) 23(2), 50\u201353 (1987)","journal-title":"Problemy Peredachi Informatsii (Russian)"},{"key":"9356_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6193-4","volume-title":"Asymptotic Combinatorial Coding Theory","author":"V. Blinovsky","year":"1997","unstructured":"Blinovsky V.: Asymptotic Combinatorial Coding Theory. Kluwer, Boston (1997)"},{"issue":"3","key":"9356_CR3","first-page":"3","volume":"37","author":"V. Blinovsky","year":"2001","unstructured":"Blinovsky V.: A uniform estimate for the spectrum of a linear code. Problemy Peredachi Informatsii (Russian) 37(3), 3\u20135 (2001)","journal-title":"Problemy Peredachi Informatsii (Russian)"},{"key":"9356_CR4","volume-title":"Covering Codes","author":"G. Cohen","year":"1997","unstructured":"Cohen G., Honkala I., Litsyn S., Lobstein A.: Covering Codes. Elsevier, Amsterdam (1997)"},{"key":"9356_CR5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1137\/1108003","volume":"8","author":"R.L. Dobrushin","year":"1963","unstructured":"Dobrushin R.L.: Asymptotic optimality of group and systematic codes for some channels. Theory Probab. Appl. 8, 52\u201366 (1963)","journal-title":"Theory Probab. Appl."},{"key":"9356_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge, MA (1963)"},{"key":"9356_CR7","doi-asserted-by":"crossref","DOI":"10.1142\/6400","volume-title":"Codes for Error Detection","author":"T. Kl\u00f8ve","year":"2007","unstructured":"Kl\u00f8ve T.: Codes for Error Detection. World Scientific, Singapore (2007)"},{"key":"9356_CR8","doi-asserted-by":"crossref","unstructured":"Landau H.J.: Classical background on the moment problem. In: Landau H.J. (ed.) Moments in Mathematics. Proc. Sympos. Appl. Math., Amer. Math. Soc., Providence, RI. Series III, vol. 37, pp. 1\u201315 (1987).","DOI":"10.1090\/psapm\/037\/921082"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9356-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-009-9356-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-009-9356-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T19:58:27Z","timestamp":1559246307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-009-9356-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,27]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9356"],"URL":"https:\/\/doi.org\/10.1007\/s10623-009-9356-1","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,27]]}}}