{"id":"https://openalex.org/W2146033312","doi":"https://doi.org/10.1109/isit.2007.4557390","title":"On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes","display_name":"On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes","publication_year":2007,"publication_date":"2007-06-01","ids":{"openalex":"https://openalex.org/W2146033312","doi":"https://doi.org/10.1109/isit.2007.4557390","mag":"2146033312"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2007.4557390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","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/A5059780057","display_name":"Al\u00ed Emre Pusane","orcid":"https://orcid.org/0000-0002-8412-6684"},"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":true,"raw_author_name":"Ali Emre Pusane","raw_affiliation_strings":["Department of EE, University of Notre Dame, Notre Dame, IN, USA","Univ. of Notre Dame Notre Dame"],"affiliations":[{"raw_affiliation_string":"Department of EE, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Univ. of Notre Dame Notre Dame","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/I26538001","display_name":"San Diego State University","ror":"https://ror.org/0264fdx42","country_code":"US","type":"education","lineage":["https://openalex.org/I26538001"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Roxana Smarandache","raw_affiliation_strings":["Department of Mathematics and Statistics, San Diego State University, San Diego, CA, USA","Dept. of Math. and Stat., San Diego State Univ., San Diego, CA 92182. rsmarand@math.sdsu.edu"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, San Diego State University, San Diego, CA, USA","institution_ids":["https://openalex.org/I26538001"]},{"raw_affiliation_string":"Dept. of Math. and Stat., San Diego State Univ., San Diego, CA 92182. rsmarand@math.sdsu.edu","institution_ids":["https://openalex.org/I26538001"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5028154201","display_name":"Pascal O. Vontobel","orcid":"https://orcid.org/0000-0002-6180-258X"},"institutions":[{"id":"https://openalex.org/I1324840837","display_name":"Hewlett-Packard (United States)","ror":"https://ror.org/059rn9488","country_code":"US","type":"company","lineage":["https://openalex.org/I1324840837"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pascal O. Vontobel","raw_affiliation_strings":["Hewlett Packard Laboratories, Palo Alto, CA, USA","Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94304. pascal.vontobel@ieee.org"],"affiliations":[{"raw_affiliation_string":"Hewlett Packard Laboratories, Palo Alto, CA, USA","institution_ids":["https://openalex.org/I1324840837"]},{"raw_affiliation_string":"Hewlett-Packard Laboratories, 1501 Page Mill Road, Palo Alto, CA 94304. pascal.vontobel@ieee.org","institution_ids":["https://openalex.org/I1324840837"]}]},{"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":["Department of EE, University of Notre Dame, Notre Dame, IN, USA","Dept. of EE, Univ. of Notre Dame, Notre Dame, IN 46556. costello.2@nd.edu"],"affiliations":[{"raw_affiliation_string":"Department of EE, University of Notre Dame, Notre Dame, IN, USA","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"Dept. of EE, Univ. of Notre Dame, Notre Dame, IN 46556. costello.2@nd.edu","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5059780057"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":3.5296,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.93369656,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1221","last_page":"1225"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998999834060669,"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.9998999834060669,"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.9986000061035156,"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.9966999888420105,"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/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.8616043925285339},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.8218348622322083},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.7969372868537903},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.7355342507362366},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.7098261117935181},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.6596930027008057},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.653354823589325},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5689138174057007},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5293033123016357},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5259318947792053},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4028889536857605},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3435060381889343}],"concepts":[{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.8616043925285339},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.8218348622322083},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.7969372868537903},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.7355342507362366},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.7098261117935181},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.6596930027008057},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.653354823589325},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5689138174057007},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5293033123016357},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5259318947792053},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4028889536857605},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3435060381889343}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2007.4557390","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2007.4557390","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1588943481","https://openalex.org/W1991528082","https://openalex.org/W2071304218","https://openalex.org/W2081471788","https://openalex.org/W2106117658","https://openalex.org/W2110148463","https://openalex.org/W2125905426","https://openalex.org/W2136204051","https://openalex.org/W2167796668","https://openalex.org/W2169134868","https://openalex.org/W2394987168","https://openalex.org/W2962897197","https://openalex.org/W4214522349","https://openalex.org/W6635197353","https://openalex.org/W6676345357"],"related_works":["https://openalex.org/W1972318883","https://openalex.org/W2121305283","https://openalex.org/W2534582423","https://openalex.org/W2015741799","https://openalex.org/W792671342","https://openalex.org/W2015101254","https://openalex.org/W1996737726","https://openalex.org/W1580452828","https://openalex.org/W2075640816","https://openalex.org/W2108305388"],"abstract_inverted_index":{"In":[0,23],"this":[1],"paper":[2],"we":[3,31],"study":[4],"the":[5,34,38,47,51,59,68,81,86,92,98,104,110],"iterative":[6],"decoding":[7,87],"behavior":[8,88],"of":[9,37,50],"time-invariant":[10,117],"and":[11,96,115],"time-varying":[12,27,105],"LDPC":[13,20,28],"convolutional":[14,29,39,61,106,118],"codes":[15,62,107,114],"derived":[16],"by":[17,91,97],"unwrapping":[18],"QC":[19,53,69,112],"block":[21,113],"codes.":[22,70],"particular,":[24],"for":[25],"a":[26],"code,":[30],"show":[32],"that":[33,58],"minimum":[35,48],"pseudo-weight":[36,49],"code":[40],"is":[41,89],"at":[42],"least":[43],"as":[44,46],"large":[45],"underlying":[52,111],"code.":[54],"We":[55],"also":[56],"prove":[57],"unwrapped":[60],"have":[63],"fewer":[64],"short":[65],"cycles":[66],"than":[67],"These":[71],"results":[72],"taken":[73],"together":[74],"lead":[75],"to":[76],"improved":[77],"BER":[78],"performance":[79],"in":[80],"low-to-moderate":[82],"SNR":[83],"region,":[84],"where":[85],"influenced":[90],"complete":[93],"pseudo-codeword":[94],"spectra":[95],"Tanner":[99],"graph":[100],"cycle":[101],"histogram,":[102],"with":[103],"outperforming":[108],"both":[109],"their":[116],"counterparts.":[119]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
