{"id":"https://openalex.org/W3211987305","doi":"https://doi.org/10.1109/istc49272.2021.9594194","title":"List decoding for concatenated codes based on the Plotkin construction with BCH component codes","display_name":"List decoding for concatenated codes based on the Plotkin construction with BCH component codes","publication_year":2021,"publication_date":"2021-08-30","ids":{"openalex":"https://openalex.org/W3211987305","doi":"https://doi.org/10.1109/istc49272.2021.9594194","mag":"3211987305"},"language":"en","primary_location":{"id":"doi:10.1109/istc49272.2021.9594194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc49272.2021.9594194","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/A5008361678","display_name":"Daniel Nicolas Bailon","orcid":"https://orcid.org/0000-0002-9578-0796"},"institutions":[{"id":"https://openalex.org/I9649716","display_name":"HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung","ror":"https://ror.org/051qw9f78","country_code":"DE","type":"education","lineage":["https://openalex.org/I9649716"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel Nicolas Bailon","raw_affiliation_strings":["Institute for System Dynamics HTWG Konstanz, University of Applied Sciences, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for System Dynamics HTWG Konstanz, University of Applied Sciences, Germany","institution_ids":["https://openalex.org/I9649716"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018506368","display_name":"J\u00fcrgen Freudenberger","orcid":"https://orcid.org/0000-0002-5913-4981"},"institutions":[{"id":"https://openalex.org/I9649716","display_name":"HTWG Hochschule Konstanz - Technik, Wirtschaft und Gestaltung","ror":"https://ror.org/051qw9f78","country_code":"DE","type":"education","lineage":["https://openalex.org/I9649716"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Jurgen Freudenberger","raw_affiliation_strings":["Institute for System Dynamics HTWG Konstanz, University of Applied Sciences, Germany"],"affiliations":[{"raw_affiliation_string":"Institute for System Dynamics HTWG Konstanz, University of Applied Sciences, Germany","institution_ids":["https://openalex.org/I9649716"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008361678"],"corresponding_institution_ids":["https://openalex.org/I9649716"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1964417,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"59","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":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.9994999766349792,"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/T12029","display_name":"DNA and Biological Computing","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.8386201858520508},{"id":"https://openalex.org/keywords/bch-code","display_name":"BCH code","score":0.8348057270050049},{"id":"https://openalex.org/keywords/concatenation","display_name":"Concatenation (mathematics)","score":0.7872347831726074},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.6430336236953735},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5982959270477295},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5919761657714844},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5877471566200256},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.5697565674781799},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.48445773124694824},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4766055941581726},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46662840247154236},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.4475463628768921},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41716575622558594},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.29008960723876953}],"concepts":[{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.8386201858520508},{"id":"https://openalex.org/C42276685","wikidata":"https://www.wikidata.org/wiki/Q795705","display_name":"BCH code","level":3,"score":0.8348057270050049},{"id":"https://openalex.org/C87619178","wikidata":"https://www.wikidata.org/wiki/Q126002","display_name":"Concatenation (mathematics)","level":2,"score":0.7872347831726074},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.6430336236953735},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5982959270477295},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5919761657714844},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5877471566200256},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.5697565674781799},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.48445773124694824},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4766055941581726},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46662840247154236},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.4475463628768921},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41716575622558594},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.29008960723876953}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/istc49272.2021.9594194","is_oa":false,"landing_page_url":"https://doi.org/10.1109/istc49272.2021.9594194","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:elib.uni-konstanz.de-htwg:2985","is_oa":false,"landing_page_url":"https://opus.htwg-konstanz.de/frontdoor/index/index/docId/2985","pdf_url":null,"source":{"id":"https://openalex.org/S4306400170","display_name":"URN-Resolver at the German National Library (German National Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2802635041","host_organization_name":"Technische Informationsbibliothek (TIB)","host_organization_lineage":["https://openalex.org/I2802635041"],"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":"doc-type:conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1535816011","https://openalex.org/W1914450998","https://openalex.org/W1971933274","https://openalex.org/W2025948462","https://openalex.org/W2033234285","https://openalex.org/W2096124275","https://openalex.org/W2101828326","https://openalex.org/W2106045225","https://openalex.org/W2155316710","https://openalex.org/W2156826724","https://openalex.org/W2164368671","https://openalex.org/W2170716519","https://openalex.org/W2769478600","https://openalex.org/W2960200274","https://openalex.org/W2970814452","https://openalex.org/W3018441865","https://openalex.org/W3084582945","https://openalex.org/W3133831695","https://openalex.org/W3134729165","https://openalex.org/W6639906953","https://openalex.org/W6674687461"],"related_works":["https://openalex.org/W1995527419","https://openalex.org/W2385322349","https://openalex.org/W2066795426","https://openalex.org/W2369600518","https://openalex.org/W1978637058","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W4244153028","https://openalex.org/W2050784748","https://openalex.org/W2010879611"],"abstract_inverted_index":{"Reed-Muller":[0],"codes":[1,14,26,114],"are":[2],"a":[3,33,61,79,85],"popular":[4],"code":[5,35,54,117],"family":[6],"based":[7],"on":[8],"the":[9,38,52,66,95,99],"Plotkin":[10,39,67,96],"construction.":[11],"Recently,":[12],"these":[13],"have":[15],"regained":[16],"some":[17],"interest":[18],"due":[19],"to":[20,24,78],"their":[21,28],"close":[22],"relation":[23],"polar":[25,113],"and":[27],"low-complexity":[29],"decoding.":[30],"We":[31],"consider":[32,60],"similar":[34],"family,":[36],"i.e.,":[37],"concatenation":[40,68,97],"with":[41,69,83,98],"binary":[42],"BCH":[43,70],"component":[44,71],"codes.":[45,72],"This":[46,108],"construction":[47],"is":[48],"more":[49],"flexible":[50],"regarding":[51],"attainable":[53],"parameters.":[55],"In":[56],"this":[57],"work,":[58],"we":[59],"list-based":[62],"decoding":[63,76,101,106],"algorithm":[64],"for":[65,115],"The":[73],"proposed":[74,100],"list":[75],"leads":[77],"significant":[80],"coding":[81,109],"gain":[82],"only":[84],"small":[86],"increase":[87],"in":[88],"computational":[89],"complexity.":[90],"Simulation":[91],"results":[92],"demonstrate":[93],"that":[94],"achieves":[102],"near":[103],"maximum":[104],"likelihood":[105],"performance.":[107],"scheme":[110],"can":[111],"outperform":[112],"moderate":[116],"lengths.":[118]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}