{"id":"https://openalex.org/W2579966852","doi":"https://doi.org/10.1109/isit.2017.8007093","title":"Uniprior index coding","display_name":"Uniprior index coding","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2579966852","doi":"https://doi.org/10.1109/isit.2017.8007093","mag":"2579966852"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8007093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","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/A5078268777","display_name":"Vijaya Kumar Mareedu","orcid":null},"institutions":[{"id":"https://openalex.org/I4210121626","display_name":"Signal Processing (United States)","ror":"https://ror.org/021gzyw51","country_code":"US","type":"company","lineage":["https://openalex.org/I4210121626"]},{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]}],"countries":["IN","US"],"is_corresponding":true,"raw_author_name":"Vijaya Kumar Mareedu","raw_affiliation_strings":["Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad"],"affiliations":[{"raw_affiliation_string":"Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad","institution_ids":["https://openalex.org/I64189192","https://openalex.org/I4210121626"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001685956","display_name":"Prasad Krishnan","orcid":"https://orcid.org/0000-0001-9182-6278"},"institutions":[{"id":"https://openalex.org/I64189192","display_name":"International Institute of Information Technology, Hyderabad","ror":"https://ror.org/05f11g639","country_code":"IN","type":"education","lineage":["https://openalex.org/I64189192"]},{"id":"https://openalex.org/I4210121626","display_name":"Signal Processing (United States)","ror":"https://ror.org/021gzyw51","country_code":"US","type":"company","lineage":["https://openalex.org/I4210121626"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Prasad Krishnan","raw_affiliation_strings":["Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad"],"affiliations":[{"raw_affiliation_string":"Signal Processing and Communications Research Centre, International Institute of Information Technology, Hyderabad","institution_ids":["https://openalex.org/I64189192","https://openalex.org/I4210121626"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078268777"],"corresponding_institution_ids":["https://openalex.org/I4210121626","https://openalex.org/I64189192"],"apc_list":null,"apc_paid":null,"fwci":0.6189,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.70034382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9624000191688538,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9010000228881836,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.724051296710968},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5880352854728699},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.5698395371437073},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5246092081069946},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.48781517148017883},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.487150639295578},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4100642204284668},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4098323881626129},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3659340739250183},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.14545229077339172}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.724051296710968},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5880352854728699},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.5698395371437073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5246092081069946},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.48781517148017883},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.487150639295578},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4100642204284668},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4098323881626129},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659340739250183},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.14545229077339172},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2017.8007093","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8007093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1512160561","https://openalex.org/W1992260716","https://openalex.org/W2059613941","https://openalex.org/W2060363698","https://openalex.org/W2094004458","https://openalex.org/W2105406958","https://openalex.org/W2111851330","https://openalex.org/W2116471929","https://openalex.org/W2130507035","https://openalex.org/W2401610261","https://openalex.org/W2579966852","https://openalex.org/W2963123511","https://openalex.org/W3106198739","https://openalex.org/W3141776272"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W2123072960","https://openalex.org/W2148686647","https://openalex.org/W2213686625","https://openalex.org/W1579872668","https://openalex.org/W2668751350","https://openalex.org/W1988025666","https://openalex.org/W3083947873","https://openalex.org/W2116220982","https://openalex.org/W2365030987"],"abstract_inverted_index":{"The":[0],"index":[1,14,30,49,63],"coding":[2,64],"problem":[3,6,65],"is":[4,51],"a":[5,37,42,67,72,117,135,168],"of":[7,18,46,74,89,137,144,171],"efficient":[8],"broadcasting":[9],"with":[10,119,160],"side-information.":[11],"In":[12,56],"uniprior":[13,29,62,75,138,150,158,162,175],"coding,":[15,31],"the":[16,61,87,90,94,112,127,142,146,172,183,193],"sets":[17],"side-information":[19,40,95],"symbols":[20],"possessed":[21],"by":[22],"different":[23],"receivers":[24],"are":[25,97,132],"disjoint.":[26],"For":[27,102],"single":[28,38,161],"in":[32,85],"which":[33,86,178,191],"each":[34,100],"receiver":[35],"has":[36],"unique":[39],"symbol,":[41],"polynomial":[43],"complexity":[44],"construction":[45],"an":[47,188],"optimal":[48,113,184],"code":[50],"known":[52,81],"from":[53],"prior":[54],"work.":[55],"this":[57],"work,":[58],"we":[59,105,123,165,179],"model":[60],"as":[66,82],"supergraph,":[68],"and":[69,93,108,129,186],"focus":[70],"on":[71,78,111,152,182],"class":[73,176],"problems":[76,151,159],"defined":[77],"special":[79],"supergraphs":[80],"generalized":[83,153,173],"cycles":[84],"sizes":[88],"demand":[91],"set":[92,96],"equal":[98,133],"at":[99,167],"receiver.":[101],"such":[103,157],"problems,":[104],"prove":[106],"upper":[107,128,194],"lower":[109,130,147],"bounds":[110,131,181],"broadcast":[114],"rate.":[115],"Using":[116],"connection":[118],"Eulerian":[120],"directed":[121],"graphs,":[122],"also":[124],"show":[125,141,187],"that":[126],"for":[134,149,177],"subclass":[136],"problems.":[139,163],"We":[140],"NP-hardness":[143],"finding":[145],"bound":[148],"cycles,":[154],"hence":[155],"contrasting":[156],"Finally,":[164],"look":[166],"simple":[169],"extension":[170],"cycle":[174],"give":[180],"rate":[185],"explicit":[189],"scheme":[190],"achieves":[192],"bound.":[195]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}