{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:13:32Z","timestamp":1773324812958,"version":"3.50.1"},"reference-count":11,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2012,3,25]],"date-time":"2012-03-25T00:00:00Z","timestamp":1332633600000},"content-version":"vor","delay-in-days":84,"URL":"http:\/\/creativecommons.org\/licenses\/by\/3.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Journal of Electrical and Computer Engineering"],"published-print":{"date-parts":[[2012,1]]},"abstract":"<jats:p>A computationally efficient algorithm for decoding block codes is developed using a genetic algorithm (GA). The proposed algorithm uses the dual code in contrast to the existing genetic decoders in the literature that use the code itself. Hence, this new approach reduces the complexity of decoding the codes of high rates. We simulated our algorithm in various transmission channels. The performance of this algorithm is investigated and compared with competitor decoding algorithms including Maini and Shakeel ones. The results show that the proposed algorithm gives large gains over the Chase\u20102 decoding algorithm and reach the performance of the OSD\u20103 for some quadratic residue (QR) codes. Further, we define a new crossover operator that exploits the domain specific information and compare it with uniform and two point crossover. The complexity of this algorithm is also discussed and compared to other algorithms.<\/jats:p>","DOI":"10.1155\/2012\/503834","type":"journal-article","created":{"date-parts":[[2012,3,25]],"date-time":"2012-03-25T21:02:01Z","timestamp":1332709321000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient Dual Domain Decoding of Linear Block Codes Using Genetic Algorithms"],"prefix":"10.1155","volume":"2012","author":[{"given":"Ahmed","family":"Azouaoui","sequence":"first","affiliation":[]},{"given":"Mostafa","family":"Belkasmi","sequence":"additional","affiliation":[]},{"given":"Abderrazak","family":"Farchane","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2012,3,25]]},"reference":[{"key":"e_1_2_7_1_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2174-1"},{"key":"e_1_2_7_2_2","unstructured":"HanY. S. HartmannC. R. P. andChenC.-C. Efficient maximum likelihood soft-decision decoding of linear block codes using algorithm A* 1991 no. SU-CIS-91-42 School of Computer and Information Science Syracuse University Syracuse NY USA."},{"key":"e_1_2_7_3_2","doi-asserted-by":"crossref","unstructured":"MainiH. MehrotraK. MohanC. andRankaS. Soft decision decoding of linear block codes using genetic algorithms Proceedings of the IEEE International Symposium on Information Theory 1994 Trondheim Norway https:\/\/doi.org\/10.1109\/ISIT.1994.394622.","DOI":"10.1109\/ISIT.1994.394622"},{"key":"e_1_2_7_4_2","doi-asserted-by":"publisher","DOI":"10.1142\/S1465876302000629"},{"key":"e_1_2_7_5_2","doi-asserted-by":"crossref","unstructured":"CardosoF. A.andArantesD. S. Genetic decoding of linear block codes Proceedings of the Congress on Evolutionary Computation 1999 Washington DC USA 2302\u20132309 https:\/\/doi.org\/10.1109\/CEC.1999.785561.","DOI":"10.1109\/CEC.1999.785561"},{"key":"e_1_2_7_6_2","doi-asserted-by":"crossref","unstructured":"ShakeelI. GA-based Soft-decision decoding of linear block codes Proceedings of the International Confrrence on Telecommunications Congress on Evolutionary Computation April 2010 Doha Qatar 13\u201317 https:\/\/doi.org\/10.1109\/ICTEL.2010.5478650.","DOI":"10.1109\/ICTEL.2010.5478650"},{"key":"e_1_2_7_7_2","volume-title":"Adaptation in Natural and Artificial Systems","author":"Holland J.","year":"1975"},{"key":"e_1_2_7_8_2","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D. E.","year":"1989"},{"key":"e_1_2_7_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"e_1_2_7_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/18.651070"},{"key":"e_1_2_7_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1972.1054746"}],"container-title":["Journal of Electrical and Computer Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/503834.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/jece\/2012\/503834.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2012\/503834","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,12]],"date-time":"2024-06-12T12:40:25Z","timestamp":1718196025000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2012\/503834"}},"subtitle":[],"editor":[{"given":"Lisimachos P.","family":"Kondi","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1155\/2012\/503834"],"URL":"https:\/\/doi.org\/10.1155\/2012\/503834","archive":["Portico"],"relation":{},"ISSN":["2090-0147","2090-0155"],"issn-type":[{"value":"2090-0147","type":"print"},{"value":"2090-0155","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]},"assertion":[{"value":"2011-09-14","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-01-12","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"503834"}}