{"id":"https://openalex.org/W3164830114","doi":"https://doi.org/10.1109/itw48936.2021.9611445","title":"Complexity-Adaptive Maximum-Likelihood Decoding of Modified G<sub>N</sub>-Coset Codes","display_name":"Complexity-Adaptive Maximum-Likelihood Decoding of Modified G<sub>N</sub>-Coset Codes","publication_year":2021,"publication_date":"2021-10-17","ids":{"openalex":"https://openalex.org/W3164830114","doi":"https://doi.org/10.1109/itw48936.2021.9611445","mag":"3164830114"},"language":"en","primary_location":{"id":"doi:10.1109/itw48936.2021.9611445","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","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/A5011579656","display_name":"Peihong Yuan","orcid":"https://orcid.org/0000-0002-2578-7407"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peihong Yuan","raw_affiliation_strings":["Institute for Communications Engineering (LNT), Technical University of Munich (TUM)"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering (LNT), Technical University of Munich (TUM)","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015378774","display_name":"Mustafa Cemil Co\u015fkun","orcid":"https://orcid.org/0000-0003-3070-8782"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mustafa Cemil Coskun","raw_affiliation_strings":["Institute for Communications Engineering (LNT), Technical University of Munich (TUM)"],"affiliations":[{"raw_affiliation_string":"Institute for Communications Engineering (LNT), Technical University of Munich (TUM)","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5011579656"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":1.2226,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7993016,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":93,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"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/T11130","display_name":"Coding theory and cryptography","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9987999796867371,"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/coset","display_name":"Coset","score":0.8412566781044006},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.8092013597488403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6328998804092407},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5461519956588745},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.5292122960090637},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.4940183758735657},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4922281801700592},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4870052933692932},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.4729333221912384},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4414992332458496},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.40075623989105225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34220004081726074}],"concepts":[{"id":"https://openalex.org/C85307737","wikidata":"https://www.wikidata.org/wiki/Q751969","display_name":"Coset","level":2,"score":0.8412566781044006},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8092013597488403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6328998804092407},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5461519956588745},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5292122960090637},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.4940183758735657},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4922281801700592},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4870052933692932},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.4729333221912384},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4414992332458496},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.40075623989105225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34220004081726074},{"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":1,"locations":[{"id":"doi:10.1109/itw48936.2021.9611445","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw48936.2021.9611445","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":55,"referenced_works":["https://openalex.org/W1914450998","https://openalex.org/W2004229705","https://openalex.org/W2014443100","https://openalex.org/W2025948462","https://openalex.org/W2033234285","https://openalex.org/W2087362480","https://openalex.org/W2103524940","https://openalex.org/W2106045225","https://openalex.org/W2106864314","https://openalex.org/W2112446888","https://openalex.org/W2121417875","https://openalex.org/W2121498709","https://openalex.org/W2150498905","https://openalex.org/W2156826724","https://openalex.org/W2161541170","https://openalex.org/W2166594487","https://openalex.org/W2170187382","https://openalex.org/W2284321898","https://openalex.org/W2512258783","https://openalex.org/W2572884048","https://openalex.org/W2591190829","https://openalex.org/W2595493241","https://openalex.org/W2608866305","https://openalex.org/W2740684209","https://openalex.org/W2887598929","https://openalex.org/W2904380145","https://openalex.org/W2963285913","https://openalex.org/W2963389341","https://openalex.org/W2964126297","https://openalex.org/W2976224847","https://openalex.org/W2976297103","https://openalex.org/W2977107755","https://openalex.org/W2995572641","https://openalex.org/W3008435753","https://openalex.org/W3015780016","https://openalex.org/W3037975779","https://openalex.org/W3047833124","https://openalex.org/W3080443224","https://openalex.org/W3082884682","https://openalex.org/W3124677789","https://openalex.org/W3141616885","https://openalex.org/W3141921537","https://openalex.org/W3153818570","https://openalex.org/W3155179867","https://openalex.org/W3184425224","https://openalex.org/W3197313112","https://openalex.org/W3198322199","https://openalex.org/W4394657326","https://openalex.org/W6629907730","https://openalex.org/W6639906953","https://openalex.org/W6742116293","https://openalex.org/W6766958690","https://openalex.org/W6771326266","https://openalex.org/W6787153498","https://openalex.org/W6794221848"],"related_works":["https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W2370284973","https://openalex.org/W2028976748","https://openalex.org/W2050784748","https://openalex.org/W2383267581","https://openalex.org/W2154603729","https://openalex.org/W2127999627","https://openalex.org/W2010879611","https://openalex.org/W2115785601"],"abstract_inverted_index":{"A":[0],"complexity-adaptive":[1],"tree":[2],"search":[3],"algorithm":[4,59,90],"is":[5,24,84,109,112],"proposed":[6],"for":[7,34,70],"$G_{N}$-coset":[8,97],"codes":[9,42,73],"that":[10,27,110],"implements":[11],"maximum-likelihood":[12],"(ML)":[13],"decoding":[14,19,33],"by":[15],"using":[16],"a":[17,67,117],"successive":[18,30],"schedule.":[20],"The":[21,89],"average":[22],"complexity":[23],"close":[25],"to":[26,40,52,60,86,95,115],"of":[28],"the":[29,58,62],"cancellation":[31],"(SC)":[32],"practical":[35],"error":[36],"rates":[37],"when":[38],"applied":[39,94],"polar":[41],"and":[43,74],"short":[44],"Reed-Muller":[45],"(RM)":[46],"codes,":[47],"e.g.,":[48],"block":[49],"lengths":[50],"up":[51],"N":[53],"=":[54],"128.":[55],"By":[56],"modifying":[57],"limit":[61],"worstcase":[63],"complexity,":[64],"one":[65],"obtains":[66],"near-ML":[68],"decoder":[69],"longer":[71],"RM":[72],"their":[75],"subcodes.":[76],"Unlike":[77],"other":[78],"bit-flip":[79],"decoders,":[80],"no":[81,113],"outer":[82],"code":[83,98],"needed":[85],"terminate":[87],"decoding.":[88],"can":[91],"thus":[92],"be":[93],"modified":[96],"constructions":[99],"with":[100],"dynamic":[101],"frozen":[102],"bits.":[103],"One":[104],"advantage":[105],"over":[106],"sequential":[107],"decoders":[108],"there":[111],"need":[114],"optimize":[116],"separate":[118],"parameter.":[119]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}