{"id":"https://openalex.org/W2039633855","doi":"https://doi.org/10.1109/icmcs.2012.6320261","title":"An efficient method to find the minimum distance of linear block codes","display_name":"An efficient method to find the minimum distance of linear block codes","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2039633855","doi":"https://doi.org/10.1109/icmcs.2012.6320261","mag":"2039633855"},"language":"en","primary_location":{"id":"doi:10.1109/icmcs.2012.6320261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2012.6320261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on Multimedia Computing and Systems","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/A5102142426","display_name":"Mohamed Askali","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":"Mohamed Askali","raw_affiliation_strings":["SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]},{"raw_affiliation_string":"MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028452033","display_name":"Sa\u00efd Nouh","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":"Said Nouh","raw_affiliation_strings":["SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]},{"raw_affiliation_string":"MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco","institution_ids":[]}]},{"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":["SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"SIME Labo, ENSIAS, Mohammed V Souissi University, Rabat, Morocco","institution_ids":["https://openalex.org/I126477371"]},{"raw_affiliation_string":"MohammedV-Souisi University, SIME Labo, ENSIAS, Rabat, Morocco","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I126477371"],"apc_list":null,"apc_paid":null,"fwci":1.3008,"has_fulltext":false,"cited_by_count":10,"citation_normalized_percentile":{"value":0.80083903,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"318","last_page":"324"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11130","display_name":"Coding theory and cryptography","score":1.0,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.7813202142715454},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.7269411683082581},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.7108659148216248},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.635529100894928},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5397940278053284},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5306984782218933},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5209937691688538},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5034920573234558},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48447179794311523},{"id":"https://openalex.org/keywords/constant-weight-code","display_name":"Constant-weight code","score":0.4503612816333771},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.4450160264968872},{"id":"https://openalex.org/keywords/polynomial-code","display_name":"Polynomial code","score":0.439935564994812},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4268406629562378},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3278828263282776},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.32060563564300537},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2530379891395569}],"concepts":[{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.7813202142715454},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.7269411683082581},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.7108659148216248},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.635529100894928},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5397940278053284},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5306984782218933},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5209937691688538},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5034920573234558},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48447179794311523},{"id":"https://openalex.org/C197242373","wikidata":"https://www.wikidata.org/wiki/Q5163613","display_name":"Constant-weight code","level":5,"score":0.4503612816333771},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.4450160264968872},{"id":"https://openalex.org/C39635130","wikidata":"https://www.wikidata.org/wiki/Q7226636","display_name":"Polynomial code","level":5,"score":0.439935564994812},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4268406629562378},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3278828263282776},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.32060563564300537},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2530379891395569},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"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/icmcs.2012.6320261","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icmcs.2012.6320261","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on Multimedia Computing and Systems","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":15,"referenced_works":["https://openalex.org/W1556443961","https://openalex.org/W1606480398","https://openalex.org/W2063434839","https://openalex.org/W2097701940","https://openalex.org/W2098652101","https://openalex.org/W2098935550","https://openalex.org/W2099116293","https://openalex.org/W2106827464","https://openalex.org/W2133126019","https://openalex.org/W2134547208","https://openalex.org/W2157795960","https://openalex.org/W2165626072","https://openalex.org/W2963250629","https://openalex.org/W6676288605","https://openalex.org/W6679608262"],"related_works":["https://openalex.org/W1979611478","https://openalex.org/W1584569498","https://openalex.org/W2887855805","https://openalex.org/W3022210012","https://openalex.org/W2157678969","https://openalex.org/W2093027700","https://openalex.org/W1995463680","https://openalex.org/W2069803497","https://openalex.org/W2048714908","https://openalex.org/W1581117158"],"abstract_inverted_index":{"Finding":[0],"the":[1,34,48,62,72,84,88,96,162,166],"minimum":[2,73,85,153,163],"distance":[3,86,164],"of":[4,24,42,50,87,141,161],"linear":[5,89,103,145],"codes":[6,104,150],"is":[7,27,81,99,107,118,168],"in":[8,45],"general":[9,102],"a":[10,40,57,119,134,138,157],"NP-hard":[11],"problem,":[12],"we":[13,128,155],"propose":[14],"an":[15],"efficient":[16],"algorithm":[17,98,132],"to":[18,28,83,111,125],"attack":[19],"this":[20,25],"problem.":[21],"The":[22],"principle":[23],"approach":[26],"search":[29],"code":[30,36,66,76],"words":[31,47,67],"locally":[32],"around":[33],"all-zero":[35],"word":[37],"perturbed":[38],"by":[39,56],"level":[41],"noise":[43,51],"magnitude,":[44],"other":[46],"maximum":[49],"that":[52,61,95,130],"can":[53],"be":[54],"corrected":[55],"Soft-In":[58],"decoder,":[59],"anticipating":[60],"resultant":[63],"nearest":[64],"non-zero":[65],"will":[68],"most":[69],"likely":[70],"contain":[71],"Hamming":[74,79],"weight":[75,80],"word,":[77],"whose":[78],"equal":[82],"code.":[90],"A":[91],"numerous":[92],"results":[93],"prove":[94],"proposed":[97],"valid":[100],"for":[101,122],"and":[105,148],"it":[106,117],"very":[108],"fast":[109,139],"comparing":[110],"all":[112],"others":[113],"known":[114],"techniques,":[115],"therefore":[116],"good":[120,158],"tool":[121],"computing.":[123],"Comparing":[124],"Joanna's":[126],"works,":[127],"proof":[129],"our":[131],"has":[133],"low":[135],"complexity":[136],"with":[137,151],"time":[140],"execution.":[142],"For":[143],"some":[144],"RQs,":[146],"QDCs":[147],"BCHs":[149],"unknown":[152],"distance,":[154],"give":[156],"estimation":[159],"(true)":[160],"where":[165],"length":[167],"less":[169],"than":[170],"439.":[171]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}