{"id":"https://openalex.org/W2081524279","doi":"https://doi.org/10.1109/isit.2014.6875339","title":"LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios","display_name":"LDPC convolutional codes versus QC LDPC block codes in communication standard scenarios","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W2081524279","doi":"https://doi.org/10.1109/isit.2014.6875339","mag":"2081524279"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6875339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 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/A5018999589","display_name":"Irina E. Bocharova","orcid":"https://orcid.org/0000-0002-6460-4626"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]},{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Irina E. Bocharova","raw_affiliation_strings":["Dept. of Information Systems, St.-Petersburg Univ. of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia","Dept. of Inf. Syst., St.Petersburg Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Systems, St.-Petersburg Univ. of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia","institution_ids":["https://openalex.org/I173089394","https://openalex.org/I172901346"]},{"raw_affiliation_string":"Dept. of Inf. Syst., St.Petersburg Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088880021","display_name":"Boris D. Kudryashov","orcid":"https://orcid.org/0000-0002-5865-5283"},"institutions":[{"id":"https://openalex.org/I172901346","display_name":"St Petersburg University","ror":"https://ror.org/023znxa73","country_code":"RU","type":"education","lineage":["https://openalex.org/I172901346"]},{"id":"https://openalex.org/I173089394","display_name":"ITMO University","ror":"https://ror.org/04txgxn49","country_code":"RU","type":"education","lineage":["https://openalex.org/I173089394"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Boris D. Kudryashov","raw_affiliation_strings":["Dept. of Information Systems, St.-Petersburg Univ. of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia","Dept. of Inf. Syst., St.Petersburg Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Information Systems, St.-Petersburg Univ. of Information Technologies, Mechanics and Optics, St.-Petersburg, Russia","institution_ids":["https://openalex.org/I173089394","https://openalex.org/I172901346"]},{"raw_affiliation_string":"Dept. of Inf. Syst., St.Petersburg Univ. of Inf. Technol., Mech. & Opt., St. Petersburg, Russia","institution_ids":["https://openalex.org/I172901346"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044516030","display_name":"Rolf Johannesson","orcid":null},"institutions":[{"id":"https://openalex.org/I187531555","display_name":"Lund University","ror":"https://ror.org/012a77v79","country_code":"SE","type":"education","lineage":["https://openalex.org/I187531555"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Rolf Johannesson","raw_affiliation_strings":["Dept. of Electrical and Information Technology, Lund University, Lund, Sweden","Dept. of Electr. & Inf. Technol., Lund Univ., Lund, , Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Information Technology, Lund University, Lund, Sweden","institution_ids":["https://openalex.org/I187531555"]},{"raw_affiliation_string":"Dept. of Electr. & Inf. Technol., Lund Univ., Lund, , Sweden","institution_ids":["https://openalex.org/I187531555"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.5989,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.93603388,"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":"2774","last_page":"2778"},"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.9998000264167786,"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.9979000091552734,"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.9251025915145874},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6372389197349548},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6135554313659668},{"id":"https://openalex.org/keywords/forward-error-correction","display_name":"Forward error correction","score":0.6087103486061096},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.5711743235588074},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4609137177467346},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42599719762802124},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.4217422902584076},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.41621652245521545},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40679776668548584},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.30636370182037354}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.9251025915145874},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6372389197349548},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6135554313659668},{"id":"https://openalex.org/C202932441","wikidata":"https://www.wikidata.org/wiki/Q55611017","display_name":"Forward error correction","level":3,"score":0.6087103486061096},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.5711743235588074},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4609137177467346},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42599719762802124},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.4217422902584076},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.41621652245521545},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40679776668548584},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.30636370182037354}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2014.6875339","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6875339","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:lup.lub.lu.se:6d470e1d-9489-42c9-a76a-3bf83dfeb9d3","is_oa":false,"landing_page_url":"https://lup.lub.lu.se/record/4647403","pdf_url":null,"source":{"id":"https://openalex.org/S4306400536","display_name":"Lund University Publications (Lund University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I187531555","host_organization_name":"Lund University","host_organization_lineage":["https://openalex.org/I187531555"],"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":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1793808004","https://openalex.org/W1853491647","https://openalex.org/W2044313968","https://openalex.org/W2049344438","https://openalex.org/W2074450800","https://openalex.org/W2094085127","https://openalex.org/W2094856900","https://openalex.org/W2113420173","https://openalex.org/W2136204051","https://openalex.org/W2169732368","https://openalex.org/W6662884635"],"related_works":["https://openalex.org/W2015101254","https://openalex.org/W1972318883","https://openalex.org/W2121305283","https://openalex.org/W2534582423","https://openalex.org/W2015741799","https://openalex.org/W1944343091","https://openalex.org/W2168862745","https://openalex.org/W3114701954","https://openalex.org/W1603044377","https://openalex.org/W2098086720"],"abstract_inverted_index":{"Outstanding":[0],"asymptotical":[1],"performance":[2],"demonstrated":[3],"by":[4],"low-density":[5],"parity-check":[6],"(LDPC)":[7],"convolutional":[8],"codes":[9,22],"(CC)":[10],"makes":[11],"them":[12],"strong":[13],"competitors":[14],"with":[15,104,190,214],"respect":[16],"to":[17,57,168],"quasi-cyclic":[18],"(QC)":[19],"LDPC":[20,98,102,128,133,138,149,162,171,188,203],"block":[21],"(BC)":[23],"currently":[24],"used":[25],"in":[26,196],"a":[27,157],"variety":[28],"of":[29,49,64],"communication":[30,34],"standards.":[31],"However,":[32],"typically":[33],"standards,":[35],"for":[36,117,145],"example,":[37],"DVB-S2":[38],"or":[39],"WIMax":[40],"standards":[41],"impose":[42],"rather":[43],"serious":[44],"restrictions":[45,54],"on":[46],"the":[47,50,89,92,132,152,161,169,174,187,198,208,230],"structure":[48,193],"employed":[51],"codes.":[52],"These":[53],"are":[55,75,84,115],"related":[56],"different":[58],"implementation":[59],"issues":[60],"such":[61],"as":[62],"existence":[63],"low-complexity":[65,82,113,191],"encoding":[66,192],"and":[67,81,100,108,123],"decoding,":[68],"short":[69],"decoding":[70,158,184,215],"delay":[71,122,159,216],"etc.":[72],"Two":[73],"scenarios":[74],"considered.":[76],"In":[77,88,135],"one":[78],"scenario,":[79,91],"short-delay":[80],"constraints":[83,125],"taken":[85],"into":[86],"account.":[87],"other":[90,153],"complexity":[93,124],"requirement":[94],"is":[95,205],"relaxed.":[96],"Both":[97],"CCs":[99,139,163,189],"QC":[101,127,148,170],"BCs":[103,129,172],"optimized":[105],"degree":[106],"distribution":[107],"girth":[109],"profile,":[110],"which":[111],"enable":[112],"encoding,":[114],"constructed":[116],"these":[118],"scenarios.":[119],"Having":[120],"both":[121],"yields":[126],"that":[130,222],"outperform":[131],"CCs.":[134],"this":[136],"scenario":[137],"play":[140],"an":[141],"important":[142],"role":[143],"mostly":[144],"constructing":[146],"tailbiting":[147],"BCs.":[150],"On":[151],"hand,":[154],"assuming":[155],"only":[156,225],"constraint":[160],"can":[164],"be":[165],"superior":[166],"compared":[167],"at":[173,219],"relatively":[175],"low":[176],"signal-to-noise":[177],"ratio":[178],"region.":[179],"Moreover,":[180],"under":[181],"practically":[182],"acceptable":[183],"delays":[185],"also":[186],"beat":[194],"records":[195],"approaching":[197],"Shannon":[199,231],"limit.":[200,232],"A":[201],"new":[202],"CC":[204],"presented":[206],"achieving":[207],"BER":[209],"10":[210],"<sup":[211],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[212],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">-7</sup>":[213],"96000":[217],"bits":[218],"0.62":[220],"dB,":[221],"is,":[223],"performing":[224],"about":[226],"0.43":[227],"dB":[228],"from":[229]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
