{"id":"https://openalex.org/W4401692424","doi":"https://doi.org/10.1109/isit57864.2024.10619679","title":"On ML Decoding of Binary Cyclic-gap Constant Weight Codes","display_name":"On ML Decoding of Binary Cyclic-gap Constant Weight Codes","publication_year":2024,"publication_date":"2024-07-07","ids":{"openalex":"https://openalex.org/W4401692424","doi":"https://doi.org/10.1109/isit57864.2024.10619679"},"language":"en","primary_location":{"id":"doi:10.1109/isit57864.2024.10619679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5040956008","display_name":"Birenjith Sasidharan","orcid":"https://orcid.org/0000-0001-7444-7161"},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Birenjith Sasidharan","raw_affiliation_strings":["Monash University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043667125","display_name":"Emanuele Viterbo","orcid":"https://orcid.org/0000-0002-5861-2873"},"institutions":[{"id":"https://openalex.org/I2801239119","display_name":"Australian Regenerative Medicine Institute","ror":"https://ror.org/02qa5kg76","country_code":"AU","type":"facility","lineage":["https://openalex.org/I2801037857","https://openalex.org/I2801239119","https://openalex.org/I56590836"]},{"id":"https://openalex.org/I56590836","display_name":"Monash University","ror":"https://ror.org/02bfwt286","country_code":"AU","type":"education","lineage":["https://openalex.org/I56590836"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Emanuele Viterbo","raw_affiliation_strings":["Monash University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Monash University","institution_ids":["https://openalex.org/I2801239119","https://openalex.org/I56590836"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031318960","display_name":"Son Hoang Dau","orcid":"https://orcid.org/0000-0002-2276-017X"},"institutions":[{"id":"https://openalex.org/I4210095297","display_name":"MIT University","ror":"https://ror.org/00v140q16","country_code":"MK","type":"education","lineage":["https://openalex.org/I4210095297"]},{"id":"https://openalex.org/I82951845","display_name":"RMIT University","ror":"https://ror.org/04ttjf776","country_code":"AU","type":"education","lineage":["https://openalex.org/I82951845"]}],"countries":["AU","MK"],"is_corresponding":false,"raw_author_name":"Son Hoang Dau","raw_affiliation_strings":["RMIT University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RMIT University","institution_ids":["https://openalex.org/I4210095297","https://openalex.org/I82951845"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2826","last_page":"2831"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.996399998664856,"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"}},"topics":[{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.996399998664856,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9955999851226807,"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.9851999878883362,"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/constant","display_name":"Constant (computer programming)","score":0.7327360510826111},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7218827605247498},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.6417796015739441},{"id":"https://openalex.org/keywords/list-decoding","display_name":"List decoding","score":0.502926766872406},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4450836181640625},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3423144817352295},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30672475695610046},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.18820345401763916},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.17546257376670837},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.17449691891670227},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06490981578826904}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7327360510826111},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7218827605247498},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.6417796015739441},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.502926766872406},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4450836181640625},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3423144817352295},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30672475695610046},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.18820345401763916},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.17546257376670837},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.17449691891670227},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06490981578826904}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit57864.2024.10619679","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit57864.2024.10619679","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.4099999964237213}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W608690979","https://openalex.org/W2007713111","https://openalex.org/W2034323860","https://openalex.org/W2096281171","https://openalex.org/W2103206811","https://openalex.org/W2140804432","https://openalex.org/W4231093917"],"related_works":["https://openalex.org/W3017203753","https://openalex.org/W3083229674","https://openalex.org/W4205451769","https://openalex.org/W2385322349","https://openalex.org/W2369600518","https://openalex.org/W3096151594","https://openalex.org/W2964031101","https://openalex.org/W4200209838","https://openalex.org/W2165241191","https://openalex.org/W2798867000"],"abstract_inverted_index":{"A":[0],"family":[1],"of":[2,80,91,104,121,143,150,164,170,175,178,195,203,210],"<tex":[3,16,55,107,134,151,179,216,222,238,268],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[4,17,56,108,135,152,180,217,223,239,269],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(n=2^{\\ell}.M=2^{k_{\\ell}}\\":[5],".":[6],"\\":[7],"d=2)$</tex>,":[8],"binary":[9,197],"constant-weight":[10,198],"codes":[11,47,52,59,93],"for":[12,64,77,125,133,214],"any":[13,196],"positive":[14],"integer":[15],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\ell":[18],"&gt;":[19],"3,":[20],"k_{\\ell}=":[21],"\\displaystyle":[22],"\\frac{\\ell(\\ell+1)}{9}-1$</tex>":[23],"was":[24],"recently":[25],"proposed":[26],"in":[27,34,185,247],"literature":[28],"[1].":[29],"As":[30],"infor-mation":[31],"is":[32,158,191,202,251],"encoded":[33],"the":[35,75,101,105,118,144,167,208,211,215,248],"gaps":[36],"(cyclically":[37],"counted)":[38],"between":[39,68],"successive":[40],"1":[41],"'s,":[42],"we":[43,86,128],"refer":[44],"to":[45,193,233,245,253],"these":[46,92],"as":[48],"cyclic-gap":[49],"constant":[50],"weight":[51],"denoted":[53],"by":[54,117,259],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C_{G}[\\ell$</tex>.":[57,136],"These":[58],"admit":[60],"very":[61],"low-complexity":[62,141,212],"algorithms":[63],"mapping":[65],"and":[66,70,200,226],"demapping":[67],"message":[69],"codeword":[71],"vectors,":[72],"fully":[73],"eliminating":[74],"need":[76],"costly":[78],"computations":[79],"binomial":[81],"coefficients.":[82],"In":[83],"this":[84],"paper,":[85],"study":[87],"maximum-likelihood":[88],"(ML)":[89],"decoding":[90,194],"under":[94,275],"additive":[95],"white":[96],"Gaussian":[97],"noise":[98],"channels.":[99],"Since":[100],"minimum":[102],"distance":[103],"code":[106,199,221,274],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$d=2$</tex>,":[109],"hard-decision":[110],"decoders":[111],"can":[112],"not":[113],"correct":[114],"errors.":[115],"Motivated":[116],"error-correcting":[119],"capability":[120],"soft-decision":[122],"Wagner-rule":[123],"decoder":[124,132,146,213],"single-parity-check":[126],"codes,":[127],"derive":[129,139],"an":[130],"ML":[131,145,234,276],"We":[137,206,256],"also":[138,257],"a":[140,148,161,171,186,236,266],"approximation":[142],"with":[147],"time-complexity":[149],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(n\\log":[153],"n^{\\backslash":[154],"},$</tex>.":[155],"The":[156],"algorithm":[157],"based":[159],"on":[160],"novel":[162],"technique":[163],"traversal":[165],"through":[166],"Hasse":[168,249],"diagram":[169],"partially":[172],"ordered":[173],"set":[174],"all":[176],"\u2113-subsets":[177],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\{1,":[181],"2,":[182],"\\ldots,":[183],"n\\}$</tex>":[184],"breadth-first":[187],"manner.":[188],"Our":[189],"approach":[190],"applicable":[192],"therefore":[201],"general":[204],"interest.":[205],"simulate":[207],"performance":[209],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$(8,":[218],"32,":[219],"2)$</tex>":[220],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$C_{G}$</tex>":[224],"[3]":[225],"show":[227,258],"that":[228,261],"it":[229,262],"performs":[230,263],"almost":[231],"similar":[232],"when":[235],"parameter":[237],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\lambda_{\\mathrm{m}\\mathrm{m}}$</tex>":[240],"(that":[241],"determines":[242],"how":[243],"far":[244],"traverse":[246],"diagram)":[250],"taken":[252],"be":[254],"3.":[255],"simulation":[260],"better":[264],"than":[265],"comparable":[267],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$[8,":[270],"5,":[271],"2]$</tex>":[272],"linear":[273],"decoding.":[277]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}