{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T08:57:26Z","timestamp":1778662646407,"version":"3.51.4"},"reference-count":18,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":3787,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1998,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>In this contribution the problem of channel decoding is considered from the viewpoint of optimization theory. The decoding problem is at first denoted as integer optimization problem. To solve this problem, well\u2010known methods from optimization theory are suitable. Two examples are presented: First, an Omura\u2010type algorithm from [13] can be derived from the Simplex algorithm. Second, the decoding problem is reformulated such that it can be solved by a Branch\u2010and\u2010Bound algorithm. By simulation results, questions concerning bit error rate and complexity will be discussed.<\/jats:p>","DOI":"10.1002\/ett.4460090308","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T16:35:32Z","timestamp":1221237332000},"page":"289-293","source":"Crossref","is-referenced-by-count":15,"title":["<i>Letter<\/i> soft\u2010decision decoding of linear block codes as optimization problem"],"prefix":"10.1002","volume":"9","author":[{"given":"Markus","family":"Breitbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Bossert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rainer","family":"Lucas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Kempter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055821"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.335888"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.259636"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1966.1053873"},{"issue":"1","key":"e_1_2_1_6_2","doi-asserted-by":"crossref","DOI":"10.1109\/TIT.1972.1054746","article-title":"A class of algorithms for decoding block codes with channel measurement information","volume":"18","author":"Chase D.","year":"1972","journal-title":"IEEE Trans. Inform. Theory"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","DOI":"10.1109\/18.61132","article-title":"An improvement to generalized\u2010minimum\u2010distance decoding","volume":"37","author":"Taipale D. J.","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.312155"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.485714"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056724"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/49.661116"},{"key":"e_1_2_1_12_2","unstructured":"R.Lucas:On iterative soft\u2010decision decoding of linear binary block codes. PhD thesis University of Ulm Dept. Information Technology 1997."},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.370171"},{"key":"e_1_2_1_14_2","volume-title":"Error\u2010correction coding for digital communications","author":"Clark G. C.","year":"1988"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/26.380188"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"e_1_2_1_18_2","volume-title":"Operations research","author":"Neumann K.","year":"1993"},{"key":"e_1_2_1_19_2","volume-title":"Algorithms in C","author":"Sedgewick R.","year":"1990"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460090308","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460090308","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T11:26:18Z","timestamp":1698492378000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460090308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["10.1002\/ett.4460090308"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460090308","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"value":"1124-318X","type":"print"},{"value":"1541-8251","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}