{"id":"https://openalex.org/W2346761663","doi":"https://doi.org/10.1109/lcomm.2016.2564401","title":"Superposition Construction of Q-ary LDPC Codes by Jointly Optimizing Girth and Number of Shortest Cycles","display_name":"Superposition Construction of Q-ary LDPC Codes by Jointly Optimizing Girth and Number of Shortest Cycles","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2346761663","doi":"https://doi.org/10.1109/lcomm.2016.2564401","mag":"2346761663"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2016.2564401","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2564401","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications Letters","raw_type":"journal-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/A5072050516","display_name":"Hengzhou Xu","orcid":"https://orcid.org/0000-0001-9403-4460"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hengzhou Xu","raw_affiliation_strings":["State Key Laboratory of ISN, Xidian University, Xi\u2019an, China","State Key Laboratory of ISN, Xidian University, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi'an, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5063124926","display_name":"Baoming Bai","orcid":"https://orcid.org/0000-0002-6161-5493"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Baoming Bai","raw_affiliation_strings":["State Key Laboratory of ISN, Xidian University, Xi\u2019an, China","State Key Laboratory of ISN, Xidian University, Xi'an, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi\u2019an, China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, Xi'an, China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":5.0977,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.95368454,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"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.9988999962806702,"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.9965999722480774,"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.8974997997283936},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5708505511283875},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5356603860855103},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4854179322719574},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.44434884190559387},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.44226762652397156},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4287784993648529},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.420743465423584},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.416047602891922},{"id":"https://openalex.org/keywords/girth","display_name":"Girth (graph theory)","score":0.41188570857048035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3822330832481384},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.36602723598480225}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8974997997283936},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5708505511283875},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5356603860855103},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4854179322719574},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.44434884190559387},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.44226762652397156},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4287784993648529},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.420743465423584},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.416047602891922},{"id":"https://openalex.org/C2777434295","wikidata":"https://www.wikidata.org/wiki/Q959831","display_name":"Girth (graph theory)","level":2,"score":0.41188570857048035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3822330832481384},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.36602723598480225}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2016.2564401","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2016.2564401","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","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 Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W628021441","https://openalex.org/W1943132459","https://openalex.org/W1964402820","https://openalex.org/W1965722157","https://openalex.org/W1973712217","https://openalex.org/W2015684392","https://openalex.org/W2052368793","https://openalex.org/W2077804378","https://openalex.org/W2105440003","https://openalex.org/W2106864314","https://openalex.org/W2107804146","https://openalex.org/W2123796443","https://openalex.org/W2128765501","https://openalex.org/W2133068391","https://openalex.org/W2170785523","https://openalex.org/W2173776306","https://openalex.org/W2299446443","https://openalex.org/W4256264271"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W2150212378","https://openalex.org/W2127950068","https://openalex.org/W1851307089","https://openalex.org/W2209506458","https://openalex.org/W1580452828","https://openalex.org/W2383546851","https://openalex.org/W1996737726","https://openalex.org/W1917873986","https://openalex.org/W2020418355"],"abstract_inverted_index":{"In":[0],"this":[1],"letter,":[2],"we":[3,67],"consider":[4],"the":[5,16,24,40,44,48,53,69,73,103,111,117],"construction":[6],"of":[7,20,26,43,47,56,60,72,97],"q-ary":[8,61,91],"low-density":[9],"parity-check":[10,45],"(LDPC)":[11],"codes":[12,35,51,63,75,93,113],"by":[13,36],"jointly":[14],"optimizing":[15],"girth":[17,105],"and":[18,81,84],"number":[19],"shortest":[21],"cycles":[22,96],"in":[23],"frame":[25],"superposition.":[27,37],"We":[28],"begin":[29],"with":[30,52,94],"constructing":[31],"binary":[32,50],"quasi-cyclic":[33],"LDPC":[34,62,92],"By":[38],"replacing":[39],"nonzero":[41,54],"entries":[42],"matrices":[46],"resulting":[49],"elements":[55],"GF(q),":[57],"a":[58,77,86],"class":[59],"is":[64,102],"obtained.":[65],"Furthermore,":[66],"analyze":[68],"cycle":[70],"structure":[71],"constructed":[74],"for":[76,89],"given":[78],"degree":[79],"distribution":[80],"code":[82],"length,":[83],"present":[85],"search":[87],"algorithm":[88],"finding":[90],"few":[95],"length":[98],"g,":[99],"where":[100],"g":[101],"optimized":[104],"value.":[106],"Simulation":[107],"results":[108],"show":[109],"that":[110],"proposed":[112],"perform":[114],"well":[115],"under":[116],"iterative":[118],"decoding":[119],"algorithms.":[120]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":4}],"updated_date":"2026-08-05T07:39:15.569665","created_date":"2025-10-10T00:00:00"}