{"id":"https://openalex.org/W2167619928","doi":"https://doi.org/10.1109/isit.2004.1365512","title":"Approximate algorithms for computing the minimum distance of low-density parity-check codes","display_name":"Approximate algorithms for computing the minimum distance of low-density parity-check codes","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2167619928","doi":"https://doi.org/10.1109/isit.2004.1365512","mag":"2167619928"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5047230504","display_name":"Xiaoyu Hu","orcid":"https://orcid.org/0000-0003-0116-1183"},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Xiao-Yu Hu","raw_affiliation_strings":["IBM Zurich Research Laboratory, Ruschlikon, Switzerland","IBM Zurich Research Labs., R\u00fcschlikon, Switzerland"],"affiliations":[{"raw_affiliation_string":"IBM Zurich Research Laboratory, Ruschlikon, Switzerland","institution_ids":["https://openalex.org/I4210126328"]},{"raw_affiliation_string":"IBM Zurich Research Labs., R\u00fcschlikon, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059876548","display_name":"M.P.C. Fossorier","orcid":"https://orcid.org/0000-0002-3646-2050"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.P.C. Fossorier","raw_affiliation_strings":["Department Electrical Engineering, University of Hawaii, Manoa, Honolulu, HI, USA"],"affiliations":[{"raw_affiliation_string":"Department Electrical Engineering, University of Hawaii, Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043271107","display_name":"Evangelos Eleftheriou","orcid":"https://orcid.org/0000-0002-3826-5931"},"institutions":[{"id":"https://openalex.org/I4210126328","display_name":"IBM Research - Zurich","ror":"https://ror.org/02js37d36","country_code":"CH","type":"facility","lineage":["https://openalex.org/I1341412227","https://openalex.org/I4210114115","https://openalex.org/I4210126328"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"E. Eleftheriou","raw_affiliation_strings":["IBM Zurich Research Laboratory, Ruschlikon, Switzerland"],"affiliations":[{"raw_affiliation_string":"IBM Zurich Research Laboratory, Ruschlikon, Switzerland","institution_ids":["https://openalex.org/I4210126328"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5047230504"],"corresponding_institution_ids":["https://openalex.org/I4210126328"],"apc_list":null,"apc_paid":null,"fwci":0.4635,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.73198447,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"475","last_page":"475"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":1.0,"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":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9987000226974487,"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/T11130","display_name":"Coding theory and cryptography","score":0.9972000122070312,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8744730949401855},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.6606858968734741},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5876715779304504},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.5511804819107056},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4550952613353729},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4358241558074951},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4241277873516083},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36367136240005493},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3460184335708618},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.270957350730896},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.09143298864364624}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8744730949401855},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.6606858968734741},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5876715779304504},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.5511804819107056},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4550952613353729},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4358241558074951},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4241277873516083},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36367136240005493},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3460184335708618},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.270957350730896},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.09143298864364624},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2004.1365512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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":6,"referenced_works":["https://openalex.org/W2098652101","https://openalex.org/W2119319086","https://openalex.org/W2129722701","https://openalex.org/W2133126019","https://openalex.org/W6679141107","https://openalex.org/W6679608262"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2903058006","https://openalex.org/W2102374550","https://openalex.org/W2047069332","https://openalex.org/W2352157218","https://openalex.org/W2806845321","https://openalex.org/W4293418541","https://openalex.org/W2393084694","https://openalex.org/W2171635774","https://openalex.org/W2129090975"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2],"family":[3],"of":[4,19],"randomized":[5],"approximate":[6],"algorithms,":[7],"called":[8],"nearest":[9],"nonzero":[10],"codewords":[11],"search":[12],"(NNCS),":[13],"for":[14],"computing":[15],"the":[16],"minimum":[17],"distance":[18],"low-density":[20],"parity-check":[21],"(LDPC)":[22],"codes,":[23],"including":[24],"Gallager-type":[25],"and":[26],"finite-geometry-type":[27],"codes.":[28]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}