{"id":"https://openalex.org/W2898246581","doi":"https://doi.org/10.1109/ita.2018.8503249","title":"Improved Trellis-Based Algorithm for Locating and Breaking Cycles in Bipartite Graphs with Applications to LDPC Codes","display_name":"Improved Trellis-Based Algorithm for Locating and Breaking Cycles in Bipartite Graphs with Applications to LDPC Codes","publication_year":2018,"publication_date":"2018-02-01","ids":{"openalex":"https://openalex.org/W2898246581","doi":"https://doi.org/10.1109/ita.2018.8503249","mag":"2898246581"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2018.8503249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2018.8503249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5038106711","display_name":"Juane Li","orcid":"https://orcid.org/0000-0003-1004-3453"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Juane Li","raw_affiliation_strings":["AppoTech USA, Sunnyvale, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"AppoTech USA, Sunnyvale, CA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100772114","display_name":"Shu Lin","orcid":"https://orcid.org/0000-0003-1401-7834"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shu Lin","raw_affiliation_strings":["University of California, Davis, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102938606","display_name":"Khaled Abdel-Ghaffar","orcid":"https://orcid.org/0000-0002-3128-0557"},"institutions":[{"id":"https://openalex.org/I84218800","display_name":"University of California, Davis","ror":"https://ror.org/05rrcem69","country_code":"US","type":"education","lineage":["https://openalex.org/I84218800"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Khaled Abdel-Ghaffar","raw_affiliation_strings":["University of California, Davis, Davis, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, Davis, CA, USA","institution_ids":["https://openalex.org/I84218800"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"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.12008632,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"8"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9919999837875366,"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"}},{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.991599977016449,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.8780931830406189},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8300990462303162},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7506184577941895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6589956879615784},{"id":"https://openalex.org/keywords/factor-graph","display_name":"Factor graph","score":0.632976770401001},{"id":"https://openalex.org/keywords/trellis","display_name":"Trellis (graph)","score":0.6121353507041931},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.536938488483429},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4902053475379944},{"id":"https://openalex.org/keywords/belief-propagation","display_name":"Belief propagation","score":0.4537239372730255},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3345913589000702},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31381887197494507},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.25125744938850403},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.15255364775657654}],"concepts":[{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.8780931830406189},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8300990462303162},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7506184577941895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6589956879615784},{"id":"https://openalex.org/C159246509","wikidata":"https://www.wikidata.org/wiki/Q5428725","display_name":"Factor graph","level":3,"score":0.632976770401001},{"id":"https://openalex.org/C2781235587","wikidata":"https://www.wikidata.org/wiki/Q7838009","display_name":"Trellis (graph)","level":3,"score":0.6121353507041931},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.536938488483429},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4902053475379944},{"id":"https://openalex.org/C152948882","wikidata":"https://www.wikidata.org/wiki/Q4060686","display_name":"Belief propagation","level":3,"score":0.4537239372730255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3345913589000702},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31381887197494507},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.25125744938850403},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.15255364775657654}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ita.2018.8503249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2018.8503249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Information Theory and Applications Workshop (ITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W628021441","https://openalex.org/W1531605720","https://openalex.org/W1640719368","https://openalex.org/W1991921359","https://openalex.org/W2067501233","https://openalex.org/W2113420173","https://openalex.org/W2121976196","https://openalex.org/W2134523634","https://openalex.org/W2138510063","https://openalex.org/W2154297943","https://openalex.org/W2154993501","https://openalex.org/W2160848826","https://openalex.org/W4256264271"],"related_works":["https://openalex.org/W2030180258","https://openalex.org/W4303096056","https://openalex.org/W26187695","https://openalex.org/W2153118538","https://openalex.org/W2127438025","https://openalex.org/W1493544699","https://openalex.org/W2127562763","https://openalex.org/W223727341","https://openalex.org/W2350834058","https://openalex.org/W2164397492"],"abstract_inverted_index":{"LDPC":[0,80],"codes":[1,106],"are":[2,23],"typically":[3],"decoded":[4],"using":[5],"belief":[6],"propagation":[7],"decoding":[8],"algorithms":[9],"applied":[10,74],"to":[11,48,75,94,111],"their":[12,91],"Tanner":[13,76,103],"graphs.":[14,53],"Cycles":[15],"of":[16,29,37,78,90,105],"short":[17],"lengths":[18],"in":[19,51,59,71,101],"these":[20],"graphs,":[21],"which":[22],"bipartite":[24,52],"graphs":[25,77,104],"representing":[26],"parity-check":[27,92],"equations":[28],"the":[30,35,38,64,82,88,96,102,113],"codes,":[31,81],"can":[32,86],"negatively":[33],"impact":[34],"performance":[36],"decoder.":[39],"In":[40],"this":[41],"paper,":[42],"a":[43],"trellis-based":[44],"algorithm":[45,55,85],"is":[46,56],"presented":[47],"locate":[49],"cycles":[50,100],"This":[54],"an":[57],"improvement":[58],"complexity":[60,97],"and":[61,115],"run-time":[62],"over":[63],"one":[65],"developed":[66],"by":[67],"Lan":[68],"et":[69],"al.":[70],"2004.":[72],"When":[73],"quasi-cyclic":[79],"newly":[83],"proposed":[84],"exploit":[87],"structure":[89],"matrices":[93],"cut":[95],"further.":[98],"Locating":[99],"allows":[107],"for":[108],"eliminating":[109],"them":[110],"increase":[112],"girth":[114],"thus":[116],"improve":[117],"performance.":[118]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}