{"id":"https://openalex.org/W4246559068","doi":"https://doi.org/10.1109/ita.2016.7888167","title":"Globally coupled LDPC codes","display_name":"Globally coupled LDPC codes","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W4246559068","doi":"https://doi.org/10.1109/ita.2016.7888167"},"language":"en","primary_location":{"id":"doi:10.1109/ita.2016.7888167","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2016.7888167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 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":[{"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":"Juane Li","raw_affiliation_strings":["University of California, Davis, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, CA","institution_ids":["https://openalex.org/I84218800"]}]},{"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, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, CA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","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, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Davis, CA","institution_ids":["https://openalex.org/I84218800"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033032709","display_name":"W.E. Ryan","orcid":"https://orcid.org/0000-0002-6379-2186"},"institutions":[{"id":"https://openalex.org/I4210119456","display_name":"Fairfax Neonatal Associates","ror":"https://ror.org/02hswss60","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210119456"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"William E. Ryan","raw_affiliation_strings":["Zeta Associates, Fairfax, VA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zeta Associates, Fairfax, VA","institution_ids":["https://openalex.org/I4210119456"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["University of Notre Dame, Notre Dame, IN"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Notre Dame, Notre Dame, IN","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.5248,"has_fulltext":false,"cited_by_count":35,"citation_normalized_percentile":{"value":0.91159786,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"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.996399998664856,"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.9948999881744385,"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.8817178010940552},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5848615169525146},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5818848609924316},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5638606548309326},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5283029079437256},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5233213901519775},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.507654070854187},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.4937687814235687},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4865242838859558},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46982622146606445},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4604838788509369},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4513024091720581},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.41261082887649536},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.4100399911403656},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.369753897190094},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.26954638957977295},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.09900283813476562},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.09557473659515381},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08900612592697144}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8817178010940552},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5848615169525146},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5818848609924316},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5638606548309326},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5283029079437256},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5233213901519775},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.507654070854187},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.4937687814235687},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4865242838859558},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46982622146606445},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4604838788509369},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4513024091720581},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.41261082887649536},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.4100399911403656},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.369753897190094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.26954638957977295},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.09900283813476562},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.09557473659515381},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08900612592697144},{"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/ita.2016.7888167","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ita.2016.7888167","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 Information Theory and Applications Workshop (ITA)","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":11,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1864365761","https://openalex.org/W1969813053","https://openalex.org/W2017687288","https://openalex.org/W2113420173","https://openalex.org/W2114869758","https://openalex.org/W2123796443","https://openalex.org/W2179644698","https://openalex.org/W4239889878","https://openalex.org/W4256264271","https://openalex.org/W6603727012"],"related_works":["https://openalex.org/W2372190485","https://openalex.org/W2139769859","https://openalex.org/W2583282232","https://openalex.org/W2962908977","https://openalex.org/W2140357074","https://openalex.org/W2113562070","https://openalex.org/W2410688423","https://openalex.org/W2146033312","https://openalex.org/W744873668","https://openalex.org/W2105894282"],"abstract_inverted_index":{"This":[0,113],"paper":[1],"presents":[2],"a":[3,10,37,49],"special":[4],"type":[5,60],"of":[6,18,28,36,39,51,58,118],"LDPC":[7,22,26,65],"codes":[8,66,110],"with":[9],"structure":[11],"related":[12],"to":[13],"but":[14],"different":[15],"from":[16],"that":[17],"the":[19,73,79],"spatially":[20],"coupled":[21,64],"codes.":[23,101],"For":[24],"an":[25],"code":[27],"this":[29,59],"type,":[30],"its":[31],"Tanner":[32,42],"graph":[33],"is":[34,111],"composed":[35],"set":[38],"small":[40],"disjoint":[41],"graphs":[43],"which":[44],"are":[45,61,84,96],"connected":[46],"together":[47],"by":[48],"group":[50],"overall":[52],"check-nodes,":[53],"called":[54,62],"global":[55,122],"check-nodes.":[56],"Codes":[57],"globally":[63],"and":[67,78,121],"they":[68,83],"perform":[69],"well":[70],"over":[71],"both":[72],"additive":[74],"Gaussian":[75],"white":[76],"noise":[77],"binary-erasure":[80],"channels.":[81],"Furthermore,":[82],"very":[85],"effective":[86],"at":[87],"correcting":[88],"erasures":[89,125],"clustered":[90],"in":[91,126],"bursts.":[92],"Two":[93],"algebraic":[94],"methods":[95],"presented":[97],"for":[98,107],"constructing":[99],"these":[100,109],"A":[102],"two-phase":[103],"local/global":[104],"iterative":[105],"scheme":[106,115],"decoding":[108,114],"presented.":[112],"allows":[116],"correction":[117],"local":[119],"random":[120],"errors":[123],"and/or":[124],"two":[127],"phases.":[128]},"counts_by_year":[{"year":2026,"cited_by_count":4},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}