{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:52:01Z","timestamp":1760709121939},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T00:00:00Z","timestamp":1470700800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2017,2]]},"DOI":"10.1007\/s11277-016-3586-0","type":"journal-article","created":{"date-parts":[[2016,8,9]],"date-time":"2016-08-09T15:13:00Z","timestamp":1470755580000},"page":"941-968","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":19,"title":["Power Optimization of Three Dimensional Turbo Code Using a Novel Modified Symbiotic Organism Search (MSOS) Algorithm"],"prefix":"10.1007","volume":"92","author":[{"given":"Subhabrata","family":"Banerjee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sudipta","family":"Chattopadhyay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"key":"3586_CR1","doi-asserted-by":"publisher","unstructured":"Berrou, C., Glavieux, A., & Thitimajshima, P. (1993). Near Shannon limit error correcting coding and decoding: Turbo codes. In Proceeding of IEEE international conference on communications (ICC\u201993), Geneva (Vol. 2, pp. 1064\u20131070). doi: 10.1109\/ICC.1993.397441 .","DOI":"10.1109\/ICC.1993.397441"},{"issue":"5","key":"3586_CR2","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1109\/26.494303","volume":"44","author":"S Benedetto","year":"1996","unstructured":"Benedetto, S., & Montorsi, G. (1996). Design of parallel concatenated convolutional codes. IEEE Transactions on Communications, 44(5), 591\u2013600. doi: 10.1109\/26.494303 .","journal-title":"IEEE Transactions on Communications"},{"key":"3586_CR3","doi-asserted-by":"publisher","unstructured":"Benedetto, S., & Montorsi, G. (1996). Serial concatenation of interleaved codes: analytical performance bounds. In Proceeding of IEEE global telecommunications conference, (GLOBECOM\u201996) (Vol 1, pp. 106\u2013110). doi: 10.1109\/GLOCOM.1996.594342 .","DOI":"10.1109\/GLOCOM.1996.594342"},{"issue":"6","key":"3586_CR4","doi-asserted-by":"publisher","first-page":"1698","DOI":"10.1109\/18.556666","volume":"42","author":"LC Perez","year":"1996","unstructured":"Perez, L. C., Seghers, J., & Costello, D. J. (1996). A distance spectrum interpretation of turbo codes. IEEE Transactions on Information Theory, 42(6), 1698\u20131709. doi: 10.1109\/18.556666 .","journal-title":"IEEE Transactions on Information Theory"},{"key":"3586_CR5","unstructured":"Hokfelt, J., & Maseng, T. (1996). Optimizing the energy of different bit streams of turbo codes. In Turbo coding seminar proceedings, Lund, Sweden (pp. 59\u201363)."},{"key":"3586_CR6","doi-asserted-by":"publisher","unstructured":"Duman, T. M., & Salehi, M. (1997). On optimal power allocation for turbo codes. In Proceeding of IEEE international symposium on information theory, Ulm., Germany (p. 104). doi: 10.1109\/ISIT.1997.613019 .","DOI":"10.1109\/ISIT.1997.613019"},{"issue":"3","key":"3586_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1109\/4234.752905","volume":"3","author":"OY Takeshita","year":"1999","unstructured":"Takeshita, O. Y., Collins, O. M., Massey, P. C., & Costello, D. J. (1999). A note on asymmetric turbo-codes. IEEE Communication Letter, 3(3), 69\u201371. doi: 10.1109\/4234.752905 .","journal-title":"IEEE Communication Letter"},{"key":"3586_CR8","doi-asserted-by":"publisher","unstructured":"Salah, M. M., Raines, R. A., Temple, M. A., & Bailey, T. G. (2000). Energy allocation strategies for turbo codes with short frames. In Proceedings of IEEE information technology: coding and computing (pp. 408\u201311). doi: 10.1109\/ITCC.2000.844262 .","DOI":"10.1109\/ITCC.2000.844262"},{"key":"3586_CR9","doi-asserted-by":"publisher","unstructured":"Ahuja, S. S., & Sharma, V. (2002). Optimal power control for convolutional and turbo codes over fading channels. In Proceedings of IEEE global telecommunications conference, (GLOBECOM\u201902) (Vol. 2, pp. 1249\u20131253). doi: 10.1109\/GLOCOM.2002.1188397 .","DOI":"10.1109\/GLOCOM.2002.1188397"},{"key":"3586_CR10","doi-asserted-by":"publisher","unstructured":"Rangarajan, A., Singh, S. K., & Sharma, V. (2003). Power allocation policies for convolutional and turbo coded systems over fading channels. In Proceedings of conference on convergent technologies for the Asia-Pacific Region (Vol. 1, pp. 155\u2013159). doi: 10.1109\/TENCON.2003.1273302 .","DOI":"10.1109\/TENCON.2003.1273302"},{"issue":"7","key":"3586_CR11","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/j.aeue.2008.04.003","volume":"63","author":"K Ramasamy","year":"2009","unstructured":"Ramasamy, K., Balamuralithara, B., & Siddiqi, M. U. (2009). Optimal power allocation for the proposed asymmetric turbo code for 3G systems. International Journal of Electronics and Communication (AE\u00dc), 63(7), 551\u2013561. doi: 10.1016\/j.aeue.2008.04.003 .","journal-title":"International Journal of Electronics and Communication (AE\u00dc)"},{"issue":"1","key":"3586_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TIT.2003.821995","volume":"50","author":"J Li","year":"2004","unstructured":"Li, J., Narayanan, K. R., & Georghiades, C. N. (2004). Product accumulate codes: A class of codes with near-capacity performance and low decoding complexity. IEEE Transactions on Information Theory, 50(1), 31\u201346. doi: 10.1109\/TIT.2003.821995 .","journal-title":"IEEE Transactions on Information Theory"},{"key":"3586_CR13","doi-asserted-by":"publisher","unstructured":"Gonzalez, H., Berrou, C., & Kerou\u00e9dan, S. (2004). Serial\/parallel (s\/p) turbo codes for low error rates. In Proceedings of IEEE international conference on communication (ICC\u201904), Paris, France (Vol. 1, pp. 346\u2013350). doi: 10.1109\/ICC.2004.1312508 .","DOI":"10.1109\/ICC.2004.1312508"},{"key":"3586_CR14","doi-asserted-by":"publisher","unstructured":"Berrou, C., i Amat, A. G., Ould-Cheikh-Mouhamedou, Y., Douillard, C., & Saouter, Y. (2007). Adding a rate-1 third dimension to turbo codes. In Proceedings of IEEE information theory workshop (ITW\u201907), Lake Taho, CA (pp. 156\u2013161). doi: 10.1109\/ITW.2007.4313066 .","DOI":"10.1109\/ITW.2007.4313066"},{"key":"3586_CR15","doi-asserted-by":"publisher","unstructured":"Rosnes, E. (2008). Minimum distance upper bounds for 3-dimensional turbo codes using quadratic permutation polynomial interleavers. In Proceedings of IEEE 5th international symposium on turbo codes and related topics (pp. 420\u2013425). doi: 10.1109\/TURBOCODING.2008.4658736 .","DOI":"10.1109\/TURBOCODING.2008.4658736"},{"key":"3586_CR16","doi-asserted-by":"publisher","unstructured":"Ismail, D. K. B., Douillard, C., & Kerou\u00e9dan, S. (2009). Improving 3-dimensional turbo codes using 3GPP2 interleavers. In Proceedings of IEEE 1st international conference on communications and networking (pp. 1\u20137). doi: 10.1109\/COMNET.2009.5373557 .","DOI":"10.1109\/COMNET.2009.5373557"},{"issue":"9","key":"3586_CR17","doi-asserted-by":"publisher","first-page":"2505","DOI":"10.1109\/TCOMM.2009.09.070521","volume":"57","author":"C Berrou","year":"2009","unstructured":"Berrou, C., i Amat, A. G., Ould-Cheikh-Mouhamedou, Y., & Saouter, Y. (2009). Improving the distance properties of turbo codes using a third component code: 3D turbo codes. IEEE Transactions on Communication, 57(9), 2505\u20132509. doi: 10.1109\/TCOMM.2009.09.070521 .","journal-title":"IEEE Transactions on Communication"},{"key":"3586_CR18","doi-asserted-by":"publisher","unstructured":"i Amat, A. G., & Rosnes, E. (2010). Analysis of 3-dimensional turbo code ensembles. In Proceedings of IEEE information theory workshop (ITW 2010), Cairo, (pp. 1\u20135). doi: 10.1109\/ITWKSPS.2010.5503177 .","DOI":"10.1109\/ITWKSPS.2010.5503177"},{"key":"3586_CR19","unstructured":"Feldman, J. (2003). Decoding error-correcting codes via linear programming. Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Massachusetts Institute of Technology (MIT), Cambridge, MA."},{"key":"3586_CR20","doi-asserted-by":"publisher","unstructured":"Rosnes, E., Helmling, M., & i Amat, A. G. (2011). Pseudo code words of linear programming decoding of 3-dimensional turbo codes. In Proceedings of IEEE international symposium on information theory (ISIT), (pp. 1643\u20131647). doi: 10.1109\/ISIT.2011.6033823 .","DOI":"10.1109\/ISIT.2011.6033823"},{"issue":"5\u20136","key":"3586_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s12243-011-0270-y","volume":"67","author":"D Kbaier","year":"2012","unstructured":"Kbaier, D., Douillard, C., & Kerouedan, S. (2012). Analysis of three-dimensional turbo codes. Annales des Telecommunications, 67(5\u20136), 257\u2013268.","journal-title":"Annales des Telecommunications"},{"issue":"7","key":"3586_CR22","doi-asserted-by":"publisher","first-page":"2170","DOI":"10.1109\/TCOMM.2014.2329690","volume":"62","author":"E Rosnes","year":"2014","unstructured":"Rosnes, E., Helmling, M., & i Amat, A. G. (2014). Minimum pseudoweight analysis of 3-dimensional turbo codes. IEEE Transactions on Communications, 62(7), 2170\u20132182. doi: 10.1109\/TCOMM.2014.2329690 .","journal-title":"IEEE Transactions on Communications"},{"key":"3586_CR23","doi-asserted-by":"publisher","unstructured":"Sn\u00e1\u0161el, V., Plato\u0161, J., Kr\u00f6mer, P., & Ouddane, V. (2008). Genetic algorithms searching for turbo code interleaver, and solving linear ordering problem. In Proceedings of IEEE 7th computer information systems and industrial management applications (CISIM\u201908), (pp. 71\u201377). doi: 10.1109\/CISIM.2008.32 .","DOI":"10.1109\/CISIM.2008.32"},{"key":"3586_CR24","doi-asserted-by":"publisher","unstructured":"Snasel, V., Platos, J., Kromer, P., Ouddane, N., & Abraham, A. (2010). Interleaver optimization by population based metaheuristics. In Proceedings of IEEE 2nd world congress on nature and biologically inspired computing (NaBIC) (pp. 672\u2013677). doi: 10.1109\/NABIC.2010.5716363 .","DOI":"10.1109\/NABIC.2010.5716363"},{"key":"3586_CR25","doi-asserted-by":"publisher","unstructured":"Banerjee, S., & Chattopadhyay, S. (2014). Design of parallel concatenated convolution turbo code using harmony search algorithm. In Proceedings of IEEE international conference on power, control and embedded systems (ICPCES) (pp. 1\u20136). doi: 10.1109\/ICPCES.2014.7062810 .","DOI":"10.1109\/ICPCES.2014.7062810"},{"issue":"2","key":"3586_CR26","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1177\/003754970107600201","volume":"76","author":"ZW Geem","year":"2001","unstructured":"Geem, Z. W., Kim, J. H., & Loganathan, G. V. (2001). A new heuristic optimization algorithm: Harmony search. Simulation, 76(2), 60\u201368.","journal-title":"Simulation"},{"key":"3586_CR27","doi-asserted-by":"publisher","unstructured":"Banerjee, S., & Chattopadhyay, S. (2014). A novel asymmetric turbo code using cuckoo search algorithm. In Proceedings of IEEE India conference (INDICON) (pp. 1\u20136). doi: 10.1109\/INDICON.2014.7030640 .","DOI":"10.1109\/INDICON.2014.7030640"},{"key":"3586_CR28","doi-asserted-by":"publisher","unstructured":"Yang, X.-S., & Deb, S. (2009). Cuckoo search via levy flights. In Proceedings of IEEE world congress on nature & biologically inspired computing (NaBIC 2009), USA (pp. 210\u2013214) doi: 10.1109\/NABIC.2009.5393690 .","DOI":"10.1109\/NABIC.2009.5393690"},{"issue":"15","key":"3586_CR29","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","volume":"139","author":"M-Y Cheng","year":"2014","unstructured":"Cheng, M.-Y., & Prayogo, D. (2014). Symbiotic organisms search: A new meta-heuristic optimization algorithm. Computers and Structures, 139(15), 98\u2013112. doi: 10.1016\/j.compstruc.2014.03.007 .","journal-title":"Computers and Structures"},{"issue":"3","key":"3586_CR30","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/BF02998581","volume":"54","author":"JD Andersen","year":"1999","unstructured":"Andersen, J. D. (1999). Selection of component codes for turbo coding based on convergence properties. Annals of Telecommunications, 54(3), 208\u2013213.","journal-title":"Annals of Telecommunications"},{"issue":"2","key":"3586_CR31","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1109\/18.485713","volume":"42","author":"S Benedetto","year":"1996","unstructured":"Benedetto, S., & Montorsi, G. (1996). Unveiling turbo codes: Some results on parallel concatenated coding schemes. IEEE Transactions on Information Theory, 42(2), 409\u2013429. doi: 10.1109\/18.485713 .","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3586-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-016-3586-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3586-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-016-3586-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T14:54:40Z","timestamp":1657032880000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-016-3586-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,9]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,2]]}},"alternative-id":["3586"],"URL":"https:\/\/doi.org\/10.1007\/s11277-016-3586-0","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,9]]}}}