{"id":"https://openalex.org/W4413156789","doi":"https://doi.org/10.1109/lcomm.2025.3598249","title":"Structured Superposition of Autoencoders for UEP Codes at Intermediate Blocklengths","display_name":"Structured Superposition of Autoencoders for UEP Codes at Intermediate Blocklengths","publication_year":2025,"publication_date":"2025-08-13","ids":{"openalex":"https://openalex.org/W4413156789","doi":"https://doi.org/10.1109/lcomm.2025.3598249"},"language":"en","primary_location":{"id":"doi:10.1109/lcomm.2025.3598249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2025.3598249","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-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/A5013094215","display_name":"Vukan Ninkovi\u0107","orcid":"https://orcid.org/0000-0002-3187-1314"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":true,"raw_author_name":"Vukan Ninkovic","raw_affiliation_strings":["University of Novi Sad, Novi Sad, Serbia","University of Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035227760","display_name":"Dejan Vukobratovi\u0107","orcid":"https://orcid.org/0000-0002-5305-8420"},"institutions":[{"id":"https://openalex.org/I170726198","display_name":"University of Novi Sad","ror":"https://ror.org/00xa57a59","country_code":"RS","type":"education","lineage":["https://openalex.org/I170726198"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Dejan Vukobratovic","raw_affiliation_strings":["University of Novi Sad, Novi Sad, Serbia","University of Novi Sad, Serbia"],"affiliations":[{"raw_affiliation_string":"University of Novi Sad, Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]},{"raw_affiliation_string":"University of Novi Sad, Serbia","institution_ids":["https://openalex.org/I170726198"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013094215"],"corresponding_institution_ids":["https://openalex.org/I170726198"],"apc_list":null,"apc_paid":null,"fwci":1.319,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.84284548,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"29","issue":"10","first_page":"2406","last_page":"2410"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10901","display_name":"Advanced Data Compression Techniques","score":0.9580000042915344,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T10901","display_name":"Advanced Data Compression Techniques","score":0.9580000042915344,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.9028000235557556,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6660239100456238},{"id":"https://openalex.org/keywords/superposition-principle","display_name":"Superposition principle","score":0.49046656489372253},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.46722280979156494},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4612082540988922},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.39584556221961975},{"id":"https://openalex.org/keywords/speech-recognition","display_name":"Speech recognition","score":0.3507036566734314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2701249122619629}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6660239100456238},{"id":"https://openalex.org/C27753989","wikidata":"https://www.wikidata.org/wiki/Q284885","display_name":"Superposition principle","level":2,"score":0.49046656489372253},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.46722280979156494},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4612082540988922},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.39584556221961975},{"id":"https://openalex.org/C28490314","wikidata":"https://www.wikidata.org/wiki/Q189436","display_name":"Speech recognition","level":1,"score":0.3507036566734314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2701249122619629},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/lcomm.2025.3598249","is_oa":false,"landing_page_url":"https://doi.org/10.1109/lcomm.2025.3598249","pdf_url":null,"source":{"id":"https://openalex.org/S147316732","display_name":"IEEE Communications Letters","issn_l":"1089-7798","issn":["1089-7798","1558-2558","2373-7891"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310316002","host_organization_name":"IEEE Communications Society","host_organization_lineage":["https://openalex.org/P4310316002","https://openalex.org/P4310319808"],"host_organization_lineage_names":["IEEE Communications Society","Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Communications Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2109361284","https://openalex.org/W2156452863","https://openalex.org/W2163446469","https://openalex.org/W2734408173","https://openalex.org/W3009595358","https://openalex.org/W3188610135","https://openalex.org/W3196367249","https://openalex.org/W4226213961","https://openalex.org/W4286579122","https://openalex.org/W4296558671","https://openalex.org/W4379382572","https://openalex.org/W4388405511","https://openalex.org/W4391341772","https://openalex.org/W4402156693","https://openalex.org/W4402159291","https://openalex.org/W4405908881"],"related_works":["https://openalex.org/W4308749380","https://openalex.org/W2037841693","https://openalex.org/W2372481764","https://openalex.org/W1977264433","https://openalex.org/W2746368218","https://openalex.org/W4308448008","https://openalex.org/W2347371661","https://openalex.org/W2012943989","https://openalex.org/W3005471417","https://openalex.org/W2051487156"],"abstract_inverted_index":{"Unequal":[0],"error":[1,33],"protection":[2,34],"(UEP)":[3],"coding":[4,36,65],"that":[5,82,124],"enables":[6],"differentiated":[7],"reliability":[8,113],"levels":[9,114],"within":[10],"a":[11,78,107,149],"transmitted":[12],"message":[13],"is":[14],"essential":[15],"for":[16,110,154],"modern":[17],"communication":[18],"systems.":[19],"Autoencoder":[20],"(AE)-based":[21],"code":[22],"designs":[23],"have":[24],"shown":[25],"promise":[26],"in":[27,72],"the":[28,52,60,125,143],"context":[29],"of":[30,55,63,133],"learned":[31],"equal":[32],"(EEP)":[35],"schemes.":[37],"However,":[38],"their":[39],"application":[40],"to":[41,51,87,117],"UEP":[42,74,85,112,137,147],"remains":[43],"largely":[44],"unexplored,":[45],"particularly":[46],"at":[47],"intermediate":[48],"blocklengths,":[49],"due":[50],"increasing":[53],"complexity":[54],"AE-based":[56,80,84,146],"models.":[57],"Inspired":[58],"by":[59],"proven":[61],"effectiveness":[62],"superposition":[64,135],"and":[66,98,151],"successive":[67],"interference":[68],"cancellation":[69],"(SIC)":[70],"decoding":[71,99],"conventional":[73],"schemes,":[75],"we":[76],"propose":[77],"structured":[79,145],"architecture":[81],"extends":[83],"codes":[86,148],"substantially":[88],"larger":[89],"blocklengths":[90],"while":[91,115],"maintaining":[92],"efficient":[93,152],"training.":[94],"By":[95],"structuring":[96],"encoding":[97],"into":[100],"smaller":[101],"AE":[102],"subblocks,":[103],"our":[104],"method":[105],"provides":[106],"flexible":[108],"framework":[109],"fine-tuning":[111],"adapting":[116],"diverse":[118],"system":[119],"parameters.":[120],"Numerical":[121],"results":[122],"show":[123],"proposed":[126,144],"approach":[127],"improves":[128],"over":[129],"established":[130],"achievability":[131],"bounds":[132],"randomized":[134],"coding-based":[136],"schemes":[138],"with":[139],"SIC":[140],"decoding,":[141],"making":[142],"scalable":[150],"solution":[153],"next-generation":[155],"networks.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2025-12-19T19:40:27.379048","created_date":"2025-10-10T00:00:00"}