{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T09:32:34Z","timestamp":1730194354058,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1109\/acosis.2016.7843918","type":"proceedings-article","created":{"date-parts":[[2017,2,9]],"date-time":"2017-02-09T16:43:51Z","timestamp":1486658631000},"page":"1-6","source":"Crossref","is-referenced-by-count":0,"title":["Design of good linear codes for a decoder based on majority voting procedure"],"prefix":"10.1109","author":[{"given":"Issam Abderrahman","family":"Joundan","sequence":"first","affiliation":[]},{"given":"Said","family":"Nouh","sequence":"additional","affiliation":[]},{"given":"Abdelwahed","family":"Namir","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.4236\/ijcns.2012.511081"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2012.6320261"},{"key":"ref12","first-page":"17","article-title":"A Comparative Study of Search Techniques Applied tothe Minumum Distance of BCH Codes","author":"wallis","year":"2002","journal-title":"Conference on Artificial Intelligence and Soft Computing Banff"},{"key":"ref13","article-title":"efficient genetic algorithms for helping the permutation decoding algorithm","author":"nouh","year":"0","journal-title":"international conference on intelligent systems SITA-2012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4236\/ijcns.2012.57052"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.1994.394622"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.4236\/ijcns.2012.59066"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/503834"},{"key":"ref18","article-title":"A Novel Decoder Based on Parallel Genetic Algorithms for Linear Block Codes","volume":"6","author":"ahmadi","year":"2012","journal-title":"International Journal of Communications Network and System Sciences"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5120\/ijca2015906403"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1504\/IJGUC.2016.073780"},{"key":"ref4","first-page":"119","article-title":"using genetic Algorithms to Design Constant Weight Codes","author":"comellas","year":"1993","journal-title":"Applications Neural Networks Telecommun"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/WICT.2015.7489656"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48774-3_12"},{"key":"ref6","first-page":"141","article-title":"Discovery of Good Double and Triple Circulant Codes using Multiple Impulse Method","volume":"5","author":"askali","year":"2013","journal-title":"Advances in Computational Research"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ICMCS.2011.5945582"},{"key":"ref8","first-page":"153","article-title":"New Simulated Annealing Algorithm for Computing the Minimum Distance of Linear Block Codes","volume":"6","author":"aylaj","year":"2014","journal-title":"Advances in Computational Research"},{"key":"ref7","article-title":"A method to search good quasi-cyclic codes using new Simulated Annealing","author":"aylaj","year":"2014","journal-title":"international workshop on codes cryptography and communication systems El Jadida Morocco"},{"key":"ref2","first-page":"205","article-title":"Genetic Algorithms for Modelling and Optimization","volume":"184","author":"mccall","year":"0","journal-title":"J of Comuutational and Annlied Math"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.5958\/j.0975-8070.2.3.022"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4899-2174-1"},{"key":"ref20","article-title":"Decoding of Block Codes by using Genetic Algorithms and Permutations Set","volume":"5","author":"nouh","year":"2013","journal-title":"International Journal of Communication Networks and Information Security"},{"article-title":"Bounds on the size of linear codes","year":"1998","author":"brouwer","key":"ref22"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.412683"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref23","article-title":"Algebraic Coding Theory","author":"berlekamp","year":"1984","journal-title":"rev ed Aegean Park Press"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-0287-8_38"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.4236\/ijcns.2012.57052"}],"event":{"name":"2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS)","start":{"date-parts":[[2016,10,17]]},"location":"Marrakesh, Morocco","end":{"date-parts":[[2016,10,19]]}},"container-title":["2016 International Conference on Advanced Communication Systems and Information Security (ACOSIS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7830757\/7843912\/07843918.pdf?arnumber=7843918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T17:41:54Z","timestamp":1488390114000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7843918\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/acosis.2016.7843918","relation":{},"subject":[],"published":{"date-parts":[[2016,10]]}}}