{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:29Z","timestamp":1725459089172},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540516433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019851","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T11:48:27Z","timestamp":1137066507000},"page":"114-122","source":"Crossref","is-referenced-by-count":0,"title":["Generating codewords in real space: Application to decoding"],"prefix":"10.1007","author":[{"given":"G. D.","family":"Cohen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. J.","family":"Godlewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T. Y.","family":"Hwang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0012-365X(76)90025-X","volume":"15","author":"R.D. Baker","year":"1976","unstructured":"R.D. BAKER, \"Partitioning the planes of AG2m (2) into 2-designs\", Discrete Math. 15 (1976) 205\u2013211.","journal-title":"Discrete Math."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"G. BATTAIL, M. DECOUVELAERE and P. GODLEWSKI, \"Replication decoding\". IEEE Trans. Inform. Theory, pp.332\u2013345, May 1979.","DOI":"10.1109\/TIT.1979.1056035"},{"issue":"34","key":"10_CR3","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"IT-24","author":"E.R. Berlekamp","year":"1978","unstructured":"E.R. BERLEKAMP, R.J. McELIECE and H.C.A. Van TILBORG\", On the inherent intractability of certain coding problems\", IEE Trans. on Inform. Theory, vol. IT-24, no34, pp.384\u2013386 May 1978.","journal-title":"IEE Trans. on Inform. Theory"},{"key":"10_CR4","unstructured":"J. BRUCK and M. NAOR, \"The Hardness of decoding linear codes with preprocessing\" RJ 6504 (63305) Oct. 1988."},{"key":"10_CR5","first-page":"170","volume":"IT-18","author":"D. Chase","year":"1982","unstructured":"D. CHASE, \"A class of algorithms for decoding block codes with channel measurement information\", IEEE Trans. Inform. Theory, Vol. IT-18, pp.170\u2013182, Jan. 1982.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"P.J. CAMERON and J.H. VAN LINT, \"Graph theory, coding theory and block designs\", London Math. Soc. Lecture Notes Series 19, Cambridge Univ. Press 1975.","DOI":"10.1017\/CBO9781107325425"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0012-365X(85)90190-6","volume":"56","author":"G. Cohen","year":"1985","unstructured":"G. COHEN and A. LEMPEL, \"Linear intersecting codes\", Discrete Math. 56 (1985) 35\u201343.","journal-title":"Discrete Math."},{"issue":"3","key":"10_CR8","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TIT.1983.1056678","volume":"IT-29","author":"G. Cohen","year":"1983","unstructured":"G. COHEN, \"A nonconstructive upperbound on the covering radius\", IEEE Trans. Inform. Theory, Vol. IT-29, no3, pp.352\u2013353, May 1983.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/3-540-19368-5_15","volume":"311","author":"J. Fang","year":"1988","unstructured":"J. FANG, G. COHEN, P. GODLEWSKI and G. BATTAIL, \"On the inherent intractability of soft decision decoding of linear codes\", Lectures Notes in Computer Science 311; pp. 141\u2013149, 1988.","journal-title":"Lectures Notes in Computer Science"},{"key":"10_CR10","unstructured":"P. GODLEWSKI, \"Sur le plus petit r\u00e9seau contenant un code binaire\", pr\u00e9print."},{"issue":"6","key":"10_CR11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/TIT.1979.1056120","volume":"IT-25","author":"T.Y. Hwang","year":"1979","unstructured":"T.Y. HWANG, \"Decoding linear block codes for minimizing word error rate\", IEEE Trans.Inform. Theory, Vol. IT-25, no6 pp.733\u2013737, Nov. 1979.","journal-title":"IEEE Trans.Inform. Theory"},{"issue":"5","key":"10_CR12","doi-asserted-by":"crossref","first-page":"603","DOI":"10.1109\/TIT.1980.1056238","volume":"IT-26","author":"T.Y. Hwang","year":"1980","unstructured":"T.Y. HWANG, \"Efficient Optimal decoding of linear block codes\", IEEE Trans. Inform. Theory, Vol. IT-26, no5, pp. 603\u2013606, sept. 1980.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR13","unstructured":"T.Y. HWANG, \"Soft-decision decoding over the real space\", preprint, May 1988."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1109\/TIT.1985.1057038","volume":"IT-31","author":"L.B. Levitin","year":"1985","unstructured":"L.B. LEVITIN and C.R.P. HARTMANN, \"A new approach to the general minimum distance decoding problem\", IEEE Trans. Inform. Theory, Vol. IT-31, pp. 378\u2013384, May 1985.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR15","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\", North-Holland, New York, 1977."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0166-218X(84)90018-0","volume":"9","author":"D. Miklos","year":"1984","unstructured":"D. MIKLOS, \"Linear binary codes with intersection properties\", Discrete Applied Math. 9 (1984) pp.187\u2013196.","journal-title":"Discrete Applied Math."},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"430","DOI":"10.1109\/TIT.1979.1056073","volume":"IT-25","author":"L.D. Rudolph","year":"1979","unstructured":"L.D. RUDOLPH, C.R.P. HARTMANN, T.Y. HWANG and N.Q. DUC, \"Algebraic analog decoding of linear binary codes\", IEEE Trans. Inform. Theory, Vol. IT-25, pp.430\u2013440, July 1979.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"C.T. RETTER, \"Intersecting Goppa codes\", IEEE Trans. Inform. Theory, to appear.","DOI":"10.1109\/18.32158"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0019851.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:43:20Z","timestamp":1607550200000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019851"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540516433"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0019851","relation":{},"subject":[]}}