{"id":"https://openalex.org/W2127108424","doi":"https://doi.org/10.1109/isit.2008.4594995","title":"On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes","display_name":"On the probabilistic computation algorithm for the minimum-size stopping sets of LDPC codes","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2127108424","doi":"https://doi.org/10.1109/isit.2008.4594995","mag":"2127108424"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4594995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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/A5069425103","display_name":"Masanori Hirotomo","orcid":"https://orcid.org/0009-0003-6990-1456"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Masanori Hirotomo","raw_affiliation_strings":["Hyogo Institute of Information Education Foundation, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hyogo Institute of Information Education Foundation, Kobe, Japan","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110390012","display_name":"Yoshiho Konishi","orcid":null},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoshiho Konishi","raw_affiliation_strings":["Graduate School of Engineering, Kobe University, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073367713","display_name":"Masakatu Morii","orcid":"https://orcid.org/0000-0001-7942-5914"},"institutions":[{"id":"https://openalex.org/I65837984","display_name":"Kobe University","ror":"https://ror.org/03tgsfw79","country_code":"JP","type":"education","lineage":["https://openalex.org/I65837984"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Masakatu Morii","raw_affiliation_strings":["Graduate School of Engineering, Kobe University, Kobe, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Engineering, Kobe University, Kobe, Japan","institution_ids":["https://openalex.org/I65837984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.5255,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.854471,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"295","last_page":"299"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9962999820709229,"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.9959999918937683,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8240654468536377},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6632513403892517},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6612889766693115},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6538740992546082},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5968145728111267},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5488182306289673},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5189732909202576},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.4477522075176239},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.42208772897720337},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3389056921005249},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08354729413986206}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8240654468536377},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6632513403892517},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6612889766693115},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6538740992546082},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5968145728111267},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5488182306289673},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5189732909202576},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.4477522075176239},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.42208772897720337},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3389056921005249},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08354729413986206},{"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/isit.2008.4594995","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4594995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","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":17,"referenced_works":["https://openalex.org/W15432375","https://openalex.org/W1498552305","https://openalex.org/W1536493828","https://openalex.org/W1964402820","https://openalex.org/W1986899400","https://openalex.org/W1998242373","https://openalex.org/W2028750656","https://openalex.org/W2047776564","https://openalex.org/W2073081764","https://openalex.org/W2095882513","https://openalex.org/W2115193201","https://openalex.org/W2128765501","https://openalex.org/W2163496715","https://openalex.org/W2164585870","https://openalex.org/W2167943285","https://openalex.org/W4300188436","https://openalex.org/W6600591868"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2126543779","https://openalex.org/W2147429396","https://openalex.org/W2388289192","https://openalex.org/W2532556608","https://openalex.org/W2364567271","https://openalex.org/W2348051533","https://openalex.org/W1528661649","https://openalex.org/W2026275299","https://openalex.org/W2784016542"],"abstract_inverted_index":{"On":[0],"the":[1,5,28,42,45,49,60,73,78,94],"binary":[2],"erasure":[3],"channel,":[4],"performance":[6],"of":[7,31,34,47,58,63,76,81,84,97],"LDPC":[8,35,86],"codes":[9],"decoded":[10],"by":[11,16],"iterative":[12],"algorithms":[13],"is":[14],"estimated":[15],"small-size":[17],"stopping":[18,32,51,64,82,98],"sets.":[19],"We":[20],"have":[21],"proposed":[22],"a":[23],"probabilistic":[24],"algorithm":[25],"for":[26],"computing":[27,77],"minimum":[29,61,79,95],"size":[30,62,80,96],"sets":[33,65,83,99],"codes.":[36,87],"In":[37,88],"this":[38],"paper,":[39],"we":[40,71,91],"analyze":[41],"probability":[43,57],"and":[44,53],"complexity":[46],"finding":[48],"minimum-size":[50],"sets,":[52],"give":[54],"an":[55],"error":[56],"determining":[59],"after":[66],"processing":[67],"our":[68],"algorithm.":[69],"Additionally,":[70],"show":[72],"numerical":[74],"results":[75],"several":[85],"these":[89],"result,":[90],"could":[92],"compute":[93],"with":[100],"high":[101],"reliability.":[102]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}