{"id":"https://openalex.org/W2114075878","doi":"https://doi.org/10.1109/isit.2004.1365275","title":"Grouping-and-shifting designs for structured LDPC codes with large girth","display_name":"Grouping-and-shifting designs for structured LDPC codes with large girth","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2114075878","doi":"https://doi.org/10.1109/isit.2004.1365275","mag":"2114075878"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5102797606","display_name":"Jianguo L\u00fc","orcid":"https://orcid.org/0000-0003-1042-8847"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jin Lu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Carnegie Mellon Univ., Pittsburgh, PA, , USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045861415","display_name":"Jos\u00e9 M. F. Moura","orcid":"https://orcid.org/0000-0002-9822-8294"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.M.F. Moura","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5069438536","display_name":"Urs Niesen","orcid":"https://orcid.org/0000-0002-2938-228X"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"U. Niesen","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA, USA","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.4839,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.63477585,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"238","last_page":"238"},"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.9986000061035156,"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.9984999895095825,"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.8880817294120789},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.8164170980453491},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.6948646903038025},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5531929731369019},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5332068800926208},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.44381558895111084},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4321857690811157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4270431697368622},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4180545508861542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35506200790405273},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34289228916168213},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3229691982269287},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.26203057169914246},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.1944456696510315}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8880817294120789},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.8164170980453491},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.6948646903038025},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5531929731369019},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5332068800926208},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.44381558895111084},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4321857690811157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4270431697368622},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4180545508861542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35506200790405273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34289228916168213},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3229691982269287},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.26203057169914246},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.1944456696510315},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2004.1365275","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365275","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.119.9534","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.119.9534","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ece.cmu.edu/~moura/papers/isit-jun04-lu-moura-niesen.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2133068391","https://openalex.org/W2135764410"],"related_works":["https://openalex.org/W2808439818","https://openalex.org/W1968533815","https://openalex.org/W2126464345","https://openalex.org/W2005341112","https://openalex.org/W2370232613","https://openalex.org/W2090897912","https://openalex.org/W2150639697","https://openalex.org/W2351144917","https://openalex.org/W2602611185","https://openalex.org/W2143011401"],"abstract_inverted_index":{"We":[0,46],"introduce":[1],"a":[2,40,48],"method":[3,17],"to":[4,20,39,54],"design":[5],"structured":[6],"LDPC":[7,67],"codes":[8],"with":[9],"large":[10],"girth":[11],"and":[12,32],"flexible":[13],"code":[14],"rates.":[15],"The":[16],"is":[18],"simple":[19],"explain:":[21],"we":[22],"divide":[23],"the":[24,27,52],"nodes":[25,34],"in":[26,35],"Tanner":[28],"graph":[29],"into":[30],"groups":[31,37],"connect":[33],"these":[36,61],"according":[38],"set":[41],"of":[42],"parameters":[43],"called":[44],"shifts.":[45],"derive":[47],"general":[49],"theorem":[50],"on":[51],"shifts":[53],"prevent":[55],"small":[56],"cycles.":[57],"Simulations":[58],"show":[59],"that":[60],"codes,":[62,64],"GS-LDPC":[63],"outperform":[65],"random":[66],"codes.":[68]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}