{"id":"https://openalex.org/W2584123451","doi":"https://doi.org/10.1109/icspcs.2016.7843313","title":"An efficient algorithm for determining the girth and ACE distributions in LDPC code Tanner graphs","display_name":"An efficient algorithm for determining the girth and ACE distributions in LDPC code Tanner graphs","publication_year":2016,"publication_date":"2016-12-01","ids":{"openalex":"https://openalex.org/W2584123451","doi":"https://doi.org/10.1109/icspcs.2016.7843313","mag":"2584123451"},"language":"en","primary_location":{"id":"doi:10.1109/icspcs.2016.7843313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icspcs.2016.7843313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Signal Processing and Communication Systems (ICSPCS)","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/A5081367602","display_name":"Umar-Faruk Abdu-Aguye","orcid":"https://orcid.org/0000-0002-3753-2751"},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Umar-Faruk Abdu-Aguye","raw_affiliation_strings":["Electronics, and Mathematics, Plymouth University, Plymouth, UK"],"affiliations":[{"raw_affiliation_string":"Electronics, and Mathematics, Plymouth University, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077402042","display_name":"Marcel Ambroze","orcid":"https://orcid.org/0000-0001-9021-1095"},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Marcel Adrian Ambroze","raw_affiliation_strings":["Electronics, and Mathematics, Plymouth University, Plymouth, UK"],"affiliations":[{"raw_affiliation_string":"Electronics, and Mathematics, Plymouth University, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113824568","display_name":"Martin Tomlinson","orcid":null},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Martin Tomlinson","raw_affiliation_strings":["Electronics, and Mathematics, Plymouth University, Plymouth, UK"],"affiliations":[{"raw_affiliation_string":"Electronics, and Mathematics, Plymouth University, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5081367602"],"corresponding_institution_ids":["https://openalex.org/I897542642"],"apc_list":null,"apc_paid":null,"fwci":0.8898,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.80192775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"2016","issue":null,"first_page":"1","last_page":"7"},"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/T10125","display_name":"Advanced Wireless Communication Techniques","score":0.9904999732971191,"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.9742000102996826,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8402968645095825},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.7107824087142944},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.6372792720794678},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6222437024116516},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.549701988697052},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4753969609737396},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.329862505197525},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2722100615501404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.2602913975715637},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.23634356260299683},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.11999821662902832},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.0924822986125946}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8402968645095825},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.7107824087142944},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.6372792720794678},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6222437024116516},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.549701988697052},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4753969609737396},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.329862505197525},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2722100615501404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2602913975715637},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.23634356260299683},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.11999821662902832},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0924822986125946},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/icspcs.2016.7843313","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icspcs.2016.7843313","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 10th International Conference on Signal Processing and Communication Systems (ICSPCS)","raw_type":"proceedings-article"},{"id":"mag:2747218924","is_oa":false,"landing_page_url":"http://jglobal.jst.go.jp/en/public/201702237798502160","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1640719368","https://openalex.org/W1818146586","https://openalex.org/W1964402820","https://openalex.org/W2075276121","https://openalex.org/W2076838340","https://openalex.org/W2083625472","https://openalex.org/W2103353540","https://openalex.org/W2125535744","https://openalex.org/W2127490352","https://openalex.org/W2127875464","https://openalex.org/W2136204051","https://openalex.org/W2136779851","https://openalex.org/W2145698692","https://openalex.org/W2147861990","https://openalex.org/W2149185827","https://openalex.org/W2154297943","https://openalex.org/W2154993501","https://openalex.org/W2162764056","https://openalex.org/W2169732368","https://openalex.org/W6675543121"],"related_works":["https://openalex.org/W1968533815","https://openalex.org/W2808439818","https://openalex.org/W2126464345","https://openalex.org/W2005341112","https://openalex.org/W2370232613","https://openalex.org/W2090897912","https://openalex.org/W2150639697","https://openalex.org/W2602611185","https://openalex.org/W2386033600","https://openalex.org/W2143011401"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,49,53,77,122,185],"simple":[3],"and":[4,11,96,154,160,205],"efficient":[5],"algorithm":[6,35,200,221],"for":[7,109,112,225],"evaluating":[8],"the":[9,45,72,91,118,126,131,135,139,143,149,161,190,196,202],"girth":[10,95,110,204],"approximate":[12],"cycle":[13],"extrinsic":[14],"message":[15],"degree":[16],"(ACE)":[17],"of":[18,66,71,81,100,134,164,179,189,193],"all":[19,44],"short":[20,46,136,210],"cycles":[21,47,137,194],"through":[22,138],"symbol":[23,123,140],"nodes":[24],"in":[25,48,52,142,195,208,214],"short-to-medium":[26],"length":[27,211],"low-density":[28],"parity-check":[29,78],"(LDPC)":[30],"code":[31,50,67,167,182],"Tanner":[32],"graphs.":[33,68],"The":[34,69,176,198,220],"uses":[36],"single-edge":[37],"tree-apex":[38],"(SETA)":[39],"subgraph":[40,174],"expansions":[41],"to":[42,76,90,106,169],"find":[43],"graph":[51,168,183],"direct":[54],"manner,":[55],"unlike":[56],"existing":[57,218],"algorithms":[58,62],"which":[59],"use":[60],"message-passing":[61],"or":[63,125],"trellis":[64],"representations":[65],"complexity":[70],"algorithm,":[73],"when":[74],"applied":[75],"matrix":[79],"H":[80],"dimension":[82],"m":[83],"\u00d7":[84],"n,":[85],"is":[86,184,222],"O(n":[87],"m).":[88],"Due":[89],"fact":[92],"that":[93],"both":[94],"ACE":[97,113,133,151,163,178,206],"are":[98],"features":[99],"cycles,":[101],"we":[102,116],"adopt":[103],"parameters":[104],"similar":[105],"those":[107],"used":[108],"descriptions":[111],"descriptions.":[114],"Accordingly,":[115],"define":[117],"`local":[119],"ACE'":[120],"at":[121],"node":[124,128,141],"`symbol":[127],"ACE',":[129],"as":[130],"minimum":[132,153],"graph.":[144,197],"This":[145],"basic":[146],"parameter":[147],"enables":[148],"local":[150,156,203],"distribution,":[152],"maximum":[155],"ACE,":[157,159],"modal":[158],"average":[162,177],"an":[165,180],"LDPC":[166,181,212,228],"be":[170],"determined":[171],"using":[172],"SETA":[173],"expansions.":[175],"concise":[186],"single-valued":[187],"measure":[188],"overall":[191],"connectivity":[192],"proposed":[199],"determines":[201],"distributions":[207],"irregular":[209],"codes":[213],"less":[215],"time":[216],"than":[217],"algorithms.":[219],"not":[223],"intended":[224],"quasi-cyclic":[226],"(QC)":[227],"codes.":[229]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}