{"id":"https://openalex.org/W2560595928","doi":"https://doi.org/10.1109/icumt.2016.7765383","title":"On fast exhaustive search of the minimum distance of linear block codes","display_name":"On fast exhaustive search of the minimum distance of linear block codes","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2560595928","doi":"https://doi.org/10.1109/icumt.2016.7765383","mag":"2560595928"},"language":"en","primary_location":{"id":"doi:10.1109/icumt.2016.7765383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2016.7765383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","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/A5035197025","display_name":"Jan Broul\u00edm","orcid":"https://orcid.org/0000-0003-4631-9933"},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]},{"id":"https://openalex.org/I92715842","display_name":"University of West Bohemia in Pilsen","ror":"https://ror.org/040t43x18","country_code":"CZ","type":"education","lineage":["https://openalex.org/I92715842"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Jan Broulim","raw_affiliation_strings":["Czech Technical University, Czech Republic","University of West Bohemia"],"affiliations":[{"raw_affiliation_string":"Czech Technical University, Czech Republic","institution_ids":["https://openalex.org/I44504214"]},{"raw_affiliation_string":"University of West Bohemia","institution_ids":["https://openalex.org/I92715842"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5104188210","display_name":"Vja\u010deslav Georgiev","orcid":null},"institutions":[{"id":"https://openalex.org/I44504214","display_name":"Czech Technical University in Prague","ror":"https://ror.org/03kqpb082","country_code":"CZ","type":"education","lineage":["https://openalex.org/I44504214"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Vjaceslav Georgiev","raw_affiliation_strings":["Czech Technical University, Czech Republic"],"affiliations":[{"raw_affiliation_string":"Czech Technical University, Czech Republic","institution_ids":["https://openalex.org/I44504214"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049494866","display_name":"Nikolaos V. Boulgouris","orcid":"https://orcid.org/0000-0002-5382-6856"},"institutions":[{"id":"https://openalex.org/I59433898","display_name":"Brunel University of London","ror":"https://ror.org/00dn4t376","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I59433898"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Nikolaos V. Boulgouris","raw_affiliation_strings":["Brunel University London, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Brunel University London, United Kingdom","institution_ids":["https://openalex.org/I59433898"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5035197025"],"corresponding_institution_ids":["https://openalex.org/I44504214","https://openalex.org/I92715842"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16299127,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"36","issue":null,"first_page":"342","last_page":"345"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9993000030517578,"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.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9977999925613403,"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/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9961000084877014,"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/computer-science","display_name":"Computer science","score":0.8254811763763428},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.49511900544166565},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49198219180107117},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4854043424129486},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.42469415068626404},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.41196703910827637}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8254811763763428},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.49511900544166565},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49198219180107117},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4854043424129486},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.42469415068626404},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.41196703910827637},{"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},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icumt.2016.7765383","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2016.7765383","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W7241855","https://openalex.org/W58580312","https://openalex.org/W1605867128","https://openalex.org/W1964402820","https://openalex.org/W1980073965","https://openalex.org/W1985179127","https://openalex.org/W1995875735","https://openalex.org/W1996226010","https://openalex.org/W2002403349","https://openalex.org/W2050773586","https://openalex.org/W2110841034","https://openalex.org/W2121606987","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2135764410","https://openalex.org/W2137885082","https://openalex.org/W2151360650","https://openalex.org/W2157702143","https://openalex.org/W2173776306","https://openalex.org/W2342204193","https://openalex.org/W2987657883","https://openalex.org/W4234572373","https://openalex.org/W6600302457","https://openalex.org/W6636067299"],"related_works":["https://openalex.org/W4401278057","https://openalex.org/W2056396287","https://openalex.org/W2100349471","https://openalex.org/W2393888177","https://openalex.org/W2544423928","https://openalex.org/W2132996594","https://openalex.org/W2115794623","https://openalex.org/W2360264381","https://openalex.org/W2067173559","https://openalex.org/W2148738811"],"abstract_inverted_index":{"Code":[0],"design":[1,77],"and":[2,84],"assessment":[3],"can":[4,85],"be":[5,86],"a":[6,32,36,79],"computationally":[7],"intensive":[8],"task":[9],"because":[10],"of":[11,35,42,81],"billions":[12],"operations":[13],"needed":[14],"for":[15,27,39,75],"code":[16,76,82],"evaluation.":[17],"Therefore,":[18],"it":[19],"is":[20,49,65],"important":[21],"that":[22],"fast":[23],"algorithms":[24,74],"are":[25],"devised":[26],"minimum":[28,44],"distance.":[29,45],"We":[30],"propose":[31],"scalable":[33],"variant":[34],"known":[37],"algorithm":[38,48,64],"exhaustive":[40,61],"search":[41],"the":[43,60],"The":[46,63],"proposed":[47],"based":[50],"on":[51,89],"smart":[52],"thread":[53],"management":[54],"in":[55,70],"order":[56],"to":[57],"speed":[58],"up":[59],"search.":[62],"particularly":[66],"efficient":[67],"when":[68],"applied":[69],"combination":[71],"with":[72],"genetic":[73],"as":[78],"part":[80],"evaluation":[83],"easily":[87],"deployed":[88],"grid":[90],"or":[91],"cloud":[92],"computing":[93],"systems.":[94]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}