{"id":"https://openalex.org/W2091823277","doi":"https://doi.org/10.1109/itw.2012.6404658","title":"Constructing good QC-LDPC codes by pre-lifting protographs","display_name":"Constructing good QC-LDPC codes by pre-lifting protographs","publication_year":2012,"publication_date":"2012-09-01","ids":{"openalex":"https://openalex.org/W2091823277","doi":"https://doi.org/10.1109/itw.2012.6404658","mag":"2091823277"},"language":"en","primary_location":{"id":"doi:10.1109/itw.2012.6404658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","raw_type":"proceedings-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/A5076523933","display_name":"David G. M. Mitchell","orcid":"https://orcid.org/0000-0002-3544-9225"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. G. M. Mitchell","raw_affiliation_strings":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061445419","display_name":"Roxana Smarandache","orcid":"https://orcid.org/0000-0001-9085-5974"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"R. Smarandache","raw_affiliation_strings":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089062454","display_name":"Daniel J. Costello","orcid":"https://orcid.org/0000-0002-4387-116X"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel J. Costello","raw_affiliation_strings":["Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electrical Engineering, University of Notre Dame, Indiana, USA]","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3726,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.66504961,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"54","issue":null,"first_page":"202","last_page":"206"},"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.9991999864578247,"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.9896000027656555,"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/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.8233788013458252},{"id":"https://openalex.org/keywords/circulant-matrix","display_name":"Circulant matrix","score":0.7063590288162231},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.6376808285713196},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.6167978644371033},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5210254192352295},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5081279277801514},{"id":"https://openalex.org/keywords/combinatorial-design","display_name":"Combinatorial design","score":0.465945839881897},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4294097423553467},{"id":"https://openalex.org/keywords/minimum-distance","display_name":"Minimum distance","score":0.4170486629009247},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38749566674232483},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3838869333267212},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.31794700026512146},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3094404935836792}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8233788013458252},{"id":"https://openalex.org/C115973184","wikidata":"https://www.wikidata.org/wiki/Q245457","display_name":"Circulant matrix","level":2,"score":0.7063590288162231},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.6376808285713196},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.6167978644371033},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5210254192352295},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5081279277801514},{"id":"https://openalex.org/C122451846","wikidata":"https://www.wikidata.org/wiki/Q5150824","display_name":"Combinatorial design","level":2,"score":0.465945839881897},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4294097423553467},{"id":"https://openalex.org/C3018063660","wikidata":"https://www.wikidata.org/wiki/Q6865448","display_name":"Minimum distance","level":2,"score":0.4170486629009247},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38749566674232483},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3838869333267212},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.31794700026512146},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3094404935836792},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","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},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw.2012.6404658","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw.2012.6404658","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE Information Theory Workshop","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W91277888","https://openalex.org/W1571565904","https://openalex.org/W1667880265","https://openalex.org/W1973712217","https://openalex.org/W2071304218","https://openalex.org/W2079128625","https://openalex.org/W2098676302","https://openalex.org/W2114223390","https://openalex.org/W2114869758","https://openalex.org/W2125816513","https://openalex.org/W2132161120","https://openalex.org/W2133068391","https://openalex.org/W2139645268","https://openalex.org/W2147776616","https://openalex.org/W2150972708","https://openalex.org/W3125301056"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2147429396","https://openalex.org/W2126543779","https://openalex.org/W2181520554","https://openalex.org/W1695003060","https://openalex.org/W1973328817","https://openalex.org/W2010210339","https://openalex.org/W4312824983","https://openalex.org/W2963700364","https://openalex.org/W2096330531"],"abstract_inverted_index":{"Quasi-cyclic":[0],"(QC)":[1],"low-density":[2],"parity-check":[3],"(LDPC)":[4],"codes":[5,35],"are":[6,37,60],"of":[7,14,54,97],"great":[8],"interest":[9],"to":[10,62,76,114],"code":[11],"designers":[12],"because":[13],"their":[15,23],"implementation":[16],"advantages":[17],"and":[18,67,91],"algebraic":[19],"properties":[20],"that":[21,36],"facilitate":[22],"analysis.":[24],"In":[25],"this":[26,51],"paper,":[27],"we":[28,59,104],"present":[29,72],"some":[30],"new":[31],"results":[32],"on":[33,45],"QC-LDPC":[34,78],"constructed":[38],"using":[39],"a":[40,46,95,106,115],"two-step":[41],"lifting":[42],"procedure":[43],"based":[44],"protograph,":[47],"and,":[48],"by":[49,125],"implementing":[50],"method":[52],"instead":[53],"the":[55,87,92,110],"usual":[56],"one-step":[57,116],"procedure,":[58],"able":[61],"show":[63],"improved":[64],"minimum":[65,111],"distance":[66,112],"girth":[68],"properties.":[69],"We":[70],"also":[71],"two":[73],"design":[74],"rules":[75],"construct":[77],"codes:":[79],"one":[80],"uses":[81,94],"only":[82],"circulant":[83],"permutation":[84,99],"matrices":[85],"at":[86],"first":[88],"(pre-lifting)":[89],"stage":[90],"other":[93],"selection":[96],"non-commuting":[98],"matrices.":[100],"For":[101],"both":[102],"techniques,":[103],"obtain":[105],"demonstrable":[107],"increase":[108],"in":[109],"compared":[113],"circulant-based":[117],"lifting.":[118],"The":[119],"expected":[120],"performance":[121],"improvement":[122],"is":[123],"verified":[124],"simulation":[126],"results.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}