{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:11:19Z","timestamp":1725459079055},"publisher-location":"Berlin\/Heidelberg","reference-count":9,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540516433"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0019854","type":"book-chapter","created":{"date-parts":[[2006,1,12]],"date-time":"2006-01-12T06:48:27Z","timestamp":1137048507000},"page":"147-161","source":"Crossref","is-referenced-by-count":0,"title":["Results of generalized minimum distance decoding for block code of rate 1\/2"],"prefix":"10.1007","author":[{"given":"Y. P.","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Godlewski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1109\/TIT.1966.1053873","volume":"IT-12","author":"G.D. Forney Jr","year":"1966","unstructured":"G.D. FORNEY, Jr, \"Generalized Minimum Distance Decoding\", IEEE Trans. Inform. Theory, vol. IT-12, pp.125\u2013131,Apr. 1966.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"G. EINARSSON and C.E.SUNDBERG,\"A note on soft decision decoding with successive erasures\", IEEE Trans. Inform. Theory, Jan. 1976.","DOI":"10.1109\/TIT.1976.1055505"},{"key":"13_CR3","volume-title":"Concatenated Codes","author":"G.D. Forney Jr","year":"1966","unstructured":"G.D. FORNEY,Jr, \"Concatenated Codes\". Cambridge, MA. MIT,1966."},{"key":"13_CR4","unstructured":"C. Clark,Jr. \"Error-Correction Coding for Digital Communications\", PLENUM PRESS, New York."},{"key":"13_CR5","doi-asserted-by":"crossref","unstructured":"A. DUR,\" On the computation of the performance probability for block codes with a bounded-distance decoding Rule\",IEEE Trans. on Inf. theory, Vol. 34, No. 1, Jan. 1988.","DOI":"10.1109\/18.2603"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"C.H.YU and D.J.COSTELLO,Jr,\"Generalized Minimum Distance Decoding Algorithm for Qary Output channels\", IEEE Trans. Inform. Theory, vol. IT-26, no.2,Mar. 1980.","DOI":"10.1109\/TIT.1980.1056148"},{"key":"13_CR7","unstructured":"J.P. Odenwalder,\"Concatenated Reed-Solomon\/Viterbi channel coding for advanced planetary mission: Analysis, Simulations and Tests, Linkabit Corporation, Final Report on contract No 953866, Dec. 1974."},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"K.Y.LIU and J.J.LEE,\"Recent Results on the use of Concatenated Reed-Solomon\/Viterbi Channel Coding and Data Compression for space Communications\", IEEE Trans. on Com. Vol. COM-32, No.5, May 1984.","DOI":"10.1109\/TCOM.1984.1096093"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"G. BATTAIL, \"Pond\u00e9ration des symboles decod\u00e9s par l'algorithme de Viterbi\", Ann. TELECOM. Vol.42, No.1\u20132,1987.","DOI":"10.1007\/BF02996166"}],"container-title":["Lecture Notes in Computer Science","Coding Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0019854","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,22]],"date-time":"2021-07-22T10:50:18Z","timestamp":1626951018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0019854"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540516433"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/bfb0019854","relation":{},"subject":[]}}