{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:09Z","timestamp":1725664149509},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540582656"},{"type":"electronic","value":"9783540485889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58265-7_13","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T15:41:04Z","timestamp":1330270864000},"page":"97-102","source":"Crossref","is-referenced-by-count":1,"title":["Tables of coverings for decoding by S-sets"],"prefix":"10.1007","author":[{"given":"I. L.","family":"Asnis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. V.","family":"Fedorenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. A.","family":"Krouk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"E. T.","family":"Mironchikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"13_CR1","unstructured":"Krouk E.A., Mironchikov E.T., Fedorenko S.V. \u201cDecoding by S-sets.\u201d In: Fifth Joint Soviet-Swedish International Workshop on Information Theory \u201dConvolutional Codes; Multi-User Communication\u201d, Moscow, 1990, pp.113\u2013115."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TIT.1973.1055009","volume":"IT-19","author":"H.J. Helgert","year":"1973","unstructured":"Helgert H.J., Stinaff R.D. \u201cMinimum-distance bounds for binary linear codes\u201d, IEEE Trans. Info. Theory, vol. IT-19, pp.344\u2013356, 1973.","journal-title":"IEEE Trans. Info. Theory"},{"key":"13_CR3","volume-title":"Probabilistic methods in combinatorics","author":"P. Erd\u00f6s","year":"1974","unstructured":"Erd\u00f6s P., Spencer J. Probabilistic methods in combinatorics. Akad. Kiado, Budapest, 1974."},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Asnis I.L., Fedorenko S.V. \u201cTables of coverings for decoding by S-sets.\u201d In: The Workshop on Information Protection, Moscow, 1993, p.22.","DOI":"10.1007\/3-540-58265-7_13"},{"issue":"No.3","key":"13_CR5","first-page":"103","volume":"25","author":"E.A. Krouk","year":"1989","unstructured":"Krouk E.A. \u201cA bound on the decoding complexity of linear block codes.\u201d Problemy Peredachi Informatsii, 1989, vol.25, No.3, pp.103\u2013107. (in Russian).","journal-title":"Problemy Peredachi Informatsii"},{"key":"13_CR6","unstructured":"Dumer I.I. Private communication, 1986."},{"key":"13_CR7","unstructured":"Dumer I.I. \u201cOn minimum distance decoding of linear codes.\u201d In: Fifth Joint Soviet-Swedish International Workshop on Information Theory \u201dConvolutional Codes; Multi-User Communication\u201d, Moscow, 1990, pp.50\u201352."}],"container-title":["Lecture Notes in Computer Science","Error Control, Cryptology, and Speech Compression"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58265-7_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T06:39:47Z","timestamp":1640932787000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58265-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582656","9783540485889"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-58265-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}