{"id":"https://openalex.org/W2111166495","doi":"https://doi.org/10.1109/itw.2005.1531867","title":"A note on a decoding algorithm of codes on graphs with small loops","display_name":"A note on a decoding algorithm of codes on graphs with small loops","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2111166495","doi":"https://doi.org/10.1109/itw.2005.1531867","mag":"2111166495"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2005.1531867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2005.1531867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Information Theory Workshop, 2005.","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/A5087337770","display_name":"Naoto Kobayashi","orcid":"https://orcid.org/0000-0003-4578-2619"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"N. Kobayashi","raw_affiliation_strings":["School of Science & Engineering, Waseda University, Tokyo, Japan","School of Science and Engineering, Waseda University, Tokyo Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science & Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"School of Science and Engineering, Waseda University, Tokyo Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001323780","display_name":"T. Matsushima","orcid":"https://orcid.org/0000-0003-1085-3720"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"T. Matsushima","raw_affiliation_strings":["School of Science & Engineering, Waseda University, Tokyo, Japan","School of Science and Engineering, Waseda University, Tokyo Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science & Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"School of Science and Engineering, Waseda University, Tokyo Japan","institution_ids":["https://openalex.org/I150744194"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025082609","display_name":"Shigeichi Hirasawa","orcid":"https://orcid.org/0009-0003-0924-1038"},"institutions":[{"id":"https://openalex.org/I150744194","display_name":"Waseda University","ror":"https://ror.org/00ntfnx83","country_code":"JP","type":"education","lineage":["https://openalex.org/I150744194"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"S. Hirasawa","raw_affiliation_strings":["School of Science & Engineering, Waseda University, Tokyo, Japan","School of Science and Engineering, Waseda University, Tokyo Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Science & Engineering, Waseda University, Tokyo, Japan","institution_ids":["https://openalex.org/I150744194"]},{"raw_affiliation_string":"School of Science and Engineering, Waseda University, Tokyo Japan","institution_ids":["https://openalex.org/I150744194"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.19024893,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"tr03 1","issue":null,"first_page":"5 pp.","last_page":"5 pp."},"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.9873999953269958,"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/T12029","display_name":"DNA and Biological Computing","score":0.9869999885559082,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.7158197164535522},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7130945920944214},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.6895647048950195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6569674015045166},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6395788788795471},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.619583249092102},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6011342406272888},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.5833246111869812},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5665462613105774},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5352357625961304},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.441829651594162},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36383670568466187},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.291627436876297},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.2629220485687256},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17093315720558167},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.1694692075252533},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.12287592887878418},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08130857348442078}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.7158197164535522},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7130945920944214},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.6895647048950195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6569674015045166},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6395788788795471},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.619583249092102},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6011342406272888},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.5833246111869812},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5665462613105774},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5352357625961304},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.441829651594162},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36383670568466187},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.291627436876297},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.2629220485687256},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17093315720558167},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.1694692075252533},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.12287592887878418},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08130857348442078},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"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/itw.2005.1531867","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2005.1531867","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Information Theory Workshop, 2005.","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":9,"referenced_works":["https://openalex.org/W568057840","https://openalex.org/W2026129786","https://openalex.org/W2115104320","https://openalex.org/W2128765501","https://openalex.org/W2135764410","https://openalex.org/W2137813581","https://openalex.org/W2156938362","https://openalex.org/W4256648168","https://openalex.org/W4300563537"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2042522304","https://openalex.org/W2141877208"],"abstract_inverted_index":{"The":[0,16,31],"best-known":[1],"algorithm":[2,14,21,95],"for":[3,96],"the":[4,12,34,57,84,104],"decoding":[5,78,94],"of":[6,33,40],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10],"is":[11,18,87],"sum-product":[13],"(SPA).":[15],"SPA":[17,35],"a":[19,23,27,38,43,50,66,77,80,99],"message-passing":[20],"on":[22,37,79],"graphical":[24,51],"model":[25,52],"called":[26],"factor":[28],"graph":[29],"(FG).":[30],"performance":[32,105],"depends":[36],"structure":[39],"loops":[41,48],"in":[42,49],"FG.":[44],"Pearl":[45],"showed":[46],"that":[47],"could":[53],"be":[54],"erased":[55],"by":[56],"clustering":[58,85],"method.":[59],"This":[60],"method":[61,86,108],"clusters":[62],"plural":[63],"nodes":[64],"into":[65],"single":[67],"node.":[68],"In":[69],"this":[70,107],"paper,":[71],"we":[72,90],"show":[73],"several":[74],"examples":[75],"about":[76],"FG":[81],"to":[82],"which":[83],"applied.":[88],"And":[89],"propose":[91],"an":[92],"efficient":[93],"it.":[97],"For":[98],"binary":[100],"erasure":[101],"channel":[102],"(BEC),":[103],"with":[106],"goes":[109],"up":[110],"clearly.":[111]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}