{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T13:10:49Z","timestamp":1777381849550,"version":"3.51.4"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T00:00:00Z","timestamp":1510012800000},"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":"publisher","award":["307467\/2015-5"],"award-info":[{"award-number":["307467\/2015-5"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s11235-017-0407-z","type":"journal-article","created":{"date-parts":[[2017,11,7]],"date-time":"2017-11-07T15:48:19Z","timestamp":1510069699000},"page":"513-521","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Turbo decoding of simple product codes in a two user binary adder channel employing the Bahl\u2013Cocke\u2013Jelinek\u2013Raviv algorithm"],"prefix":"10.1007","volume":"68","author":[{"given":"I. M. M.","family":"de Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. L. M. G.","family":"Alcoforado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"suffix":"Jr","given":"V. C.","family":"da Rocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,11,7]]},"reference":[{"key":"407_CR1","unstructured":"AHA Products Group, Comtech EF Data Corporation. \n                    http:\/\/www.aha.com\/DrawProducts.aspx?Action=GetCategories&ProductTypeID=2&PageID=47\n                    \n                  . Accessed 2 May 2017"},{"key":"407_CR2","unstructured":"Turbo Concept, a Newtec Company. \n                    http:\/\/www.turboconcept.com\/ip_cores.php?p=tpc-Turbo-Product-Codes\n                    \n                  . Accessed 2 May 2017."},{"issue":"22","key":"407_CR3","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 Trans Inf Theory, 2(22), 129\u2013137. \n                    https:\/\/doi.org\/10.1109\/TIT.1976.1055529\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"issue":"13","key":"407_CR4","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1049\/el:19910728","volume":"27","author":"FH Ali","year":"1991","unstructured":"Ali, F. H., & Honary, B. (1991). Low complexity soft decision decoding technique for T-User collaborative coding multiple-access channels. Electron Lett, 27(13), 1167\u20131169. \n                    https:\/\/doi.org\/10.1049\/el:19910728\n                    \n                  .","journal-title":"Electron Lett"},{"issue":"2","key":"407_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1049\/ip-com:19941043","volume":"141","author":"FH Ali","year":"1994","unstructured":"Ali, F. H., & Honary, B. (1994). Collaborative coding and decoding techniques for multiple access channel. IEE Proc Commun, 141(2), 56\u201362. \n                    https:\/\/doi.org\/10.1049\/ip-com:19941043\n                    \n                  .","journal-title":"IEE Proc Commun"},{"issue":"25","key":"407_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1109\/TIT.1979.1056000","volume":"1","author":"R Peterson","year":"1979","unstructured":"Peterson, R., & Costello, D. J, Jr. (1979). Binary convolutional codes for a multiple-access channel. IEEE Trans Inf Theory, 1(25), 101\u2013105. \n                    https:\/\/doi.org\/10.1109\/TIT.1979.1056000\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"key":"407_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2017.05.014","volume":"689","author":"G Marco De","year":"2017","unstructured":"De Marco, G., & Kowalski, D. R. (2017). Contention resolution in a non-synchronized multiple access channel. Theor Comput Sci, 689, 1\u201313. \n                    https:\/\/doi.org\/10.1016\/j.tcs.2017.05.014\n                    \n                  .","journal-title":"Theor Comput Sci"},{"issue":"1","key":"407_CR8","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1186\/s13638-017-0834-2","volume":"2017","author":"Y Xue","year":"2017","unstructured":"Xue, Y., Tian, Y., & Yang, C. (2017). Joint coding in parallel symmetric interference channels with deterministic model. EURASIP J Wireless Commun Netw, 2017(1), 49.","journal-title":"EURASIP J Wireless Commun Netw"},{"issue":"3","key":"407_CR9","doi-asserted-by":"publisher","first-page":"820","DOI":"10.1007\/s00224-016-9725-x","volume":"61","author":"L Anantharamu","year":"2017","unstructured":"Anantharamu, L., Chlebus, B. S., & Rokicki, M. A. (2017). Adversarial multiple access channels with individual injection rates. Theory of Comput Syst, 61(3), 820\u2013850.","journal-title":"Theory of Comput Syst"},{"issue":"9","key":"407_CR10","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 Trans Inf Theory, 51(9), 3289\u20133291. \n                    https:\/\/doi.org\/10.1109\/TIT.2005.853309\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"407_CR11","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 \n                    \n                      \n                    \n                    $$ T $$\n                    \n                      \n                        T\n                      \n                    \n                  -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 Trans Inf Theory, 53(3), 1219\u20131220. \n                    https:\/\/doi.org\/10.1109\/TIT.2006.890692\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"issue":"20","key":"407_CR12","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 Trans Inf Theory, 2(20), 284\u2013287. \n                    https:\/\/doi.org\/10.1109\/TIT.1974.1055186\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"issue":"3","key":"407_CR13","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s11235-016-0185-z","volume":"64","author":"MLMG Alcoforado","year":"2017","unstructured":"Alcoforado, M. L. M. G., de Jesus, J. J., & da Rocha, V. C. (2017). Turbo coding for the noisy 2-user binary adder channel with punctured convolutional codes. Telecommun Syst, 64(3), 459\u2013465. \n                    https:\/\/doi.org\/10.1007\/s11235-016-0185-z\n                    \n                  .","journal-title":"Telecommun Syst"},{"issue":"5","key":"407_CR14","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 Jr, V. C. (2015). The Bahl-Cocke-Jelinek-Raviv decoding algorithm applied to the three-user binary adder channel. IET Commun, 9(5), 897\u2013902. \n                    https:\/\/doi.org\/10.1049\/iet-com.2014.0376\n                    \n                  .","journal-title":"IET Commun"},{"issue":"4","key":"407_CR15","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1007\/s11235-015-0043-4","volume":"61","author":"SMM Anvar","year":"2016","unstructured":"Anvar, S. M. M., Khanmohammadi, S., & Niya, J. M. (2016). Game theoretic power allocation for fading MIMO multiple access channels with imperfect CSIR. Telecommun Syst, 61(4), 875\u2013886. \n                    https:\/\/doi.org\/10.1007\/s11235-015-0043-4\n                    \n                  .","journal-title":"Telecommun Syst"},{"issue":"1","key":"407_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1134\/S0032946016010014","volume":"52","author":"EA Bakin","year":"2016","unstructured":"Bakin, E. A., & Evseev, G. S. (2016). Remark on on the capacity of a multiple-access vector adder channel by AA Frolov and VV Zyablov. Probl Inf Trans, 52(1), 1\u20135. \n                    https:\/\/doi.org\/10.1134\/S0032946016010014\n                    \n                  .","journal-title":"Probl Inf Trans"},{"issue":"2","key":"407_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1134\/S0032946014020021","volume":"50","author":"AA Frolov","year":"2014","unstructured":"Frolov, A. A., & Zyablov, V. V. (2014). On the capacity of a multiple-access vector adder channel. Probl Inf Trans, 50(2), 133\u2013143. \n                    https:\/\/doi.org\/10.1134\/S0032946014020021\n                    \n                  .","journal-title":"Probl Inf Trans"},{"issue":"2","key":"407_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s40998-017-0022-8","volume":"41","author":"H Tavakoli","year":"2017","unstructured":"Tavakoli, H. (2017). Polarization of a point-to-point channel by a multiple access channel: a new method for different channel polarization. Iran J Sci Technol Trans Electr Eng, 41(2), 115\u2013122. \n                    https:\/\/doi.org\/10.1007\/s40998-017-0022-8\n                    \n                  .","journal-title":"Iran J Sci Technol Trans Electr Eng"},{"key":"407_CR19","doi-asserted-by":"publisher","unstructured":"Ordentlich, O., & Shayevitz, O. (2015, June). A VC-dimension-based outer bound on the zero-error capacity of the binary adder channel. In: International symposium on information theory (ISIT), 2015 IEEE pp. 2366\u20132370. IEEE. \n                    https:\/\/doi.org\/10.1109\/ISIT.2015.7282879\n                    \n                  .","DOI":"10.1109\/ISIT.2015.7282879"},{"key":"407_CR20","doi-asserted-by":"publisher","unstructured":"Bidokhti, S. S., & Kramer, G. (2016, July). Capacity of two-relay diamond networks with rate-limited links to the relays and a binary adder multiple access channel. In: 2016 IEEE international symposium on information theory (ISIT), pp. 1665\u20131669. IEEE. \n                    https:\/\/doi.org\/10.1109\/ISIT.2016.7541582\n                    \n                  .","DOI":"10.1109\/ISIT.2016.7541582"},{"key":"407_CR21","doi-asserted-by":"publisher","unstructured":"Song, H., Brandt-Pearce, M., Xie, T., & Wilson, S. G. (2012, December). Combined constrained code and LDPC code for long-haul fiber-optic communication systems. In: Global communications conference (GLOBECOM), 2012 IEEE, pp. 2984\u20132989. \n                    https:\/\/doi.org\/10.1109\/GLOCOM.2012.6503571\n                    \n                  .","DOI":"10.1109\/GLOCOM.2012.6503571"},{"issue":"2","key":"407_CR22","first-page":"47","volume":"11","author":"Q Du","year":"2016","unstructured":"Du, Q., Sun, L., Song, H., & Ren, P. (2016). Security enhancement for wireless multimedia communications by fountain code. IEEE COMSOC MMTC E-Lett, 11(2), 47\u201351.","journal-title":"IEEE COMSOC MMTC E-Lett"},{"key":"407_CR23","doi-asserted-by":"publisher","first-page":"4431","DOI":"10.1109\/ACCESS.2016.2604358","volume":"4","author":"J Song","year":"2016","unstructured":"Song, J., Shen, P., Wang, K., Zhang, L., & Song, H. (2016). Can gray code improve the performance of distributed video coding? IEEE Access, 4, 4431\u20134441. \n                    https:\/\/doi.org\/10.1109\/ACCESS.2016.2604358\n                    \n                  .","journal-title":"IEEE Access"},{"issue":"1","key":"407_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s11277-014-2194-0","volume":"82","author":"M Shojafar","year":"2015","unstructured":"Shojafar, M., Abolfazli, S., Mostafaei, H., & Singhal, M. (2015). Improving channel assignment in multi-radio wireless mesh networks with learning automata. Wirel Pers Commun, 82(1), 61\u201380. \n                    https:\/\/doi.org\/10.1007\/s11277-014-2194-0\n                    \n                  .","journal-title":"Wirel Pers Commun"},{"key":"407_CR25","doi-asserted-by":"crossref","unstructured":"Alcoforado, M. L. M. G., da Rocha Jr., V. C. & Markarian, G.(2005). Turbo block codes for the binary adder channel. In: 2005 IEEE international symposium on information theory (ISIT), Adelaide, Australia, Vol. 2, pp. 1883\u20131887. IEEE.","DOI":"10.1109\/ISIT.2005.1523672"},{"key":"407_CR26","volume-title":"Error-correcting codes","author":"WW Peterson","year":"1972","unstructured":"Peterson, W. W., & Weldon Jr, E. J. (1972). Error-correcting codes. Cambridge: MIT Press."},{"issue":"24","key":"407_CR27","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1109\/TIT.1978.1055821","volume":"1","author":"JK Wolf","year":"1978","unstructured":"Wolf, J. K. (1978). Efficient maximum likelihood decoding of linear block codes using a trellis. IEEE Trans Inf Theory, 1(24), 76\u201380. \n                    https:\/\/doi.org\/10.1109\/TIT.1978.1055821\n                    \n                  .","journal-title":"IEEE Trans Inf Theory"},{"key":"407_CR28","volume-title":"The art of error correcting coding","author":"RH Morelos-Zaragoza","year":"1998","unstructured":"Morelos-Zaragoza, R. H. (1998). The art of error correcting coding. Hoboken: John Wiley & Sons Ltd."},{"issue":"8","key":"407_CR29","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/26.705396","volume":"46","author":"R Pyndiah","year":"1998","unstructured":"Pyndiah, R. (1998). Near-optimum decoding of product codes: block turbo codes. IEEE Trans Commun, 46(8), 1003\u20131010. \n                    https:\/\/doi.org\/10.1109\/26.705396\n                    \n                  .","journal-title":"IEEE Trans Commun"},{"key":"407_CR30","doi-asserted-by":"publisher","unstructured":"Haesik, K., Markarian, G., & da Rocha Jr., V. C. (2010). Low complexity iterative decoding of product codes using a generalized array code form of the Nordstrom-Robinson code. In: Proceesings 6th international symposium on turbo codes and iterative information processing (ISTC), France, September, pp. 88\u201392. \n                    https:\/\/doi.org\/10.1109\/ISTC.2010.5613809\n                    \n                  .","DOI":"10.1109\/ISTC.2010.5613809"},{"key":"407_CR31","first-page":"200","volume-title":"Elements of information theory 2nd edition","author":"TM Cover","year":"2006","unstructured":"Cover, T. M., & Thomas, J. A. (2006). Elements of information theory 2nd edition (p. 200). Hoboken: Wiley-interscience."},{"issue":"2","key":"407_CR32","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/18.485714","volume":"42","author":"J Hagenauer","year":"1996","unstructured":"Hagenauer, J., Offer, E., & Papke, L. (1996). Iterative decoding of binary block and convolutional codes. IEEE Trans Inf Theory, 42(2), 429\u2013445.","journal-title":"IEEE Trans Inf Theory"},{"issue":"2","key":"407_CR33","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1109\/49.661107","volume":"16","author":"V Franz","year":"1998","unstructured":"Franz, V., & Anderson, J. B. (1998). Concatenated decoding with a reduced-search BCJR algorithm. IEEE J Sel Areas in Commun, 16(2), 186\u2013195. \n                    https:\/\/doi.org\/10.1109\/49.661107\n                    \n                  .","journal-title":"IEEE J Sel Areas in Commun"},{"key":"407_CR34","doi-asserted-by":"publisher","unstructured":"Sabeti, L., Ahmadi, M., & Tepe, K. E. (2005, September). Low-complexity BCJR decoder for turbo decoders and its VLSI implementation in 0.18-\/spl mu\/m CMOS. In: IEEE 62nd vehicular technology conference, 2005. VTC-2005-Fall. 2005 IEEE. Vol. 2, pp. 912\u2013916. \n                    https:\/\/doi.org\/10.1109\/VETECF.2005.1558058\n                    \n                  .","DOI":"10.1109\/VETECF.2005.1558058"},{"issue":"4","key":"407_CR35","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s11235-014-9909-0","volume":"59","author":"I Benchimol","year":"2015","unstructured":"Benchimol, I., Pimentel, C., & Souza, R. D. (2015). Low complexity trellis representations of convolutional codes via sectionalization of the minimal trellis. Telecommun Syst, 59(4), 491\u2013500. \n                    https:\/\/doi.org\/10.1007\/s11235-014-9909-0\n                    \n                  .","journal-title":"Telecommun Syst"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-017-0407-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-017-0407-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T23:29:11Z","timestamp":1581982151000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-017-0407-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,7]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["407"],"URL":"https:\/\/doi.org\/10.1007\/s11235-017-0407-z","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,7]]},"assertion":[{"value":"7 November 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}