{"id":"https://openalex.org/W2600533005","doi":null,"title":"Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs","display_name":"Constructing Algorithms of Large-Girth LDPC Codes Based on the Shortest Paths in Tanner Graphs","publication_year":2011,"publication_date":"2011-02-24","ids":{"openalex":"https://openalex.org/W2600533005","mag":"2600533005"},"language":"en","primary_location":{"id":"mag:2600533005","doi":null,"is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/2011030310Fy/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null},"volume":null,"type":"article","indexed_in":[],"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/A5113636585","display_name":"Kenya Sugihara","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenya Sugihara","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hideo Yoshida","orcid":"https://orcid.org/0000-0003-1178-8748","observed_orcids":["https://orcid.org/0000-0003-1178-8748"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hideo Yoshida","raw_affiliation_strings":[],"raw_orcid":"https://orcid.org/0000-0003-1178-8748","affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.46783199,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"110","issue":"442","first_page":"69","last_page":"74"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9984999895095825,"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.9984999895095825,"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.0008999999845400453,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.00019999999494757503,"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/tanner-graph","display_name":"Tanner graph","score":0.8370000123977661},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.9070000052452087},{"id":"https://openalex.org/keywords/code-construction","display_name":"code construction","score":0.6010000109672546},{"id":"https://openalex.org/keywords/girth","display_name":"girth","score":0.7250000238418579},{"id":"https://openalex.org/keywords/low-density-parity-check-codes","display_name":"LDPC codes","score":0.7070000171661377}],"concepts":[{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6734121441841125},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5430270433425903},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5361402630805969},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.48201432824134827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4473525583744049},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43492719531059265},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.43175217509269714},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4235430359840393},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.1883290708065033},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.17005380988121033}],"mesh":[],"locations_count":1,"locations":[{"id":"mag:2600533005","doi":null,"is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/2011030310Fy/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2323832733","https://openalex.org/W2099373325","https://openalex.org/W3192350410","https://openalex.org/W1979450650","https://openalex.org/W2368918617","https://openalex.org/W1964402820","https://openalex.org/W1813544306","https://openalex.org/W2111404448","https://openalex.org/W2109840753","https://openalex.org/W2080361462"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2017-04-07T00:00:00"}