{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:25Z","timestamp":1725663865970},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540578437"},{"type":"electronic","value":"9783540483571"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-57843-9_8","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T08:29:38Z","timestamp":1330244978000},"page":"56-62","source":"Crossref","is-referenced-by-count":2,"title":["On the covering radius of convolutional codes"],"prefix":"10.1007","author":[{"given":"Irina. E.","family":"Bocharova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boris. D.","family":"Kudryashov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1109\/TIT.1985.1057039","volume":"IT-31","author":"R. L. Graham","year":"1985","unstructured":"R.L. Graham, N.J. Sloane, \u201cOn the covering radius of codes,\u201d IEEE Trans. Inform. Theory, vol. IT-31, pp. 385\u2013401, 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/S0019-9958(74)90870-5","volume":"25","author":"G. D. Forney","year":"1974","unstructured":"G.D. Forney, \u201cConvolutional codes, II Maximum likelihood decoding,\u201d Inform, and Control, vol. 25, pp. 222\u2013266, 1974.","journal-title":"Inform, and Control"},{"key":"8_CR3","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1109\/TIT.1983.1056678","volume":"IT-29","author":"G. D. Cohen","year":"1983","unstructured":"G.D. Cohen, \u201cA nonconstructive upper bound on covering radius'\u201d IEEE Trans. Inform. Theory, vol. IT-29, pp. 352\u2013353, 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR4","unstructured":"A.R. Calderbank and P.C. Fishbum, A. Rabinovich, \u201cCovering properties of convolutional codes and associated lattices\u201d, submitted to IEEE Trans. Inform. Theory, May 1992."},{"key":"8_CR5","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","volume":"IT-24","author":"J. K. Wolf","year":"1978","unstructured":"J.K. Wolf, \u201cEfficient maximum likelihood decoding of linear block codes using a trellis,\u201d IEEE Trans. Inform. Theory, vol. IT-24, pp. 76\u201380, 1978.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"8_CR6","volume-title":"The theory of error-correcting codes","author":"F. J. MakWilliams","year":"1977","unstructured":"F.J. MakWilliams and N.J.A. Sloane, The theory of error-correcting codes. New York: North-Holland, 1977."}],"container-title":["Lecture Notes in Computer Science","Algebraic Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57843-9_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:08:49Z","timestamp":1619557729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57843-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540578437","9783540483571"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-57843-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}