{"id":"https://openalex.org/W2164585870","doi":"https://doi.org/10.1109/itw.2008.4578623","title":"A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes","display_name":"A probabilistic algorithm for finding the minimum-size stopping sets of LDPC codes","publication_year":2008,"publication_date":"2008-05-01","ids":{"openalex":"https://openalex.org/W2164585870","doi":"https://doi.org/10.1109/itw.2008.4578623","mag":"2164585870"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2008.4578623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2008.4578623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Information Theory Workshop","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, 650-0044 Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hyogo Institute of Information Education Foundation, Kobe, 650-0044 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.9069,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.88469798,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"it 48","issue":null,"first_page":"66","last_page":"70"},"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.9977999925613403,"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.9976000189781189,"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.8174197673797607},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6561239957809448},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6228377819061279},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.48872923851013184},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.47962936758995056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44938743114471436},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.44770270586013794},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.30753958225250244},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10825851559638977},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.0949261486530304}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8174197673797607},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6561239957809448},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6228377819061279},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.48872923851013184},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.47962936758995056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44938743114471436},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.44770270586013794},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.30753958225250244},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10825851559638977},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.0949261486530304},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2008.4578623","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2008.4578623","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE Information Theory Workshop","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":21,"referenced_works":["https://openalex.org/W15432375","https://openalex.org/W1498552305","https://openalex.org/W1536493828","https://openalex.org/W1617021041","https://openalex.org/W1964402820","https://openalex.org/W1976450468","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/W2099250555","https://openalex.org/W2115193201","https://openalex.org/W2128765501","https://openalex.org/W2163496715","https://openalex.org/W2167943285","https://openalex.org/W4300188436","https://openalex.org/W6600591868","https://openalex.org/W6636640841","https://openalex.org/W6674742683"],"related_works":["https://openalex.org/W2156055959","https://openalex.org/W1525070854","https://openalex.org/W1656451834","https://openalex.org/W4386075170","https://openalex.org/W4309132699","https://openalex.org/W4297912917","https://openalex.org/W2110271616","https://openalex.org/W2312958613","https://openalex.org/W2964304063","https://openalex.org/W2766747631"],"abstract_inverted_index":{"On":[0],"the":[1,5,34,54,69],"binary":[2],"erasure":[3],"channel,":[4],"performance":[6],"of":[7,37,40,72,75,78],"LDPC":[8,41,76],"codes":[9,77],"decoded":[10],"by":[11,16,52,97],"iterative":[12],"algorithms":[13],"is":[14],"dominated":[15],"small-size":[17,49,57],"stopping":[18,22,38,50,58,73,92],"sets,":[19],"especially":[20],"minimal":[21],"sets.":[23],"In":[24,43,63],"this":[25,44],"paper,":[26],"we":[27,46,66],"propose":[28],"a":[29],"probabilistic":[30],"algorithm":[31],"for":[32],"computing":[33],"minimum":[35,70],"size":[36,71],"sets":[39,51,59,74,93],"codes.":[42],"algorithm,":[45],"generate":[47],"efficiently":[48],"using":[53],"relation":[55],"between":[56],"and":[60,83,88],"low-weight":[61],"codewords.":[62],"numerical":[64],"experiments,":[65],"could":[67,89],"compute":[68],"length":[79],"about":[80],"500,":[81],"1000":[82],"5000":[84],"with":[85],"high":[86],"reliability,":[87],"find":[90],"smaller":[91],"than":[94],"that":[95],"found":[96],"conventional":[98],"methods.":[99]},"counts_by_year":[{"year":2015,"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"}