{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T10:34:13Z","timestamp":1743071653199,"version":"3.35.0"},"reference-count":15,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"vor","delay-in-days":4333,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Trans Emerging Tel Tech"],"published-print":{"date-parts":[[1996,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Generalized concatenation of inner and outer convolutional codes is studied. The essential problem is the partitioning of the inner code. A construction procedure to obtain a suitable equivalent description for a given code is derived, which gives the best possible distances in the partitioned subcodes. The construction rule is illustrated with two examples. A small code is studied to emphasize the ideas of the construction and a large code, namely the satellite standard code, demonstrates the considerable gains in decoding performance when using generalized concatenation. Furthermore, the possibilities for iterative decoding are pointed out.<\/jats:p>","DOI":"10.1002\/ett.4460070603","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T14:20:21Z","timestamp":1221229221000},"page":"483-492","source":"Crossref","is-referenced-by-count":11,"title":["Generalized concatenation of convolutional codes"],"prefix":"10.1002","volume":"7","author":[{"given":"Martin","family":"Bossert","sequence":"first","affiliation":[]},{"given":"Hans","family":"Dieterich","sequence":"additional","affiliation":[]},{"given":"Sergo","family":"Shavgulidze","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"V. V.Zyablov S. A.Shavgulidze Generalized concatenated constructions on the base of convolutional codes. Nauka.1991 in Russian."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"C.Berrou A.Glavieux P.Thitimajshima Near Shannon limit error\u2010correcting coding and decoding: turbo\u2010codes(1). \u201cProc. ICC'93\u201d. May1993 p.1064\u20131070 .","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1970.1054541"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.243440"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056888"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1109\/TIT.1976.1055557","article-title":"Short unit\u2010memory byte\u2010oriented binary convolutional codes having maximal free distance","volume":"22","author":"Lee Lin\u2010Nan","year":"1976","journal-title":"IEEE Trans. Inform. Theory"},{"key":"e_1_2_1_8_2","unstructured":"V. V.Zyablov S. A.Shavgulidze The comparison of concatenated constructions with inner convolutional codes for PSK2 and PSK4. Proc. Intern. Symp. Communication Theory & Application Crieff (Scotland) 1991 Session 2 paper 6."},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1987.1146583"},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055014"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056739"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.21249"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.21236"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460040310"},{"key":"e_1_2_1_15_2","unstructured":"Hagenauer P. Hoeher A Viterbi Algorithm with soft\u2010decision outpurs and its applications. PProc. GLOBECOM '89 Dallas Texas Nov.1989 p.47.1.1\u201347.1.7."},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"}],"container-title":["European Transactions on Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fett.4460070603","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/ett.4460070603","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T22:38:23Z","timestamp":1738363103000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/ett.4460070603"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":15,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["10.1002\/ett.4460070603"],"URL":"https:\/\/doi.org\/10.1002\/ett.4460070603","archive":["Portico"],"relation":{},"ISSN":["1124-318X","1541-8251"],"issn-type":[{"type":"print","value":"1124-318X"},{"type":"electronic","value":"1541-8251"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}