{"id":"https://openalex.org/W7079199875","doi":null,"title":"Code-Weight Sphere Decoding","display_name":"Code-Weight Sphere Decoding","publication_year":2025,"publication_date":"2025-08-27","ids":{"openalex":"https://openalex.org/W7079199875"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.19631","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.19631","pdf_url":"https://arxiv.org/pdf/2508.19631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.19631","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jo, Yubeen","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jo, Yubeen","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Choi, Geon","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Choi, Geon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Kim, Yongjune","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kim, Yongjune","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Lee, Namyoon","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lee, Namyoon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"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":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9785000085830688,"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.9785000085830688,"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.014299999922513962,"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/T11130","display_name":"Coding theory and cryptography","score":0.0031999999191612005,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/sphere-decoding","display_name":"sphere decoding","score":0.765999972820282},{"id":"https://openalex.org/keywords/near-maximum-likelihood-decoding","display_name":"near maximum likelihood decoding","score":0.8899999856948853},{"id":"https://openalex.org/keywords/two-stage-decoding","display_name":"two-stage decoding","score":0.9290000200271606},{"id":"https://openalex.org/keywords/linear-codes","display_name":"linear codes","score":0.7689999938011169},{"id":"https://openalex.org/keywords/ultra-reliable-and-low-latency-communications","display_name":"ultra-reliable low-latency communication","score":0.8579999804496765},{"id":"https://openalex.org/keywords/finite-blocklength-regime","display_name":"finite blocklength regime","score":0.8799999952316284},{"id":"https://openalex.org/keywords/low-complexity-decoding","display_name":"low-complexity decoding","score":0.8080000281333923},{"id":"https://openalex.org/keywords/cyclic-redundancy-check","display_name":"cyclic redundancy check","score":0.8289999961853027},{"id":"https://openalex.org/keywords/low-rate-codes","display_name":"low-rate codes","score":0.7799999713897705}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.8876000046730042},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.6992999911308289},{"id":"https://openalex.org/C152124472","wikidata":"https://www.wikidata.org/wiki/Q1204361","display_name":"Redundancy (engineering)","level":2,"score":0.6836000084877014},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6776000261306763},{"id":"https://openalex.org/C193969084","wikidata":"https://www.wikidata.org/wiki/Q7452500","display_name":"Sequential decoding","level":4,"score":0.5548999905586243},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.5453000068664551},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.5292999744415283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5206999778747559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40400001406669617},{"id":"https://openalex.org/C43214815","wikidata":"https://www.wikidata.org/wiki/Q7310987","display_name":"Reliability (semiconductor)","level":3,"score":0.3959999978542328},{"id":"https://openalex.org/C137627569","wikidata":"https://www.wikidata.org/wiki/Q245471","display_name":"Cyclic redundancy check","level":3,"score":0.3831999897956848},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.376800000667572},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.375},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.3181000053882599},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.31709998846054077},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.30970001220703125},{"id":"https://openalex.org/C2776639698","wikidata":"https://www.wikidata.org/wiki/Q4927140","display_name":"Block Error Rate","level":3,"score":0.30820000171661377},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3061000108718872},{"id":"https://openalex.org/C103088060","wikidata":"https://www.wikidata.org/wiki/Q1062839","display_name":"Error detection and correction","level":2,"score":0.3043999969959259},{"id":"https://openalex.org/C185588885","wikidata":"https://www.wikidata.org/wiki/Q7553811","display_name":"Soft-decision decoder","level":3,"score":0.29269999265670776},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C201729545","wikidata":"https://www.wikidata.org/wiki/Q2193887","display_name":"Reliability theory","level":3,"score":0.2574999928474426}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:arXiv.org:2508.19631","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.19631","pdf_url":"https://arxiv.org/pdf/2508.19631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.19631","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.19631","pdf_url":"https://arxiv.org/pdf/2508.19631","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Ultra-reliable":[0],"low-latency":[1],"communications":[2],"(URLLC)":[3],"demand":[4],"high-performance":[5],"error-correcting":[6],"codes":[7],"and":[8,110],"decoders":[9],"in":[10],"the":[11,54,63],"finite":[12],"blocklength":[13],"regime.":[14],"This":[15,78],"letter":[16],"introduces":[17],"a":[18,36,45,51,68,115],"novel":[19],"two-stage":[20,101],"near-maximum":[21],"likelihood":[22],"(near-ML)":[23],"decoding":[24,58,108],"framework":[25],"applicable":[26],"to":[27],"any":[28],"linear":[29],"block":[30],"code.":[31],"Our":[32],"approach":[33],"first":[34],"employs":[35],"low-complexity":[37],"initial":[38,42],"decoder.":[39],"If":[40],"this":[41],"stage":[43],"fails":[44],"cyclic":[46],"redundancy":[47],"check,":[48],"it":[49,113],"triggers":[50],"second":[52],"stage:":[53],"proposed":[55],"code-weight":[56],"sphere":[57,70],"(WSD).":[59],"WSD":[60],"iteratively":[61],"refines":[62],"codeword":[64],"estimate":[65],"by":[66],"exploring":[67],"localized":[69],"of":[71],"candidates":[72],"constructed":[73],"from":[74],"pre-computed":[75],"low-weight":[76],"codewords.":[77],"strategy":[79],"adaptively":[80],"minimizes":[81],"computational":[82],"overhead":[83],"at":[84],"high":[85],"signal-to-noise":[86],"ratios":[87],"while":[88],"achieving":[89],"near-ML":[90],"performance,":[91],"especially":[92],"for":[93,118],"low-rate":[94],"codes.":[95],"Extensive":[96],"simulations":[97],"demonstrate":[98],"that":[99],"our":[100],"decoder":[102],"provides":[103],"an":[104],"excellent":[105],"trade-off":[106],"between":[107],"reliability":[109],"complexity,":[111],"establishing":[112],"as":[114],"promising":[116],"solution":[117],"next-generation":[119],"URLLC":[120],"systems.":[121]},"counts_by_year":[],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}