{"id":"https://openalex.org/W1926035517","doi":"https://doi.org/10.1109/softcom.2015.7314104","title":"Low-rate LDPC convolutional codes with short constraint length","display_name":"Low-rate LDPC convolutional codes with short constraint length","publication_year":2015,"publication_date":"2015-09-01","ids":{"openalex":"https://openalex.org/W1926035517","doi":"https://doi.org/10.1109/softcom.2015.7314104","mag":"1926035517"},"language":"en","primary_location":{"id":"doi:10.1109/softcom.2015.7314104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/softcom.2015.7314104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","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/A5108167671","display_name":"Marco Baldi","orcid":"https://orcid.org/0000-0002-8754-5526"},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Marco Baldi","raw_affiliation_strings":["The Universit\u00e0 Politecnica delle Marche, Ancona, Italy","Universita' Politecnica delle Marche, Ancona, Italy;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Universit\u00e0 Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]},{"raw_affiliation_string":"Universita' Politecnica delle Marche, Ancona, Italy;","institution_ids":["https://openalex.org/I122534668"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066901921","display_name":"Giovanni Cancellieri","orcid":null},"institutions":[{"id":"https://openalex.org/I122534668","display_name":"Marche Polytechnic University","ror":"https://ror.org/00x69rs40","country_code":"IT","type":"education","lineage":["https://openalex.org/I122534668"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Giovanni Cancellieri","raw_affiliation_strings":["The Universit\u00e0 Politecnica delle Marche, Ancona, Italy","Universita' Politecnica delle Marche, Ancona, Italy;"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Universit\u00e0 Politecnica delle Marche, Ancona, Italy","institution_ids":["https://openalex.org/I122534668"]},{"raw_affiliation_string":"Universita' Politecnica delle Marche, Ancona, Italy;","institution_ids":["https://openalex.org/I122534668"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122534668"],"apc_list":null,"apc_paid":null,"fwci":1.6922,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85814435,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"330","last_page":"335"},"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.9973999857902527,"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.9912999868392944,"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.8156083822250366},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.6348278522491455},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.623992383480072},{"id":"https://openalex.org/keywords/generator-matrix","display_name":"Generator matrix","score":0.5977477431297302},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.589905321598053},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.584469199180603},{"id":"https://openalex.org/keywords/tanner-graph","display_name":"Tanner graph","score":0.5502927899360657},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5080468654632568},{"id":"https://openalex.org/keywords/convolutional-code","display_name":"Convolutional code","score":0.5051935315132141},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4952053129673004},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.49348247051239014},{"id":"https://openalex.org/keywords/parity-check-matrix","display_name":"Parity-check matrix","score":0.4268602430820465},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.4219495356082916},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.41773396730422974},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4084818363189697},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.36717766523361206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29926514625549316},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.25479787588119507},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.23128274083137512}],"concepts":[{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.8156083822250366},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.6348278522491455},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.623992383480072},{"id":"https://openalex.org/C1842014","wikidata":"https://www.wikidata.org/wiki/Q1502046","display_name":"Generator matrix","level":3,"score":0.5977477431297302},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.589905321598053},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.584469199180603},{"id":"https://openalex.org/C87117866","wikidata":"https://www.wikidata.org/wiki/Q7683664","display_name":"Tanner graph","level":5,"score":0.5502927899360657},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5080468654632568},{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.5051935315132141},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4952053129673004},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.49348247051239014},{"id":"https://openalex.org/C95925971","wikidata":"https://www.wikidata.org/wiki/Q3100414","display_name":"Parity-check matrix","level":4,"score":0.4268602430820465},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.4219495356082916},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.41773396730422974},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4084818363189697},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.36717766523361206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29926514625549316},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.25479787588119507},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.23128274083137512},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/softcom.2015.7314104","is_oa":false,"landing_page_url":"https://doi.org/10.1109/softcom.2015.7314104","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 23rd International Conference on Software, Telecommunications and Computer Networks (SoftCOM)","raw_type":"proceedings-article"},{"id":"pmh:oai:iris.univpm.it:11566/227919","is_oa":false,"landing_page_url":"http://hdl.handle.net/11566/227919","pdf_url":null,"source":{"id":"https://openalex.org/S4306402571","display_name":"Universit\u00e0 Politecnica delle Marche (Universit\u00e0 Politecnica delle Marche)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122534668","host_organization_name":"Marche Polytechnic University","host_organization_lineage":["https://openalex.org/I122534668"],"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":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W428659122","https://openalex.org/W628021441","https://openalex.org/W1667880265","https://openalex.org/W1864365761","https://openalex.org/W1994270153","https://openalex.org/W2041698291","https://openalex.org/W2113113053","https://openalex.org/W2141836583","https://openalex.org/W2144758604","https://openalex.org/W2150368154","https://openalex.org/W3125301056","https://openalex.org/W4256264271"],"related_works":["https://openalex.org/W2350442631","https://openalex.org/W2367967120","https://openalex.org/W2883494139","https://openalex.org/W2148762366","https://openalex.org/W2129460033","https://openalex.org/W2090897912","https://openalex.org/W2157945138","https://openalex.org/W2076495982","https://openalex.org/W2108992672","https://openalex.org/W2771023700"],"abstract_inverted_index":{"We":[0,25,118],"study":[1,143],"a":[2,58,93,139],"family":[3],"of":[4,11,46,53,135],"LDPC":[5],"convolutional":[6],"codes":[7,69,128],"having":[8],"code":[9,112,145],"rate":[10],"the":[12,35,42,51,71,80,111,121,127,133,144],"type":[13],"1/a,":[14],"and":[15,20,37,89,131],"analyze":[16],"their":[17,75,97],"minimum":[18,76,123],"distance":[19,77,124],"local":[21],"cycles":[22],"length":[23,84],"properties.":[24,146],"consider":[26],"some":[27],"low":[28],"weight":[29],"codewords":[30],"that":[31,100,110],"are":[32,38],"known":[33],"from":[34,41,50],"literature,":[36],"easily":[39],"obtained":[40],"symbolic":[43,136],"parity-check":[44],"matrix":[45],"these":[47,68],"codes.":[48],"Starting":[49],"structure":[52],"such":[54],"codewords,":[55],"we":[56,62,91,108,129],"follow":[57],"twofold":[59],"approach:":[60],"i)":[61],"exploit":[63],"graph-based":[64],"techniques":[65],"to":[66,73,102,142],"design":[67,113],"with":[70],"aim":[72],"maximize":[74],"while":[78],"keeping":[79],"syndrome":[81],"former":[82],"constraint":[83],"as":[85,87,138],"small":[86],"possible":[88],"ii)":[90],"provide":[92],"simple":[94],"form":[95],"for":[96,126],"generator":[98],"matrices":[99],"allows":[101],"perform":[103],"exhaustive":[104],"searches":[105],"through":[106],"which":[107],"verify":[109],"actually":[114],"reaches":[115],"its":[116],"target.":[117],"also":[119],"estimate":[120],"normalized":[122],"multiplicity":[125],"consider,":[130],"introduce":[132],"notion":[134],"graphs":[137],"new":[140],"tool":[141]},"counts_by_year":[{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3}],"updated_date":"2026-07-02T09:51:11.867554","created_date":"2025-10-10T00:00:00"}