{"id":"https://openalex.org/W2803975241","doi":"https://doi.org/10.1109/commnet.2018.8360246","title":"New ant colony optimization for searching the minimum distance for linear codes","display_name":"New ant colony optimization for searching the minimum distance for linear codes","publication_year":2018,"publication_date":"2018-04-01","ids":{"openalex":"https://openalex.org/W2803975241","doi":"https://doi.org/10.1109/commnet.2018.8360246","mag":"2803975241"},"language":"en","primary_location":{"id":"doi:10.1109/commnet.2018.8360246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/commnet.2018.8360246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","raw_type":"proceedings-article"},"type":"article","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/A5060140675","display_name":"Hicham Bouzkraoui","orcid":null},"institutions":[{"id":"https://openalex.org/I3121676899","display_name":"Universit\u00e9 Ibn-Tofail","ror":"https://ror.org/02wj89n04","country_code":"MA","type":"education","lineage":["https://openalex.org/I3121676899"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Hicham Bouzkraoui","raw_affiliation_strings":["MISC Laboratory, Ibn Tofail University, Kenitra, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MISC Laboratory, Ibn Tofail University, Kenitra, Morocco","institution_ids":["https://openalex.org/I3121676899"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016544353","display_name":"Ahmed Azouaoui","orcid":"https://orcid.org/0000-0002-0411-3884"},"institutions":[{"id":"https://openalex.org/I4210125507","display_name":"Chouaib Doukkali University","ror":"https://ror.org/036kgyt43","country_code":"MA","type":"education","lineage":["https://openalex.org/I4210125507"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Ahmed Azouaoui","raw_affiliation_strings":["Department of Computer Science, Chouaib Doukkali University, El Jadida, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Chouaib Doukkali University, El Jadida, Morocco","institution_ids":["https://openalex.org/I4210125507"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070411533","display_name":"Youssef Hadi","orcid":"https://orcid.org/0000-0003-1810-6877"},"institutions":[{"id":"https://openalex.org/I3121676899","display_name":"Universit\u00e9 Ibn-Tofail","ror":"https://ror.org/02wj89n04","country_code":"MA","type":"education","lineage":["https://openalex.org/I3121676899"]}],"countries":["MA"],"is_corresponding":false,"raw_author_name":"Youssef Hadi","raw_affiliation_strings":["MISC Laboratory, Ibn Tofail University, Kenitra, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MISC Laboratory, Ibn Tofail University, Kenitra, Morocco","institution_ids":["https://openalex.org/I3121676899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.1827,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.84118092,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"330","issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"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"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9979000091552734,"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"}},{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.9958000183105469,"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.9926999807357788,"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/metaheuristic","display_name":"Metaheuristic","score":0.8522433042526245},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.7834287881851196},{"id":"https://openalex.org/keywords/swarm-intelligence","display_name":"Swarm intelligence","score":0.7349188327789307},{"id":"https://openalex.org/keywords/parallel-metaheuristic","display_name":"Parallel metaheuristic","score":0.727647602558136},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6652606129646301},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6394407749176025},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5157404541969299},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4947635531425476},{"id":"https://openalex.org/keywords/ant-colony","display_name":"Ant colony","score":0.491583913564682},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30184054374694824},{"id":"https://openalex.org/keywords/particle-swarm-optimization","display_name":"Particle swarm optimization","score":0.22268778085708618},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.21791428327560425},{"id":"https://openalex.org/keywords/meta-optimization","display_name":"Meta-optimization","score":0.1358923316001892}],"concepts":[{"id":"https://openalex.org/C109718341","wikidata":"https://www.wikidata.org/wiki/Q1385229","display_name":"Metaheuristic","level":2,"score":0.8522433042526245},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.7834287881851196},{"id":"https://openalex.org/C119487961","wikidata":"https://www.wikidata.org/wiki/Q863960","display_name":"Swarm intelligence","level":3,"score":0.7349188327789307},{"id":"https://openalex.org/C28767586","wikidata":"https://www.wikidata.org/wiki/Q7135006","display_name":"Parallel metaheuristic","level":4,"score":0.727647602558136},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6652606129646301},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6394407749176025},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5157404541969299},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4947635531425476},{"id":"https://openalex.org/C60891933","wikidata":"https://www.wikidata.org/wiki/Q796575","display_name":"Ant colony","level":3,"score":0.491583913564682},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30184054374694824},{"id":"https://openalex.org/C85617194","wikidata":"https://www.wikidata.org/wiki/Q2072794","display_name":"Particle swarm optimization","level":2,"score":0.22268778085708618},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.21791428327560425},{"id":"https://openalex.org/C4935549","wikidata":"https://www.wikidata.org/wiki/Q6822261","display_name":"Meta-optimization","level":3,"score":0.1358923316001892},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/commnet.2018.8360246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/commnet.2018.8360246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 International Conference on Advanced Communication Technologies and Networking (CommNet)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Zero hunger","score":0.5899999737739563,"id":"https://metadata.un.org/sdg/2"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W17510161","https://openalex.org/W1510132879","https://openalex.org/W1536493828","https://openalex.org/W1897146492","https://openalex.org/W1974598414","https://openalex.org/W2013254331","https://openalex.org/W2093465763","https://openalex.org/W2099250555","https://openalex.org/W2151512810","https://openalex.org/W2167920923","https://openalex.org/W2399934975","https://openalex.org/W2481373004","https://openalex.org/W6721540298"],"related_works":["https://openalex.org/W1611875833","https://openalex.org/W1547053391","https://openalex.org/W1521781013","https://openalex.org/W2462483068","https://openalex.org/W1588949866","https://openalex.org/W2361792200","https://openalex.org/W2394153495","https://openalex.org/W2388217074","https://openalex.org/W2363465025","https://openalex.org/W2300135944"],"abstract_inverted_index":{"In":[0,53],"coding":[1],"theory,":[2],"finding":[3],"minimum":[4],"distance":[5],"remains":[6],"one":[7,66],"of":[8,38,67,81],"the":[9,47,68,78,85],"most":[10],"open":[11],"problems,":[12],"actually":[13],"it":[14],"was":[15],"proven":[16],"to":[17,34,83,88],"be":[18],"an":[19,105],"NP-hard":[20],"type.":[21],"Therefore":[22],"classical":[23],"algorithms":[24],"become":[25],"impracticable":[26],"for":[27],"large":[28],"codes.":[29],"Metaheuristic":[30],"approaches":[31],"come":[32],"out":[33],"tackle":[35],"this":[36,54,59],"kind":[37],"problems":[39],"by":[40],"producing":[41],"\u201cgood\u201d":[42],"solutions":[43],"but":[44],"eventually":[45],"not":[46],"best":[48,86],"at":[49],"reasonable":[50],"computational":[51,111],"cost.":[52,112],"paper":[55],"we":[56],"will":[57],"attack":[58],"problem":[60],"using":[61],"Ant":[62],"Colony":[63],"Optimization":[64],"(ACO),":[65],"successful":[69],"swarm":[70],"intelligence":[71],"metaheuristic":[72],"methods,":[73],"derived":[74],"from":[75],"nature,":[76],"especially":[77],"collective":[79],"behavior":[80],"ants":[82],"find":[84],"path":[87],"food,":[89],"our":[90],"implementation":[91],"tested":[92],"on":[93],"linear":[94],"codes":[95],"then":[96],"compared":[97],"with":[98],"previous":[99],"works.":[100],"The":[101],"obtained":[102],"results":[103],"show":[104],"improvement":[106],"in":[107],"solution":[108],"accuracy":[109],"and":[110]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}