{"id":"https://openalex.org/W2558387611","doi":"https://doi.org/10.1109/wcsp.2016.7752500","title":"On the greedy coded caching scheme","display_name":"On the greedy coded caching scheme","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2558387611","doi":"https://doi.org/10.1109/wcsp.2016.7752500","mag":"2558387611"},"language":"en","primary_location":{"id":"doi:10.1109/wcsp.2016.7752500","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcsp.2016.7752500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","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/A5035654256","display_name":"Qifa Yan","orcid":"https://orcid.org/0000-0002-0746-9819"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qifa Yan","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029840191","display_name":"Xiaohu Tang","orcid":"https://orcid.org/0000-0002-7938-7812"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xiaohu Tang","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059322901","display_name":"Qingchun Chen","orcid":"https://orcid.org/0000-0002-9454-4919"},"institutions":[{"id":"https://openalex.org/I4800084","display_name":"Southwest Jiaotong University","ror":"https://ror.org/00hn7w693","country_code":"CN","type":"education","lineage":["https://openalex.org/I4800084"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qingchun Chen","raw_affiliation_strings":["School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Information Science and Technology, Southwest Jiaotong University, Chengdu, China","institution_ids":["https://openalex.org/I4800084"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4800084"],"apc_list":null,"apc_paid":null,"fwci":0.2525,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44118377,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T11478","display_name":"Caching and Content Delivery","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9965000152587891,"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/T10742","display_name":"Peer-to-Peer Network Technologies","score":0.9735000133514404,"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.8265808820724487},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.7940170764923096},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.7171595096588135},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.7031351327896118},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6226206421852112},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6074921488761902},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.5583500266075134},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5408464074134827},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42777347564697266},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.38067758083343506},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3576306104660034},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32770276069641113},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11842989921569824}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8265808820724487},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.7940170764923096},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.7171595096588135},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.7031351327896118},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6226206421852112},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6074921488761902},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.5583500266075134},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5408464074134827},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42777347564697266},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.38067758083343506},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3576306104660034},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32770276069641113},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11842989921569824},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"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/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/wcsp.2016.7752500","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcsp.2016.7752500","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 8th International Conference on Wireless Communications & Signal Processing (WCSP)","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":9,"referenced_works":["https://openalex.org/W2038228267","https://openalex.org/W2064829135","https://openalex.org/W2106248279","https://openalex.org/W2399048200","https://openalex.org/W2401802887","https://openalex.org/W2579320238","https://openalex.org/W2962695498","https://openalex.org/W3098870865","https://openalex.org/W6713415052"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W17155033"],"abstract_inverted_index":{"Coded":[0],"caching":[1,26],"is":[2,15,68,98,105],"a":[3,34,44,64,110],"technique":[4],"that":[5],"receives":[6],"much":[7],"attention":[8],"in":[9,59],"the":[10,23,48,52,57,61,83,87,91,95,102],"network":[11],"literature,":[12],"since":[13],"it":[14],"able":[16,107],"to":[17,22,70,82,108,117],"achieve":[18,109],"significant":[19],"gains":[20],"compared":[21,81],"conventional":[24],"uncoded":[25],"schemes.":[27,40,54,85],"In":[28],"this":[29],"paper,":[30],"we":[31,42],"first":[32],"identify":[33],"family":[35],"of":[36],"placement":[37],"and":[38],"delivery":[39,66],"Then":[41],"derive":[43],"lower":[45,62],"bound":[46],"on":[47,56],"average":[49],"rate":[50],"for":[51],"identified":[53],"Based":[55],"clue":[58],"deriving":[60],"bound,":[63],"new":[65],"algorithm":[67],"proposed":[69,88,103],"pursue":[71],"full":[72],"multicast":[73],"adaptively,":[74],"which":[75],"can":[76],"exploit":[77],"more":[78],"cooperative":[79],"opportunities":[80],"known":[84],"Particularly,":[86],"scheme":[89,104],"has":[90],"advantage":[92],"that,":[93],"when":[94],"file":[96],"size":[97],"not":[99],"large":[100],"enough,":[101],"still":[106],"reasonable":[111],"coding":[112],"gain.":[113],"We":[114],"perform":[115],"simulations":[116],"validate":[118],"our":[119],"design.":[120]},"counts_by_year":[{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}