{"id":"https://openalex.org/W2121788541","doi":"https://doi.org/10.1109/icc.2009.5198897","title":"Design and Analysis of E\u00b2 RC Codes Using EXIT Chart","display_name":"Design and Analysis of E\u00b2 RC Codes Using EXIT Chart","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2121788541","doi":"https://doi.org/10.1109/icc.2009.5198897","mag":"2121788541"},"language":"en","primary_location":{"id":"doi:10.1109/icc.2009.5198897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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":null,"display_name":"C. Shi","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"C. Shi","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA","Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa;","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055656185","display_name":"Aditya Ramamoorthy","orcid":"https://orcid.org/0000-0003-3448-1271"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Ramamoorthy","raw_affiliation_strings":["Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA","Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Iowa State University, Ames, Iowa;","institution_ids":["https://openalex.org/I173911158"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16032809,"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":"5"},"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.9998999834060669,"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/T11130","display_name":"Coding theory and cryptography","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/computer-science","display_name":"Computer science","score":0.6083205342292786},{"id":"https://openalex.org/keywords/puncturing","display_name":"Puncturing","score":0.6020556092262268},{"id":"https://openalex.org/keywords/raptor-code","display_name":"Raptor code","score":0.5553078055381775},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.508063793182373},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5047076940536499},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4888984262943268},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.48124194145202637},{"id":"https://openalex.org/keywords/chart","display_name":"Chart","score":0.4576583802700043},{"id":"https://openalex.org/keywords/monte-carlo-method","display_name":"Monte Carlo method","score":0.4496300518512726},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4196665287017822},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3263961672782898},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.32044780254364014},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.31763726472854614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2679688334465027},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.13472363352775574},{"id":"https://openalex.org/keywords/error-floor","display_name":"Error floor","score":0.10803142189979553}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6083205342292786},{"id":"https://openalex.org/C2778808095","wikidata":"https://www.wikidata.org/wiki/Q3899825","display_name":"Puncturing","level":2,"score":0.6020556092262268},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.5553078055381775},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.508063793182373},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5047076940536499},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4888984262943268},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.48124194145202637},{"id":"https://openalex.org/C190812933","wikidata":"https://www.wikidata.org/wiki/Q28923","display_name":"Chart","level":2,"score":0.4576583802700043},{"id":"https://openalex.org/C19499675","wikidata":"https://www.wikidata.org/wiki/Q232207","display_name":"Monte Carlo method","level":2,"score":0.4496300518512726},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4196665287017822},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3263961672782898},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.32044780254364014},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.31763726472854614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2679688334465027},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.13472363352775574},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.10803142189979553},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"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":1,"locations":[{"id":"doi:10.1109/icc.2009.5198897","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icc.2009.5198897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Conference on Communications","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":18,"referenced_works":["https://openalex.org/W1999589899","https://openalex.org/W2050603370","https://openalex.org/W2099180514","https://openalex.org/W2101394529","https://openalex.org/W2106061146","https://openalex.org/W2114468914","https://openalex.org/W2128765501","https://openalex.org/W2137028798","https://openalex.org/W2150494733","https://openalex.org/W2154315166","https://openalex.org/W2155864372","https://openalex.org/W2156389396","https://openalex.org/W2160390925","https://openalex.org/W2165104588","https://openalex.org/W3102979680","https://openalex.org/W4235521202","https://openalex.org/W4300188436","https://openalex.org/W6683367992"],"related_works":["https://openalex.org/W2152494507","https://openalex.org/W2088497038","https://openalex.org/W2538326137","https://openalex.org/W2296600582","https://openalex.org/W4245031194","https://openalex.org/W2787656098","https://openalex.org/W2362533498","https://openalex.org/W1627814422","https://openalex.org/W2348551008","https://openalex.org/W2015836187"],"abstract_inverted_index":{"We":[0],"present":[1],"the":[2,13,34,39,52,73,98,110],"design":[3,47,140],"and":[4,25,46,96],"analysis":[5],"of":[6,9,43,72,100,112,125,141],"a":[7,65],"family":[8],"codes":[10,18,45,103,114,127],"based":[11,55],"on":[12,56],"efflciently-encodable":[14],"rate-compatible":[15,113,142],"irregular":[16],"LDPC":[17],"(E2RC":[19],"codes)":[20],"introduced":[21],"by":[22],"Kim,":[23],"Ramamoorthy":[24],"Mclaughlin":[26],"'06.":[27],"The":[28],"basic":[29],"idea":[30],"is":[31],"to":[32,79],"utilize":[33],"structured":[35,74],"parity":[36,40,75],"part":[37,54,76],"(of":[38],"check":[41],"matrix)":[42],"E2RC":[44],"optimal":[48],"degree":[49],"distributions":[50],"for":[51,68],"systematic":[53],"EXIT":[57,70,87,118],"chart":[58],"analysis.":[59],"In":[60],"this":[61],"work,":[62],"we":[63,94,108,121],"propose":[64,122],"new":[66],"technique":[67],"computing":[69],"functions":[71,88],"without":[77],"resorting":[78],"Monte":[80],"Carlo":[81],"simulations.":[82],"Our":[83],"method":[84],"provides":[85],"smoother":[86],"in":[89,138],"substantially":[90],"lesser":[91],"time.":[92],"Furthermore,":[93],"pose":[95],"solve":[97],"problem":[99],"designing":[101],"good":[102],"using":[104,117],"linear":[105],"programming.":[106],"Next,":[107],"consider":[109],"performance":[111],"under":[115],"puncturing":[116],"charts.":[119],"Finally,":[120],"joint":[123],"optimization":[124],"our":[126],"at":[128],"any":[129],"specified":[130],"code":[131],"rate(s)":[132],"which":[133],"has":[134],"not":[135],"been":[136],"explored":[137],"previous":[139],"punctured":[143],"codes.":[144]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2016-06-24T00:00:00"}