{"id":"https://openalex.org/W4407098297","doi":"https://doi.org/10.23919/isita60732.2024.10858262","title":"Recursive Algorithm for Maximum Likelihood Decoding of Non-Binary Codes","display_name":"Recursive Algorithm for Maximum Likelihood Decoding of Non-Binary Codes","publication_year":2024,"publication_date":"2024-11-10","ids":{"openalex":"https://openalex.org/W4407098297","doi":"https://doi.org/10.23919/isita60732.2024.10858262"},"language":"en","primary_location":{"id":"doi:10.23919/isita60732.2024.10858262","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita60732.2024.10858262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","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/A5088133241","display_name":"Yingtao Zhou","orcid":"https://orcid.org/0000-0003-0764-6288"},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yingtao Zhou","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601","institution_ids":["https://openalex.org/I60134161"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113863452","display_name":"Yuichi Kaji","orcid":null},"institutions":[{"id":"https://openalex.org/I60134161","display_name":"Nagoya University","ror":"https://ror.org/04chrp450","country_code":"JP","type":"education","lineage":["https://openalex.org/I60134161"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuichi Kaji","raw_affiliation_strings":["Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Nagoya University,Nagoya,JAPAN,464\u20138601","institution_ids":["https://openalex.org/I60134161"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.29432243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"12","last_page":"17"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9614999890327454,"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.9614999890327454,"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.9458000063896179,"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.7354651689529419},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.652064859867096},{"id":"https://openalex.org/keywords/sequential-decoding","display_name":"Sequential decoding","score":0.6371121406555176},{"id":"https://openalex.org/keywords/berlekamp\u2013welch-algorithm","display_name":"Berlekamp\u2013Welch algorithm","score":0.5865593552589417},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5803843140602112},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.5486236810684204},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.474109947681427},{"id":"https://openalex.org/keywords/maximum-likelihood","display_name":"Maximum likelihood","score":0.4501509368419647},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.3013988137245178},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23970773816108704},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.21268057823181152},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.12960141897201538},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10194432735443115}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7354651689529419},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.652064859867096},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.6371121406555176},{"id":"https://openalex.org/C132727834","wikidata":"https://www.wikidata.org/wiki/Q4892328","display_name":"Berlekamp\u2013Welch algorithm","level":5,"score":0.5865593552589417},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5803843140602112},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5486236810684204},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.474109947681427},{"id":"https://openalex.org/C49781872","wikidata":"https://www.wikidata.org/wiki/Q1045555","display_name":"Maximum likelihood","level":2,"score":0.4501509368419647},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.3013988137245178},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23970773816108704},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.21268057823181152},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.12960141897201538},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10194432735443115}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/isita60732.2024.10858262","is_oa":false,"landing_page_url":"https://doi.org/10.23919/isita60732.2024.10858262","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 International Symposium on Information Theory and Its Applications (ISITA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.49000000953674316,"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities"}],"awards":[{"id":"https://openalex.org/G991087690","display_name":null,"funder_award_id":"202308050115","funder_id":"https://openalex.org/F4320322725","funder_display_name":"China Scholarship Council"}],"funders":[{"id":"https://openalex.org/F4320322725","display_name":"China Scholarship Council","ror":"https://ror.org/04atp4p48"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1965275036","https://openalex.org/W1976480044","https://openalex.org/W1991133427","https://openalex.org/W2035929826","https://openalex.org/W2073236804","https://openalex.org/W2097668185","https://openalex.org/W2120033635","https://openalex.org/W2120232598","https://openalex.org/W2155316710","https://openalex.org/W2155548348","https://openalex.org/W2170125046","https://openalex.org/W2921976331","https://openalex.org/W2954103209","https://openalex.org/W3045960439","https://openalex.org/W3081226435","https://openalex.org/W3144798926"],"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/W2102627024","https://openalex.org/W2182594114","https://openalex.org/W2127999627","https://openalex.org/W2010879611"],"abstract_inverted_index":{"The":[0,73],"maximum":[1],"likelihood":[2],"(ML)":[3],"decoding":[4,13,28,42,62,88,111,131],"is":[5,15,23,56,79],"essential":[6],"for":[7,33,68,93,113,133],"error-correcting":[8],"codes,":[9],"but":[10],"the":[11,83,100,110,124,128],"ML":[12,27,41,61,87,130],"problem":[14],"NP-hard":[16],"in":[17,76],"general.":[18],"This":[19,54,96],"suggests":[20],"that":[21,30,48,64,90,99,107],"there":[22],"no":[24],"single":[25],"universal":[26],"algorithm":[29,63,74,89,112],"works":[31],"efficiently":[32],"an":[34,60],"arbitrary":[35],"code.":[36],"Therefore":[37],"researchers":[38],"developed":[39],"many":[40],"algorithms":[43],"with":[44],"different":[45],"characteristics":[46],"so":[47],"they":[49],"can":[50,65,116],"be":[51,66,117],"used":[52,67],"complementary.":[53],"study":[55],"intended":[57],"to":[58,119],"propose":[59],"general":[69],"non-binary":[70,135],"linear":[71,105,136],"codes.":[72,95,137],"proposed":[75],"this":[77],"paper":[78,97],"a":[80],"generalization":[81],"of":[82,104,127],"adaptive":[84],"and":[85,102,122],"recursive":[86],"was":[91],"studied":[92],"binary":[94,114],"shows":[98],"structure":[101],"properties":[103],"codes":[106,115],"helped":[108],"realizing":[109],"generalized":[118],"nonbinary":[120],"cases,":[121],"reports":[123],"implementation":[125],"results":[126],"soft-decision":[129],"alogorithm":[132],"several":[134]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}