{"id":"https://openalex.org/W2044078862","doi":"https://doi.org/10.1109/tit.2013.2250574","title":"Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles","display_name":"Design of Multiple-Edge Protographs for QC LDPC Codes Avoiding Short Inevitable Cycles","publication_year":2013,"publication_date":"2013-06-14","ids":{"openalex":"https://openalex.org/W2044078862","doi":"https://doi.org/10.1109/tit.2013.2250574","mag":"2044078862"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2013.2250574","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2250574","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1210.3906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Hosung Park","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]},{"id":"https://openalex.org/I4210164379","display_name":"Seoul Media Institute of Technology","ror":"https://ror.org/04ywg4h07","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210164379"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Hosung Park","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467","https://openalex.org/I4210164379"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Seokbeom Hong","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]},{"id":"https://openalex.org/I4210164379","display_name":"Seoul Media Institute of Technology","ror":"https://ror.org/04ywg4h07","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210164379"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seokbeom Hong","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467","https://openalex.org/I4210164379"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Jong-Seon No","orcid":null},"institutions":[{"id":"https://openalex.org/I139264467","display_name":"Seoul National University","ror":"https://ror.org/04h9pn542","country_code":"KR","type":"education","lineage":["https://openalex.org/I139264467"]},{"id":"https://openalex.org/I4210164379","display_name":"Seoul Media Institute of Technology","ror":"https://ror.org/04ywg4h07","country_code":"KR","type":"education","lineage":["https://openalex.org/I4210164379"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jong-Seon No","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, Institute of New Media and Communications, Seoul National University, Seoul, South Korea","institution_ids":["https://openalex.org/I139264467","https://openalex.org/I4210164379"]}]},{"author_position":"last","author":{"id":null,"display_name":"Dong-Joon Shin","orcid":null},"institutions":[{"id":"https://openalex.org/I4575257","display_name":"Hanyang University","ror":"https://ror.org/046865y68","country_code":"KR","type":"education","lineage":["https://openalex.org/I4575257"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Dong-Joon Shin","raw_affiliation_strings":["Department of Electronic Engineering, Hanyang University, Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electronic Engineering, Hanyang University, Seoul, South Korea","institution_ids":["https://openalex.org/I4575257"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.9429,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.88722048,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"59","issue":"7","first_page":"4598","last_page":"4614"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9929999709129333,"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":0.9929999709129333,"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.0012000000569969416,"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/T11873","display_name":"PAPR reduction in OFDM","score":0.000699999975040555,"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.8851000070571899},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.6833999752998352},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5782999992370605},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.5777000188827515},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5758000016212463},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.5616000294685364},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.515500009059906},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.5055000185966492}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8851000070571899},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.6833999752998352},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5782999992370605},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.5777000188827515},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5758000016212463},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.5616000294685364},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.515500009059906},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.5055000185966492},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4560999870300293},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.44449999928474426},{"id":"https://openalex.org/C65058987","wikidata":"https://www.wikidata.org/wiki/Q7826005","display_name":"Tornado code","level":5,"score":0.41260001063346863},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.4090000092983246},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4036000072956085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3747999966144562},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.36320000886917114},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.3547999858856201},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3499999940395355},{"id":"https://openalex.org/C128151799","wikidata":"https://www.wikidata.org/wiki/Q13563306","display_name":"Luby transform code","level":5,"score":0.3402999937534332},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.3070000112056732},{"id":"https://openalex.org/C46462455","wikidata":"https://www.wikidata.org/wiki/Q5395712","display_name":"Error floor","level":4,"score":0.30649998784065247},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.289900004863739},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.25999999046325684},{"id":"https://openalex.org/C101252705","wikidata":"https://www.wikidata.org/wiki/Q7294373","display_name":"Raptor code","level":5,"score":0.2531999945640564}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2013.2250574","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2013.2250574","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1210.3906","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.3906","pdf_url":"https://arxiv.org/pdf/1210.3906","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1210.3906","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1210.3906","pdf_url":"https://arxiv.org/pdf/1210.3906","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1667880265","https://openalex.org/W1964402820","https://openalex.org/W1965142549","https://openalex.org/W1973712217","https://openalex.org/W2058603910","https://openalex.org/W2083264702","https://openalex.org/W2107621627","https://openalex.org/W2107804146","https://openalex.org/W2116815462","https://openalex.org/W2117904894","https://openalex.org/W2119990840","https://openalex.org/W2128037788","https://openalex.org/W2129077868","https://openalex.org/W2130255084","https://openalex.org/W2133065184","https://openalex.org/W2136665473","https://openalex.org/W2141836583","https://openalex.org/W2143965786","https://openalex.org/W4300188436","https://openalex.org/W6606175091","https://openalex.org/W6683643303","https://openalex.org/W6695303556"],"related_works":[],"abstract_inverted_index":{"There":[0],"have":[1,56,68,168],"been":[2,33],"lots":[3],"of":[4,9,21,38,79,111,145,153,191],"efforts":[5],"on":[6,24,99,150,172],"the":[7,36,163,173,189,192],"construction":[8,37,109,143],"quasi-cyclic":[10],"(QC)":[11],"low-density":[12],"parity-check":[13],"(LDPC)":[14],"codes":[15,41,62,86,120,135,148,167,196,202],"with":[16,26,45,121,136,197,204],"large":[17,89],"girth.":[18],"However,":[19],"most":[20],"them":[22,65],"focus":[23],"protographs":[25,44,55,113,155],"single":[27],"edges":[28],"and":[29,126,158,203],"little":[30],"research":[31],"has":[32],"done":[34],"for":[35,116,131],"QC":[39,60,84,118,133,146,165,194,206],"LDPC":[40,61,85,119,134,147,166,195,201,207],"lifted":[42,63,179],"from":[43,64,87,180],"multiple":[46],"(i.e.,":[47],"parallel)":[48],"edges.":[49],"Compared":[50],"to":[51,187],"single-edge":[52,181],"protographs,":[53,81],"multiple-edge":[54,80,112,154],"benefits":[57],"such":[58],"that":[59,162],"can":[66],"potentially":[67],"larger":[69,169],"minimum":[70,174],"Hamming":[71,175],"distance.":[72],"In":[73],"this":[74],"paper,":[75],"all":[76],"subgraph":[77],"patterns":[78],"which":[82],"prevent":[83],"having":[88],"girth":[90,122,137],"by":[91],"inducing":[92],"inevitable":[93],"cycles,":[94],"are":[95,185],"fully":[96],"investigated":[97],"based":[98,149],"a":[100,107,142],"graph-theoretic":[101],"approach.":[102],"By":[103],"using":[104],"combinatorial":[105],"designs,":[106],"systematic":[108],"method":[110,128],"is":[114,129,156,160],"proposed":[115,130,157,193],"regular":[117,132],"at":[123,138],"least":[124,139],"12":[125],"another":[127],"14.":[140],"Moreover,":[141],"algorithm":[144],"certain":[151],"liftings":[152],"it":[159],"shown":[161],"resulting":[164],"upper":[170],"bounds":[171],"distance":[176],"than":[177],"those":[178],"protographs.":[182],"Simulation":[183],"results":[184],"provided":[186],"compare":[188],"performance":[190],"progressive":[198],"edge-growth":[199],"(PEG)":[200],"PEG":[205],"codes.":[208]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2016-06-24T00:00:00"}
