{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:45:13Z","timestamp":1740123913613,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T00:00:00Z","timestamp":1465171200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"crossref","award":["304696\/2010-2"],"award-info":[{"award-number":["304696\/2010-2"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11235-016-0185-z","type":"journal-article","created":{"date-parts":[[2016,6,6]],"date-time":"2016-06-06T17:04:15Z","timestamp":1465232655000},"page":"459-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Turbo coding for the noisy 2-user binary adder channel with punctured convolutional codes"],"prefix":"10.1007","volume":"64","author":[{"given":"Maria de Lourdes M. G.","family":"Alcoforado","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jamerson J. C. B.","family":"de Jesus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr.","given":"Valdemar C.","family":"da Rocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,6]]},"reference":[{"issue":"22","key":"185_CR1","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1976.1055529","volume":"2","author":"T Kasami","year":"1976","unstructured":"Kasami, T., & Lin, S. (1976). Coding for a multiple-access channel. IEEE Transactions on Information Theory, 2(22), 129\u2013137.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"185_CR2","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1109\/TIT.1979.1055999","volume":"25","author":"JB Cain","year":"1979","unstructured":"Cain, J. B., Clark, G. C, Jr., & Geist, J. M. (1979). Punctured convolutional codes of rate \n                    \n                      \n                    \n                    $$(n-1)\/n$$\n                    \n                      \n                        \n                          (\n                          n\n                          -\n                          1\n                          )\n                          \/\n                          n\n                        \n                      \n                    \n                   and simplified maximum likelihood decoding. IEEE Transactions on Information Theory, 25(1), 97\u2013100.","journal-title":"IEEE Transactions on Information Theory"},{"key":"185_CR3","volume-title":"Error control systems for digital communication and storage","author":"SB Wicker","year":"1995","unstructured":"Wicker, S. B. (1995). Error control systems for digital communication and storage. Upper Saddle River, NJ: Prentice Hall."},{"issue":"3","key":"185_CR4","first-page":"142","volume":"2","author":"JK Bisla","year":"2014","unstructured":"Bisla, J. K., Dhillon, N., & Sharma, K. (2014). Performance evaluation of punctured convolutional codes for OFDM-WiMAX system. International Journal of Electronics and Electrical Engineering, 2(3), 142\u2013148.","journal-title":"International Journal of Electronics and Electrical Engineering"},{"key":"185_CR5","doi-asserted-by":"publisher","first-page":"3289","DOI":"10.1109\/TIT.2005.853309","volume":"51","author":"M Mattas","year":"2005","unstructured":"Mattas, M., & Ostergard, P. R. J. (2005). A new bound for the zero-error capacity region of the two-user binary adder channel. IEEE Transactions on Information Theory, 51, 3289\u20133291.","journal-title":"IEEE Transactions on Information Theory"},{"key":"185_CR6","doi-asserted-by":"publisher","first-page":"1219","DOI":"10.1109\/TIT.2006.890692","volume":"53","author":"L Kiviluoto","year":"2007","unstructured":"Kiviluoto, L., & Ostergard, P. R. J. (2007). New uniquely decodable codes for the t-user binary adder channel with \n                    \n                      \n                    \n                    $$3 \\le t \\le 5$$\n                    \n                      \n                        \n                          3\n                          \u2264\n                          t\n                          \u2264\n                          5\n                        \n                      \n                    \n                  . IEEE Transactions on Information Theory, 53, 1219\u20131220.","journal-title":"IEEE Transactions on Information Theory"},{"key":"185_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2007\/74890","volume":"2007","author":"A Roumy","year":"2007","unstructured":"Roumy, A., & Declerq, D. (2007). Characterization and optimization of LDPC codes for the 2-user Gaussian multiple access channel. EURASIP Journal on Wireless Communications and Networking, 2007, 1\u201310.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"185_CR8","unstructured":"Beltr\u00e3o Neto, H. V., & da Rocha Jr., V. C. (2009). Iterative decoding results for the Gaussian multiuser binary adder channel. In Proceedings of tenth international symposium on communication theory and applications (pp. 1\u20136)."},{"key":"185_CR9","doi-asserted-by":"crossref","unstructured":"Wang, G., Land, I., & Grant, A. (2012). Irregular repeat accumulate codes with few iterations for the binary adder channel. In Proceedings of 7th international symposium on turbo codes and iterative information processing (ISTC 2012) (pp. 215\u2013219).","DOI":"10.1109\/ISTC.2012.6325230"},{"key":"185_CR10","doi-asserted-by":"crossref","unstructured":"Lu, S., Cheng, J., & Hou, W., et al. (2013). Generalized construction of signature code for multiple-access adder channel. In Proceedings of IEEE international symposium on information theory (ISIT 2013) (pp. 1655\u20131659).","DOI":"10.1109\/ISIT.2013.6620508"},{"issue":"1","key":"185_CR11","first-page":"23","volume":"3","author":"H Matsuda","year":"2013","unstructured":"Matsuda, H. (2013). Coding for a noisy binary multiple-access adder channel. American Journal of Computational and Applied Mathematics, 3(1), 23\u201325.","journal-title":"American Journal of Computational and Applied Mathematics"},{"issue":"7","key":"185_CR12","doi-asserted-by":"publisher","first-page":"897","DOI":"10.1049\/iet-com.2014.0376","volume":"9","author":"MLMG Alcoforado","year":"2015","unstructured":"Alcoforado, M. L. M. G., Oliveira, M. C. C., & da Rocha, V. C, Jr. (2015). The Bahl-Cocke-Jelinek-Raviv decoding algorithm applied to the three-user binary adder channel. IET Communications, 9(7), 897\u2013902.","journal-title":"IET Communications"},{"issue":"20","key":"185_CR13","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1109\/TIT.1974.1055186","volume":"2","author":"LR Bahl","year":"1974","unstructured":"Bahl, L. R., Cocke, J., Jelinek, F., et al. (1974). Optimal decoding of linear codes for minimizing symbol error rate. IEEE Transactions on Information Theory, 2(20), 284\u2013287.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"5","key":"185_CR14","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1049\/iet-ipr.2014.0655","volume":"9","author":"A Khalid","year":"2015","unstructured":"Khalid, A., Khan, E., Adebisi, B., et al. (2015). Image transmission using unequal error protected multi-fold turbo codes over a two-user power-line binary adder channel. IET Image Processing, 9(5), 395\u2013404.","journal-title":"IET Image Processing"},{"issue":"1","key":"185_CR15","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.1979.1056000","volume":"25","author":"R Peterson","year":"1979","unstructured":"Peterson, R., & Costello, D. J, Jr. (1979). Binary convolutional codes for a multiple-access channel. IEEE Transactions on Information Theory, 25(1), 101\u2013105.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"47","key":"185_CR16","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1049\/el.2011.0851","volume":"13","author":"MLMG Alcoforado","year":"2011","unstructured":"Alcoforado, M. L. M. G., da Rocha, V. C, Jr., Markarian, G., et al. (2011). Iterative decoding of turbo convolutional codes over noisy two-user binary adder channel. Electronics Letters, 13(47), 749\u2013751.","journal-title":"Electronics Letters"},{"key":"185_CR17","doi-asserted-by":"crossref","unstructured":"Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit, error-correcting coding and decoding: turbo codes. In Proceedings of IEEE international conference on communications, (ICC\u201993), 2\/3 (pp. 1064\u20131071).","DOI":"10.1109\/ICC.1993.397441"},{"key":"185_CR18","doi-asserted-by":"publisher","first-page":"30","DOI":"10.14209\/jcis.2010.5","volume":"25","author":"MLMG Alcoforado","year":"2010","unstructured":"Alcoforado, M. L. M. G., & da Rocha, V. C, Jr. (2010). The Bahl-Cocke-Jelinek-Raviv algorithm applied to the two user binary adder channel. Journal of Communication and Information Systems, 25, 30\u201335.","journal-title":"Journal of Communication and Information Systems"},{"key":"185_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2999-3","volume-title":"Turbo coding","author":"C Heegard","year":"1999","unstructured":"Heegard, C., & Wicker, S. (1999). Turbo coding. Berlin: Kluwer Academic Publishers."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-016-0185-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0185-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0185-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0185-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T16:10:23Z","timestamp":1581955823000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-016-0185-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["185"],"URL":"https:\/\/doi.org\/10.1007\/s11235-016-0185-z","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2016,6,6]]},"assertion":[{"value":"6 June 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}