{"id":"https://openalex.org/W2169105083","doi":"https://doi.org/10.1109/isit.2008.4595097","title":"On the design of universal LDPC codes","display_name":"On the design of universal LDPC codes","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2169105083","doi":"https://doi.org/10.1109/isit.2008.4595097","mag":"2169105083"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2008.4595097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0806.0036","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053057553","display_name":"Ali Sanaei","orcid":"https://orcid.org/0000-0002-8513-8169"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Ali Sanaei","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059109819","display_name":"Mahdi Ramezani","orcid":"https://orcid.org/0000-0003-2679-1552"},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mahdi Ramezani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008826983","display_name":"Masoud Ardakani","orcid":null},"institutions":[{"id":"https://openalex.org/I154425047","display_name":"University of Alberta","ror":"https://ror.org/0160cpw27","country_code":"CA","type":"education","lineage":["https://openalex.org/I154425047"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Masoud Ardakani","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Alberta, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Alberta, Canada","institution_ids":["https://openalex.org/I154425047"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I154425047"],"apc_list":null,"apc_paid":null,"fwci":0.7644,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.70294834,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":null,"first_page":"802","last_page":"806"},"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.998199999332428,"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.9980000257492065,"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.8004963397979736},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.6511833071708679},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5582124590873718},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5507689714431763},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5392907857894897},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.5270761847496033},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5243250131607056},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48585245013237},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4247845411300659},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4246983528137207},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40782642364501953},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34514880180358887},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3326035141944885},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22375649213790894},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.2109164297580719},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07454457879066467}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8004963397979736},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.6511833071708679},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5582124590873718},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5507689714431763},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5392907857894897},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.5270761847496033},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5243250131607056},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48585245013237},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4247845411300659},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4246983528137207},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40782642364501953},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34514880180358887},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3326035141944885},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22375649213790894},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.2109164297580719},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07454457879066467},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2008.4595097","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2008.4595097","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:0806.0036","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0806.0036","pdf_url":"https://arxiv.org/pdf/0806.0036","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.311.529","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.311.529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0806.0036v1.pdf","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0806.0036","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0806.0036","pdf_url":"https://arxiv.org/pdf/0806.0036","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1496181435","https://openalex.org/W1536930200","https://openalex.org/W2057769348","https://openalex.org/W2085815546","https://openalex.org/W2115620254","https://openalex.org/W2118420528","https://openalex.org/W2120034575","https://openalex.org/W2124906326","https://openalex.org/W2127490352","https://openalex.org/W2128765501","https://openalex.org/W2130092083","https://openalex.org/W2137813581","https://openalex.org/W2148095386","https://openalex.org/W2154842015","https://openalex.org/W2160390925","https://openalex.org/W2162681384","https://openalex.org/W2168860197","https://openalex.org/W4300188436","https://openalex.org/W6678293963"],"related_works":["https://openalex.org/W2156055959","https://openalex.org/W1525070854","https://openalex.org/W1656451834","https://openalex.org/W4386075170","https://openalex.org/W4309132699","https://openalex.org/W4297912917","https://openalex.org/W2110271616","https://openalex.org/W2312958613","https://openalex.org/W2766747631","https://openalex.org/W2035658183"],"abstract_inverted_index":{"Low-density":[0],"parity-check":[1],"(LDPC)":[2],"coding":[3,137],"for":[4,56,65,110,130],"a":[5,17,29,57,78,92,142],"multitude":[6,143],"of":[7,31,42,59,75,94,144],"equal-capacity":[8,32],"channels":[9,106],"is":[10,19,47,54,62,80],"studied.":[11],"First,":[12],"based":[13],"on":[14,28,38,103],"numerous":[15],"observations,":[16],"conjecture":[18],"stated":[20],"that":[21,49,101,127],"when":[22,50,139],"the":[23,51,73,104],"belief":[24],"propagation":[25],"decoder":[26],"converges":[27],"set":[30,93],"channels,":[33,60,132],"it":[34,46,61],"would":[35],"also":[36,63],"converge":[37],"any":[39,66,111],"convex":[40,70],"combination":[41],"those":[43],"channels.":[44,97,145],"Then,":[45],"proved":[48],"stability":[52],"condition":[53],"satisfied":[55,64],"number":[58],"channel":[67,87,112],"in":[68,121],"their":[69],"hull.":[71],"For":[72],"purpose":[74],"code":[76],"design,":[77],"method":[79],"proposed":[81],"which":[82],"can":[83],"decompose":[84],"every":[85],"symmetric":[86],"with":[88,113,123],"capacity":[89,114],"C":[90],"into":[91],"identical-capacity":[95],"basis":[96,105],"We":[98],"expect":[99],"codes":[100,117,126,134],"work":[102],"to":[107],"be":[108],"suitable":[109],"C.":[115],"Such":[116],"are":[118,128],"found":[119],"and":[120],"comparison":[122],"existing":[124],"LDPC":[125],"designed":[129],"specific":[131],"our":[133],"obtain":[135],"considerable":[136],"gains":[138],"used":[140],"across":[141]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}