{"id":"https://openalex.org/W3213897248","doi":"https://doi.org/10.1109/istc49272.2021.9594116","title":"Rate-adaptive Concatenated Multilevel Coding with Fixed Decoding Complexity","display_name":"Rate-adaptive Concatenated Multilevel Coding with Fixed Decoding Complexity","publication_year":2021,"publication_date":"2021-08-30","ids":{"openalex":"https://openalex.org/W3213897248","doi":"https://doi.org/10.1109/istc49272.2021.9594116","mag":"3213897248"},"language":"en","primary_location":{"id":"doi:10.1109/istc49272.2021.9594116","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc49272.2021.9594116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 11th International Symposium on Topics in Coding (ISTC)","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/A5000938102","display_name":"Tayyab Mehmood","orcid":"https://orcid.org/0000-0001-9303-0484"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Tayyab Mehmood","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091317407","display_name":"Metodi P. Yankov","orcid":"https://orcid.org/0000-0003-0682-7001"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Metodi P. Yankov","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019279820","display_name":"S\u00f8ren Forchhammer","orcid":"https://orcid.org/0000-0002-6698-8870"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Soren Forchhammer","raw_affiliation_strings":["Technical University of Denmark, Lyngby, Denmark"],"affiliations":[{"raw_affiliation_string":"Technical University of Denmark, Lyngby, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5000938102"],"corresponding_institution_ids":["https://openalex.org/I96673099"],"apc_list":null,"apc_paid":null,"fwci":0.48,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.68086783,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9997000098228455,"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.9997000098228455,"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.9994000196456909,"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/T10232","display_name":"Optical Network Technologies","score":0.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7561448812484741},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.749940037727356},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6557720899581909},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5989157557487488},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5438119173049927},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.5353230834007263},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.43103963136672974},{"id":"https://openalex.org/keywords/polar-code","display_name":"Polar code","score":0.42295658588409424},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38674062490463257},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2472151219844818},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.10270115733146667},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.07534527778625488}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7561448812484741},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.749940037727356},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6557720899581909},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5989157557487488},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5438119173049927},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.5353230834007263},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.43103963136672974},{"id":"https://openalex.org/C2778396592","wikidata":"https://www.wikidata.org/wiki/Q7209069","display_name":"Polar code","level":3,"score":0.42295658588409424},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38674062490463257},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2472151219844818},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.10270115733146667},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.07534527778625488},{"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/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/istc49272.2021.9594116","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc49272.2021.9594116","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 11th International Symposium on Topics in Coding (ISTC)","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.atira.dk:publications/fd4c778b-3444-4269-9d26-5d0d64e6cfee","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/fd4c778b-3444-4269-9d26-5d0d64e6cfee","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mehmood , T , Yankov , M P & Forchhammer , S 2021 , Rate-adaptive Concatenated Multilevel Coding with Fixed Decoding Complexity . in Proceedings of 11 th International Symposium on Topics in Coding . IEEE , 11 th International Symposium on Topics in Coding , Montr\u00e9al , Quebec , Canada , 30/08/2021 . https://doi.org/10.1109/ISTC49272.2021.9594116","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8199999928474426,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2009147117","https://openalex.org/W2086381958","https://openalex.org/W2104310451","https://openalex.org/W2133401839","https://openalex.org/W2591811121","https://openalex.org/W2793068283","https://openalex.org/W2910566679","https://openalex.org/W2910758021","https://openalex.org/W2995195322","https://openalex.org/W3009080122","https://openalex.org/W3014218444","https://openalex.org/W3101586883","https://openalex.org/W3104912281","https://openalex.org/W3118220768","https://openalex.org/W3125483070","https://openalex.org/W6786172099"],"related_works":["https://openalex.org/W3009157344","https://openalex.org/W2008803526","https://openalex.org/W4242191701","https://openalex.org/W2999449748","https://openalex.org/W2006806023","https://openalex.org/W2786545028","https://openalex.org/W4301408693","https://openalex.org/W2802025353","https://openalex.org/W2885004924","https://openalex.org/W4200598316"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"a":[3,40,45,51,62],"low-complexity":[4],"multilevel":[5],"coding":[6],"(MLC)":[7],"based":[8,54],"coded":[9],"modulation":[10],"approach":[11],"having":[12,71],"rate":[13,78],"flexibility":[14],"with":[15,33,79,93,122],"two":[16],"degrees":[17],"of":[18,24,65,85,136],"freedom":[19],"is":[20,47],"proposed.":[21],"It":[22],"consists":[23],"an":[25,34],"inner":[26,66,105,124,138],"soft-decision":[27],"(SD)":[28],"polar":[29],"code":[30,96,99],"serially":[31],"concatenated":[32],"outer":[35,43,94,126],"hard-decision":[36],"(HD)":[37],"code.":[38],"For":[39],"given":[41],"HD":[42],"code,":[44],"method":[46],"developed":[48],"to":[49,110,113,130],"optimize":[50],"multi-stage":[52],"decoding":[53,67],"MLC":[55,91,116,120],"scheme":[56,92],"so":[57],"that":[58],"it":[59],"will":[60],"require":[61],"fixed":[63],"amount":[64],"operations":[68],"and":[69,97,102,125],"thereby":[70],"constant":[72],"complexity":[73],"while":[74],"changing":[75],"the":[76,83,89,114,118,134],"transmission":[77,87],"near-continuous":[80],"granularity.":[81],"Over":[82],"range":[84],"studied":[86],"rates,":[88],"proposed":[90,119],"staircase":[95],"zipper":[98],"utilizes":[100],"75%,":[101],"73%":[103],"fewer":[104],"SD":[106,139],"decodings,":[107],"respectively,":[108],"compared":[109],"BICM.":[111],"Compared":[112],"existing":[115],"approaches,":[117],"scheme,":[121],"same":[123],"codes,":[127],"provides":[128],"up":[129],"72%":[131],"reduction":[132],"in":[133],"number":[135],"required":[137],"decodings.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}