{"id":"https://openalex.org/W3080849835","doi":"https://doi.org/10.1109/isit44484.2020.9174057","title":"Improved Achievable Regions in Networked Scalable Coding Problems","display_name":"Improved Achievable Regions in Networked Scalable Coding Problems","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3080849835","doi":"https://doi.org/10.1109/isit44484.2020.9174057","mag":"3080849835"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/A5012879525","display_name":"Emrah Akyol","orcid":"https://orcid.org/0000-0002-0663-1677"},"institutions":[{"id":"https://openalex.org/I123946342","display_name":"Binghamton University","ror":"https://ror.org/008rmbt77","country_code":"US","type":"education","lineage":["https://openalex.org/I123946342"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Emrah Akyol","raw_affiliation_strings":["Binghamton-SUNY,Electrical & Computer Eng.,US","Electrical & Computer Eng., Binghamton-SUNY, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Binghamton-SUNY,Electrical & Computer Eng.,US","institution_ids":["https://openalex.org/I123946342"]},{"raw_affiliation_string":"Electrical & Computer Eng., Binghamton-SUNY, US","institution_ids":["https://openalex.org/I123946342"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072739163","display_name":"Urbashi Mitra","orcid":"https://orcid.org/0000-0002-8896-1177"},"institutions":[{"id":"https://openalex.org/I1342924430","display_name":"LAC+USC Medical Center","ror":"https://ror.org/04xzj3x20","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I1328359107","https://openalex.org/I1342924430"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Urbashi Mitra","raw_affiliation_strings":["USC,Electrical Eng.,CA,US","Electrical Eng., USC, CA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USC,Electrical Eng.,CA,US","institution_ids":["https://openalex.org/I1342924430"]},{"raw_affiliation_string":"Electrical Eng., USC, CA, US","institution_ids":["https://openalex.org/I1342924430"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076381426","display_name":"Ertem Tuncel","orcid":"https://orcid.org/0000-0001-9002-7562"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ertem Tuncel","raw_affiliation_strings":["UC,Electrical Eng.,Riverside,CA,US","Electrical Eng., UC, Riverside, CA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC,Electrical Eng.,Riverside,CA,US","institution_ids":["https://openalex.org/I103635307"]},{"raw_affiliation_string":"Electrical Eng., UC, Riverside, CA, US","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5026459097","display_name":"Kenneth Rose","orcid":"https://orcid.org/0000-0001-9463-2647"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kenneth Rose","raw_affiliation_strings":["UC,Electrical & Computer Eng.,Santa Barbara,CA,US","Electrical & Computer Eng., UC, Santa Barbara, CA, US"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"UC,Electrical & Computer Eng.,Santa Barbara,CA,US","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"Electrical & Computer Eng., UC, Santa Barbara, CA, US","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"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.0984551,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2410","last_page":"2415"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9994000196456909,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9975000023841858,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9952999949455261,"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/scalability","display_name":"Scalability","score":0.7035468816757202},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6113289594650269},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.6000878810882568},{"id":"https://openalex.org/keywords/codebook","display_name":"Codebook","score":0.575629711151123},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5188875794410706},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4564083516597748},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.43644821643829346},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36398637294769287},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2280454933643341},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.21822309494018555},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.10366961359977722},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.09938740730285645}],"concepts":[{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7035468816757202},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6113289594650269},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.6000878810882568},{"id":"https://openalex.org/C127759330","wikidata":"https://www.wikidata.org/wiki/Q637416","display_name":"Codebook","level":2,"score":0.575629711151123},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5188875794410706},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4564083516597748},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.43644821643829346},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36398637294769287},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2280454933643341},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.21822309494018555},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.10366961359977722},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.09938740730285645}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit44484.2020.9174057","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174057","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1494099594","https://openalex.org/W1990531224","https://openalex.org/W2020135934","https://openalex.org/W2050743149","https://openalex.org/W2098660798","https://openalex.org/W2123095296","https://openalex.org/W2147738283","https://openalex.org/W2150412388","https://openalex.org/W2158643165","https://openalex.org/W2163531964","https://openalex.org/W2167160216","https://openalex.org/W2194757816","https://openalex.org/W2565824138","https://openalex.org/W2616093649","https://openalex.org/W2963738286","https://openalex.org/W4300840296"],"related_works":["https://openalex.org/W2293149949","https://openalex.org/W2026099691","https://openalex.org/W4284672201","https://openalex.org/W2377486419","https://openalex.org/W2943202426","https://openalex.org/W2163679795","https://openalex.org/W2736714427","https://openalex.org/W2137816434","https://openalex.org/W2017956276","https://openalex.org/W2048606991"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,27,82],"present":[4,83],"new":[5],"results":[6],"on":[7,18],"the":[8,29,35,43,47,51,59,70,91,108,133,162,169],"achievable":[9,170],"rate-distortion":[10,99,145],"regions":[11],"in":[12,34,69,135,149],"networked":[13],"scalable":[14,32],"compression":[15],"problems,":[16],"based":[17],"a":[19,66,96,121,136,143,155],"flexible":[20],"codebook":[21],"generation":[22],"and":[23,58,161],"binning":[24],"method.":[25],"First,":[26,81],"consider":[28,107],"problem":[30,109],"of":[31,37,72,110,172],"coding":[33,93,164],"presence":[36],"decoder":[38],"side":[39,53,60,87],"information,":[40],"for":[41,154],"which":[42],"prior":[44,103,144,173],"work":[45],"analyzed":[46],"two":[48],"important":[49],"cases":[50],"degraded":[52],"information":[54,61,88],"where":[55,90,114],"source":[56,134,157],"X":[57,74,77],"variables":[62],"(Y1,":[63],"Y2)":[64],"form":[65],"Markov":[67],"chain":[68],"order":[71],"either":[73],"-":[75,78],"Y1-Y2or":[76],"Y2-":[79],"Y1.":[80],"an":[84],"example":[85],"non-Markov":[86],"scenario":[89],"proposed":[92,163],"strategy":[94],"achieves":[95,166],"strictly":[97],"larger":[98],"region":[100,146,171],"compared":[101],"to":[102,120,131],"work.":[104,174],"We":[105],"then":[106],"multi-user":[111],"successive":[112],"refinement":[113],"different":[115,127],"users":[116],"that":[117,142],"are":[118],"connected":[119],"central":[122],"server":[123],"via":[124],"links":[125],"with":[126,158],"noiseless":[128],"capacities":[129],"strive":[130],"reconstruct":[132],"progressive":[137],"fashion.":[138],"It":[139],"is":[140,147],"shown":[141],"suboptimal":[148],"general,":[150],"albeit":[151],"its":[152],"optimality":[153],"Gaussian":[156],"MSE":[159],"distortion,":[160],"scheme":[165],"points":[167],"beyond":[168]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}