{"id":"https://openalex.org/W2541844300","doi":"https://doi.org/10.1109/wincom.2015.7381301","title":"Construction of cyclic one-step majority-logic decodable codes using genetic algorithms","display_name":"Construction of cyclic one-step majority-logic decodable codes using genetic algorithms","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2541844300","doi":"https://doi.org/10.1109/wincom.2015.7381301","mag":"2541844300"},"language":"en","primary_location":{"id":"doi:10.1109/wincom.2015.7381301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wincom.2015.7381301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074624045","display_name":"Anouar Yatribi","orcid":null},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Anouar Yatribi","raw_affiliation_strings":["Mohammed V University SIME Lab, TSE Team, ENSIAS, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mohammed V University SIME Lab, TSE Team, ENSIAS, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070165644","display_name":"Fouad Ayoub","orcid":"https://orcid.org/0000-0001-6488-5301"},"institutions":[{"id":"https://openalex.org/I4210104250","display_name":"Laboratoire de Recherche Scientifique","ror":"https://ror.org/00sbgyf60","country_code":"FR","type":"nonprofit","lineage":["https://openalex.org/I4210104250"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Fouad Ayoub","raw_affiliation_strings":["CRMEF LaREAMA Lab, MTIC Team, Kenitra, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CRMEF LaREAMA Lab, MTIC Team, Kenitra, Morocco","institution_ids":["https://openalex.org/I4210104250"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083717072","display_name":"Mostafa Belkasmi","orcid":"https://orcid.org/0000-0002-2790-0784"},"institutions":[{"id":"https://openalex.org/I126477371","display_name":"Mohammed V University","ror":"https://ror.org/00r8w8f84","country_code":"MA","type":"education","lineage":["https://openalex.org/I126477371"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Mostafa Belkasmi","raw_affiliation_strings":["Mohammed V University SIME Lab, TSE Team, ENSIAS, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Mohammed V University SIME Lab, TSE Team, ENSIAS, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5295,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6311995,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"4","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9868999719619751,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/idempotence","display_name":"Idempotence","score":0.6891630291938782},{"id":"https://openalex.org/keywords/coset","display_name":"Coset","score":0.6213991045951843},{"id":"https://openalex.org/keywords/modulo","display_name":"Modulo","score":0.6043444275856018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5852898359298706},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5833614468574524},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5511844754219055},{"id":"https://openalex.org/keywords/reed\u2013muller-code","display_name":"Reed\u2013Muller code","score":0.4884249269962311},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.4804774820804596},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4550408720970154},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43844470381736755},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41127437353134155},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38846874237060547},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34381943941116333},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.32277628779411316},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2901819050312042},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.18973666429519653},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.15014803409576416}],"concepts":[{"id":"https://openalex.org/C172252984","wikidata":"https://www.wikidata.org/wiki/Q368988","display_name":"Idempotence","level":2,"score":0.6891630291938782},{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.6213991045951843},{"id":"https://openalex.org/C54732982","wikidata":"https://www.wikidata.org/wiki/Q1415345","display_name":"Modulo","level":2,"score":0.6043444275856018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5852898359298706},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5833614468574524},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5511844754219055},{"id":"https://openalex.org/C169021753","wikidata":"https://www.wikidata.org/wiki/Q201972","display_name":"Reed\u2013Muller code","level":5,"score":0.4884249269962311},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.4804774820804596},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4550408720970154},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43844470381736755},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41127437353134155},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38846874237060547},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34381943941116333},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32277628779411316},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2901819050312042},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.18973666429519653},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.15014803409576416},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wincom.2015.7381301","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wincom.2015.7381301","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1671348734","https://openalex.org/W1776583603","https://openalex.org/W1969562778","https://openalex.org/W1985800138","https://openalex.org/W2002703342","https://openalex.org/W2080717195","https://openalex.org/W2085145600","https://openalex.org/W2087595029","https://openalex.org/W2097571405","https://openalex.org/W2099940667","https://openalex.org/W2127342417","https://openalex.org/W2942537621","https://openalex.org/W4250843460","https://openalex.org/W6638158239"],"related_works":["https://openalex.org/W3096721566","https://openalex.org/W2161284257","https://openalex.org/W4389292288","https://openalex.org/W4210934707","https://openalex.org/W4307782542","https://openalex.org/W4366985329","https://openalex.org/W2037339745","https://openalex.org/W2952736220","https://openalex.org/W2137843273","https://openalex.org/W2603800327"],"abstract_inverted_index":{"In":[0,60],"[6],":[1],"a":[2,65],"construction":[3,90],"of":[4,29],"cyclic":[5],"one-step":[6],"majority-logic":[7],"decodable":[8],"codes":[9,96],"based":[10],"on":[11],"idempotent":[12],"polynomials":[13],"is":[14,91],"given.":[15],"However,":[16],"the":[17,20,40,52,55],"search":[18,53],"for":[19,54],"feasible":[21],"Parity-Check":[22],"Idempotent":[23],"runs":[24],"through":[25],"all":[26],"possible":[27],"combinations":[28],"cyclotomic":[30],"cosets":[31],"modulo":[32],"n,":[33],"satisfying":[34],"some":[35],"algebraic":[36],"constraints,":[37],"consequently,":[38],"increasing":[39],"code":[41],"length":[42],"may":[43],"result":[44],"in":[45],"very":[46,92],"large":[47],"dimension":[48],"space":[49],"search,":[50],"and":[51,74,94,100],"solution":[56],"becomes":[57],"more":[58],"difficult.":[59],"this":[61],"paper,":[62],"we":[63],"propose":[64],"Genetic":[66],"Algorithm":[67],"that":[68],"aimes":[69],"to":[70],"construct":[71],"new":[72],"moderate":[73],"high":[75,86,98,101],"lengths":[76],"Binary":[77],"Cyclic":[78],"OSMLD":[79],"codes,":[80,84],"considered":[81],"as":[82],"LDPC":[83],"with":[85,97],"correction":[87],"capacities.":[88],"Our":[89],"efficient":[93],"provide":[95],"lenghts":[99],"rates.":[102]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2016,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}