{"id":"https://openalex.org/W2158860695","doi":"https://doi.org/10.1109/itw.2011.6089360","title":"Optimal rate for irregular LDPC codes in binary erasure channel","display_name":"Optimal rate for irregular LDPC codes in binary erasure channel","publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2158860695","doi":"https://doi.org/10.1109/itw.2011.6089360","mag":"2158860695"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2011.6089360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1108.1572","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"H. Tavakoli","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":true,"raw_author_name":"H. Tavakoli","raw_affiliation_strings":["Electrical Engineering Department, K.N. Toosi University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, K.N. Toosi University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"middle","author":{"id":null,"display_name":"M. Ahmadian Attari","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Ahmadian Attari","raw_affiliation_strings":["Electrical Engineering Department, K.N. Toosi University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, K.N. Toosi University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]},{"author_position":"last","author":{"id":null,"display_name":"M. Reza Peyghami","orcid":null},"institutions":[{"id":"https://openalex.org/I80543232","display_name":"K.N.Toosi University of Technology","ror":"https://ror.org/0433abe34","country_code":"IR","type":"education","lineage":["https://openalex.org/I80543232"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"M. Reza Peyghami","raw_affiliation_strings":["Department of Mathematics, K.N. Toosi University of Technology, Tehran, Iran"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, K.N. Toosi University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I80543232"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I80543232"],"apc_list":null,"apc_paid":null,"fwci":1.4781,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84544185,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"47","issue":null,"first_page":"125","last_page":"129"},"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.9970999956130981,"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.996999979019165,"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/binary-erasure-channel","display_name":"Binary erasure channel","score":0.8450999855995178},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6765000224113464},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.6316999793052673},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5745999813079834},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5670999884605408},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.5612000226974487},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4864000082015991},{"id":"https://openalex.org/keywords/degree-distribution","display_name":"Degree distribution","score":0.45399999618530273},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4259999990463257}],"concepts":[{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.8450999855995178},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6765000224113464},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.6316999793052673},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6029999852180481},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5745999813079834},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5670999884605408},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.5612000226974487},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4864000082015991},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48420000076293945},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4659999907016754},{"id":"https://openalex.org/C87414783","wikidata":"https://www.wikidata.org/wiki/Q1002603","display_name":"Degree distribution","level":3,"score":0.45399999618530273},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4259999990463257},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.4041000008583069},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.383899986743927},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.3813000023365021},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3702999949455261},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3544999957084656},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.34360000491142273},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3391000032424927},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.29919999837875366},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2964000105857849},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.29280000925064087},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.2881999909877777},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.2806999981403351},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2687000036239624},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2590000033378601},{"id":"https://openalex.org/C41431624","wikidata":"https://www.wikidata.org/wiki/Q1053357","display_name":"Block size","level":3,"score":0.25679999589920044},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.25060001015663147},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/itw.2011.6089360","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2011.6089360","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE Information Theory Workshop","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1108.1572","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1108.1572","pdf_url":"https://arxiv.org/pdf/1108.1572","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1108.1572","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1108.1572","pdf_url":"https://arxiv.org/pdf/1108.1572","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1536930200","https://openalex.org/W1568307856","https://openalex.org/W1642842931","https://openalex.org/W2088719955","https://openalex.org/W2095882513","https://openalex.org/W2113120847","https://openalex.org/W2115104320","https://openalex.org/W2127490352","https://openalex.org/W2136307214","https://openalex.org/W2162764056","https://openalex.org/W2163247103","https://openalex.org/W2163706521","https://openalex.org/W2165573107","https://openalex.org/W2169212840","https://openalex.org/W2169732368","https://openalex.org/W4256648168","https://openalex.org/W4300188436","https://openalex.org/W6658471458","https://openalex.org/W6683202485","https://openalex.org/W6794170998"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1,79,119],"paper,":[2],"we":[3,128],"introduce":[4],"a":[5,126],"new":[6,37],"practical":[7],"and":[8,60,98,109],"general":[9],"method":[10,54,80,106,120],"for":[11,91],"solving":[12],"the":[13,18,52,75,139],"main":[14],"problem":[15],"of":[16,44,49,63,118,122],"designing":[17],"capacity":[19],"approaching,":[20],"optimal":[21,86],"rate,":[22,96],"irregular":[23],"low-density":[24],"parity-check":[25],"(LDPC)":[26],"code":[27],"ensemble":[28],"over":[29],"binary":[30,94],"erasure":[31,95],"channel":[32],"(BEC).":[33],"Compared":[34],"to":[35,138],"some":[36,130],"researches,":[38],"which":[39,133],"are":[40,136],"based":[41],"on":[42],"application":[43],"asymptotic":[45],"analysis":[46],"tools":[47],"out":[48],"optimization":[50],"process,":[51],"proposed":[53],"is":[55,81,107,121],"much":[56],"simpler,":[57],"faster,":[58],"accurate":[59],"practical.":[61],"Because":[62],"not":[64],"using":[65],"any":[66,69,92,99],"relaxation":[67],"or":[68],"approximate":[70],"solution":[71],"like":[72],"previous":[73],"works,":[74],"found":[76],"answer":[77],"with":[78],"optimal.":[82],"We":[83],"can":[84],"construct":[85],"variable":[87],"node":[88,101],"degree":[89,102,131],"distribution":[90,132],"given":[93],"e,":[97],"check":[100],"distribution.":[103],"The":[104,115],"presented":[105],"implemented":[108],"it":[110],"works":[111],"well":[112],"in":[113],"practice.":[114],"time":[116],"complexity":[117],"polynomial":[123],"order.":[124],"As":[125],"result,":[127],"obtain":[129],"their":[134],"rates":[135],"close":[137],"capacity.":[140]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":3}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2016-06-24T00:00:00"}