{"id":"https://openalex.org/W2048421281","doi":"https://doi.org/10.1109/isit.2005.1523620","title":"A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening","display_name":"A rate-compatible family of protograph-based LDPC codes built by expurgation and lengthening","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2048421281","doi":"https://doi.org/10.1109/isit.2005.1523620","mag":"2048421281"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5113505062","display_name":"S. Dolinar","orcid":null},"institutions":[{"id":"https://openalex.org/I1334627681","display_name":"Jet Propulsion Laboratory","ror":"https://ror.org/027k65916","country_code":"US","type":"facility","lineage":["https://openalex.org/I122411786","https://openalex.org/I1334627681","https://openalex.org/I4210124779"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S. Dolinar","raw_affiliation_strings":["Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","Jet Propulsion Labs, California Institute of Technology, Pasadena, CA"],"affiliations":[{"raw_affiliation_string":"Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I1334627681"]},{"raw_affiliation_string":"Jet Propulsion Labs, California Institute of Technology, Pasadena, CA","institution_ids":["https://openalex.org/I1334627681"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5113505062"],"corresponding_institution_ids":["https://openalex.org/I1334627681"],"apc_list":null,"apc_paid":null,"fwci":1.8168,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.87343082,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"42","issue":null,"first_page":"1627","last_page":"1631"},"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.9972000122070312,"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.9868999719619751,"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.8074652552604675},{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.5349791049957275},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5310999155044556},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5028009414672852},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48993462324142456},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4822838604450226},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4736781418323517},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.43823176622390747},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41990578174591064},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.41556623578071594},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.4139684736728668},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.41051116585731506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3495895564556122},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.32318586111068726},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.3176352083683014},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.2820470929145813},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.17777478694915771},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.127513587474823},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.08614543080329895}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8074652552604675},{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.5349791049957275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5310999155044556},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5028009414672852},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48993462324142456},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4822838604450226},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4736781418323517},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.43823176622390747},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41990578174591064},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.41556623578071594},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.4139684736728668},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.41051116585731506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3495895564556122},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.32318586111068726},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.3176352083683014},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2820470929145813},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.17777478694915771},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.127513587474823},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.08614543080329895},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"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/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2005.1523620","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523620","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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":15,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W331567264","https://openalex.org/W1484315907","https://openalex.org/W2100263947","https://openalex.org/W2103353540","https://openalex.org/W2114869758","https://openalex.org/W2121594648","https://openalex.org/W2122760777","https://openalex.org/W2136204051","https://openalex.org/W2792048909","https://openalex.org/W3140113773","https://openalex.org/W6603727012","https://openalex.org/W6611423618","https://openalex.org/W6749253091","https://openalex.org/W6792236141"],"related_works":["https://openalex.org/W2152494507","https://openalex.org/W2088497038","https://openalex.org/W2538326137","https://openalex.org/W1627814422","https://openalex.org/W2242182868","https://openalex.org/W2133440869","https://openalex.org/W2015836187","https://openalex.org/W2604656776","https://openalex.org/W2010358422","https://openalex.org/W4366956114"],"abstract_inverted_index":{"We":[0,133],"construct":[1],"a":[2,13,43,66,112,124,139,145],"protograph-based":[3],"rate-compatible":[4,140],"family":[5,93,142,177,248],"of":[6,17,28,55,68,91,116,127,148,175,180,187,218,228,246,265],"low-density":[7],"parity-check":[8],"(LDPC)":[9],"codes":[10,54],"that":[11,52,119,202,243],"cover":[12],"very":[14],"wide":[15],"range":[16],"rates":[18,57,264],"from":[19],"1/2":[20],"to":[21,49,73,77,83,137,194,261],"16/17,":[22],"perform":[23],"within":[24],"about":[25,266],"0.5":[26],"dB":[27],"their":[29],"capacity":[30],"limits":[31],"for":[32,96,130,238],"all":[33,131,179,239,244],"rates,":[34,98,230],"and":[35,40,70,111,152,161,184,191,220,224],"can":[36,120],"be":[37,121],"decoded":[38],"conveniently":[39],"efficiently":[41],"with":[42,100,123,231],"common":[44,92],"hardware":[45,95],"implementation.":[46],"In":[47],"contrast":[48],"alternative":[50,85],"methods":[51,86],"create":[53,138],"different":[56,97,229],"by":[58,144,158,169,210],"puncturing,":[59],"shortening,":[60],"or":[61],"expurgation,":[62],"our":[63,176],"method":[64,136],"uses":[65],"combination":[67],"expurgation":[69],"lengthening":[71],"(equivalent":[72],"an":[74],"unusual":[75],"extension)":[76],"produce":[78],"lower-rate":[79],"codes.":[80],"Advantages":[81],"compared":[82],"the":[84,117,181,199],"include":[87],"roughly":[88],"uniform":[89],"utilization":[90],"decoder":[94],"implementation":[99],"uniformly":[101],"low":[102],"maximum":[103,109],"check":[104],"node":[105],"degrees":[106],"despite":[107],"high":[108],"rate,":[110],"large":[113],"fixed":[114,125,232],"portion":[115],"protograph":[118],"labeled":[122],"set":[126],"edge":[128,165,206],"permutations":[129,166,186,207],"rates.":[132,240],"apply":[134],"this":[135,188,192,247],"code":[141,147,200],"anchored":[143],"particular":[146],"(nominal)":[149,233],"rate":[150,253],"7/8":[151],"length":[153],"n":[154],"=":[155,236],"8176":[156,237],"designed":[157],"Kou,":[159],"Lin":[160],"Fossorier":[162],"[1]":[163],"whose":[164],"are":[167,208,214],"determined":[168],"Euclidean":[170],"geometries":[171],"(EG).":[172],"All":[173],"members":[174,245],"retain":[178],"EG-designed":[182],"edges":[183],"circulant":[185],"anchor":[189],"code,":[190],"helps":[193],"avoid":[195],"weak":[196],"spots":[197],"in":[198],"graph":[201],"usually":[203],"arise":[204],"when":[205],"assigned":[209],"greedy":[211],"algorithms.":[212],"There":[213],"also":[215],"varying":[216],"numbers":[217],"auxiliary":[219],"ancillary":[221],"checks,":[222],"variables,":[223],"edges,":[225],"allowing":[226],"realization":[227],"dimension":[234],"k":[235],"Simulations":[241],"show":[242],"achieve":[249],"steeply":[250],"falling":[251],"error":[252,257,263],"curves":[254],"without":[255],"detectable":[256],"floors,":[258],"at":[259],"least":[260],"codeword":[262],"10":[267],"<sup":[268],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[269],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-6</sup>":[270]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}