An Index Coding Approach to Caching With Uncoded Cache Placement

Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strate...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on information theory Jg. 66; H. 3; S. 1318 - 1332
Hauptverfasser:	Wan, Kai, Tuninetti, Daniela, Piantanida, Pablo
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.03.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Schlagworte:	Cache memory Caching Coded caching Coding Constraint modelling distributed source coding Encoding Engineering Sciences index coding Indexes Integrated circuit modeling Load modeling Peak hour traffic Placement Traffic congestion uncoded cache placement
ISSN:	0018-9448, 1557-9654
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Abstract	Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users' demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the "acyclic index coding converse bound." This converse bound is proved to be achievable by the Maddah-Ali and Niesen's scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used "composite (index) coding" achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper.
AbstractList	Caching is an efficient way to reduce network trafficcongestion during peak hours, by storing some content at theuser’s local cache memory, even without knowledge of user’slater demands. Maddah-Ali and Niesen proposed a two-phase(placement phase and delivery phase) coded caching strategyfor broadcast channels with cache-aided users. This paper in-vestigates the same model under the constraint that content isplaced uncoded within the caches, that is, when bits of the filesare simply copied within the caches. When the cache contentsare uncoded and the users’ demands are revealed, the cachingproblem can be connected to an index coding problem. Thispaper focuses on deriving fundamental performance limits forthe caching problem by using tools for the index coding problemthat were either known or are newly developed in this work.First, a converse bound for the caching problem under theconstraint of uncoded cache placement is proposed based onthe “acyclic index coding converse bound.” This converse boundis proved to be achievable by the Maddah-Ali and Niesen’sscheme when the number of files is not less than the numberof users, and by a newly derived index coding achievable schemeotherwise. The proposed index coding achievable scheme isbased on distributed source coding and strictly improves on thewidely used “composite (index) coding” achievable bound and itsimprovements, and is of independent interest.An important consequence of the findings of this paper is thatadvancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategieswith coded placement phase. A recent work by Yuet alhashowever shown that coded cache placement can at most half thenetwork load compared to the results presented in this paper. Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without knowledge of user's later demands. Maddah-Ali and Niesen proposed a two-phase (placement phase and delivery phase) coded caching strategy for broadcast channels with cache-aided users. This paper investigates the same model under the constraint that content is placed uncoded within the caches, that is, when bits of the files are simply copied within the caches. When the cache contents are uncoded and the users' demands are revealed, the caching problem can be connected to an index coding problem. This paper focuses on deriving fundamental performance limits for the caching problem by using tools for the index coding problem that were either known or are newly developed in this work. First, a converse bound for the caching problem under the constraint of uncoded cache placement is proposed based on the "acyclic index coding converse bound." This converse bound is proved to be achievable by the Maddah-Ali and Niesen's scheme when the number of files is not less than the number of users, and by a newly derived index coding achievable scheme otherwise. The proposed index coding achievable scheme is based on distributed source coding and strictly improves on the widely used "composite (index) coding" achievable bound and its improvements, and is of independent interest. An important consequence of the findings of this paper is that advancements on the coded caching problem posed by Maddah-Ali and Niesen are thus only possible by considering strategies with coded placement phase. A recent work by Yu et al has however shown that coded cache placement can at most half the network load compared to the results presented in this paper.
Author	Wan, Kai Piantanida, Pablo Tuninetti, Daniela
Author_xml	– sequence: 1 givenname: Kai orcidid: 0000-0003-4671-3287 surname: Wan fullname: Wan, Kai email: kai.wan@tu-berlin.de organization: Laboratoire de Signaux et Systémes (L2S), French National Center for Scientific Research (CNRS), CentraleSupèlec, Université Paris-Sud, 91192, France – sequence: 2 givenname: Daniela orcidid: 0000-0003-1880-4798 surname: Tuninetti fullname: Tuninetti, Daniela email: danielat@uic.edu organization: Electrical and Computer Engineering Department, The University of Illinois at Chicago, Chicago, IL, USA – sequence: 3 givenname: Pablo orcidid: 0000-0002-8717-2117 surname: Piantanida fullname: Piantanida, Pablo email: pablo.piantanida@centralesupelec.fr organization: French National Center for Scientific Research (CNRS), CentraleSupélec, Université Paris-Sud, Gif-sur-Yvette, France
BackLink	https://centralesupelec.hal.science/hal-02951659$$DView record in HAL
BookMark	eNp9kM1Lw0AQxRepYFu9C14Cnjyk7neyN0tQWyjoocXjst2d2JR0tyap6H9vYqoHD54e8_i9YeaN0MAHDwhdEjwhBKvb5Xw5oZjiCVUySQQ7QUMiRBIrKfgADTEmaaw4T8_QqK637cgFoUN0N_XR3Dv4iLLgCv8aTff7Khi7iZoQZa123kvRbKKVt8GB-zYhei6NhR345hyd5qas4eKoY7R6uF9ms3jx9DjPpovYMpk0MXE2NYkBmbBcSFhLLnjO8NrkxuVOyFQxY9ma5Y4rAIEZIw4U4QrLFByVbIxu-r0bU-p9VexM9amDKfRsutCdh6kSRAr1Tlr2umfbV94OUDd6Gw6Vb8_TlIlUkXZvR8meslWo6wpybYvGNEXwTWWKUhOsu2Z126zumtXHZtsg_hP8ueefyFUfKQDgF0-VZJIq9gWUEoM3
CODEN	IETTAW
CitedBy_id	crossref_primary_10_1109_TIT_2021_3127910 crossref_primary_10_1109_TCOMM_2024_3522040 crossref_primary_10_1109_TCOMM_2022_3174890 crossref_primary_10_1016_j_jnca_2024_104027 crossref_primary_10_1109_TIT_2022_3193723 crossref_primary_10_1109_TVT_2021_3052971 crossref_primary_10_1109_TWC_2022_3143888 crossref_primary_10_1109_TCOMM_2023_3256417 crossref_primary_10_1109_JSAC_2022_3142360 crossref_primary_10_1109_TCOMM_2022_3158326 crossref_primary_10_1109_TIT_2022_3195345 crossref_primary_10_1109_TIT_2021_3095471 crossref_primary_10_1109_TIT_2023_3320252 crossref_primary_10_1109_TIT_2023_3291216 crossref_primary_10_1109_TIT_2020_3049074 crossref_primary_10_1109_TIT_2024_3455557 crossref_primary_10_3390_info13040191 crossref_primary_10_1109_TIT_2021_3139013 crossref_primary_10_1109_TIT_2025_3567008 crossref_primary_10_1109_TCOMM_2021_3087788 crossref_primary_10_1109_TIT_2020_3015348 crossref_primary_10_1109_TIT_2023_3262935 crossref_primary_10_3390_e23010025 crossref_primary_10_1109_TIT_2023_3321918 crossref_primary_10_1109_TCOMM_2024_3379352 crossref_primary_10_1109_TWC_2021_3062264 crossref_primary_10_1109_TCOMM_2023_3280554 crossref_primary_10_1109_TCOMM_2021_3091612 crossref_primary_10_3390_e26030195 crossref_primary_10_1109_TNET_2023_3270567 crossref_primary_10_1109_TIT_2020_3036313 crossref_primary_10_1109_TIT_2022_3164055 crossref_primary_10_1109_TCOMM_2024_3416888 crossref_primary_10_1109_TCOMM_2024_3351367 crossref_primary_10_1109_TIT_2024_3352020 crossref_primary_10_1109_TCOMM_2021_3067911 crossref_primary_10_1109_ACCESS_2020_3040958 crossref_primary_10_1109_TIFS_2021_3127018 crossref_primary_10_1109_TIT_2021_3054518 crossref_primary_10_1109_TNET_2023_3284347 crossref_primary_10_1109_TIT_2024_3355234 crossref_primary_10_1109_TIT_2022_3157835 crossref_primary_10_1016_j_sysarc_2022_102556 crossref_primary_10_1109_TIT_2021_3127905 crossref_primary_10_1109_TIT_2021_3112492 crossref_primary_10_1109_TIT_2022_3173581 crossref_primary_10_1109_LCOMM_2025_3576278 crossref_primary_10_1109_TNET_2022_3219161 crossref_primary_10_3390_e27030316 crossref_primary_10_1109_TCOMM_2021_3104035 crossref_primary_10_1109_TCOMM_2023_3299971 crossref_primary_10_1109_TIT_2023_3332597
Cites_doi	10.1109/TIT.1973.1055037 10.1109/TNET.2014.2317316 10.1049/iet-com.2015.1205 10.1109/FOCS.2011.39 10.1109/ISIT.2015.7282744 10.1109/ISIT.2017.8007091 10.1561/0100000094 10.1109/INFCOM.1998.662940 10.1109/ITW.2016.7606818 10.1109/TIT.2017.2695611 10.1109/ITA.2016.7888186 10.1109/ISIT.2016.7541414 10.1109/TIT.2018.2856885 10.1017/CBO9781139030687 10.1109/ITW.2017.8277986 10.1109/NCC.2015.7084871 10.1109/ISIT.2017.8006555 10.1109/ISIT.2016.7541713 10.1109/ISIT.2013.6620369 10.1109/TIT.2017.2785237 10.1016/S0019-9958(79)90337-1 10.1109/TCOMM.2016.2638841 10.1109/TIT.2014.2306938 10.1109/Allerton.2012.6483193 10.1109/CISS.2016.7460574 10.1109/ICC.2018.8422195 10.1109/TIT.2018.2794543 10.1109/TCOMM.2019.2940671 10.1109/ISIT.2017.8006723 10.1109/ISIT.2018.8437325 10.1109/ISIT.2016.7541276
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020 – notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID	97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES
DOI	10.1109/TIT.2020.2967753
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Hyper Article en Ligne (HAL) Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle	CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional
DatabaseTitleList	Technology Research Database
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science
EISSN	1557-9654
EndPage	1332
ExternalDocumentID	oai:HAL:hal-02951659v1 10_1109_TIT_2020_2967753 8963629
Genre	orig-research
GrantInformation_xml	– fundername: ANR as part of the Investissement d’Avenir Idex ParisSaclay Program grantid: ANR11IDEX000302 – fundername: National Science Foundation grantid: 1527059 funderid: 10.13039/100000001 – fundername: European Commission grantid: H2020-MSCAIF-2017-EF-797805-STRUDEL funderid: 10.13039/501100000780 – fundername: Labex grantid: ANR11LABEX0045DIGICOSME funderid: 10.13039/501100004100
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D 1XC VOOES
ID	FETCH-LOGICAL-c367t-1dc8a7ae673f56eb6454f30bafadfd56893ac3b3fd49ee50331de9149068ed263
IEDL.DBID	RIE
ISICitedReferencesCount	86
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000519925900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9448
IngestDate	Tue Oct 14 20:07:31 EDT 2025 Sun Nov 30 05:23:53 EST 2025 Tue Nov 18 21:35:28 EST 2025 Sat Nov 29 03:31:43 EST 2025 Wed Aug 27 06:29:47 EDT 2025
IsDoiOpenAccess	false
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	3
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c367t-1dc8a7ae673f56eb6454f30bafadfd56893ac3b3fd49ee50331de9149068ed263
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-1880-4798 0000-0003-4671-3287 0000-0002-8717-2117
OpenAccessLink	https://centralesupelec.hal.science/hal-02951659
PQID	2358911491
PQPubID	36024
PageCount	15
ParticipantIDs	hal_primary_oai_HAL_hal_02951659v1 crossref_citationtrail_10_1109_TIT_2020_2967753 ieee_primary_8963629 crossref_primary_10_1109_TIT_2020_2967753 proquest_journals_2358911491
PublicationCentury	2000
PublicationDate	2020-03-01
PublicationDateYYYYMMDD	2020-03-01
PublicationDate_xml	– month: 03 year: 2020 text: 2020-03-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on information theory
PublicationTitleAbbrev	TIT
PublicationYear	2020
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Institute of Electrical and Electronics Engineers
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) – name: Institute of Electrical and Electronics Engineers
References	ref35 ref13 ref34 ref12 ref37 ref15 ref36 ref14 ref31 ref30 ref33 ref11 ref10 ref2 ref1 ref17 ref16 ref19 wan (ref32) 2018 wan (ref27) 2017 wan (ref4) 2016 ref23 ref26 parrinello (ref9) 2018 ref25 ref20 ref22 ref21 ref28 ref29 ref8 ref7 ref3 ref6 ref5 gómez-vilardebó (ref18) 2017 cover (ref24) 2006
References_xml	– ident: ref30 doi: 10.1109/TIT.1973.1055037 – ident: ref2 doi: 10.1109/TNET.2014.2317316 – year: 2017 ident: ref18 article-title: Fundamental limits of caching: Improved bounds with coded prefetching publication-title: arXiv 1612 09071 – year: 2018 ident: ref32 article-title: Fundamental limits of cache-aided shared-link broadcast networks and combination networks – ident: ref15 doi: 10.1049/iet-com.2015.1205 – ident: ref35 doi: 10.1109/FOCS.2011.39 – ident: ref21 doi: 10.1109/ISIT.2015.7282744 – ident: ref36 doi: 10.1109/ISIT.2017.8007091 – ident: ref34 doi: 10.1561/0100000094 – ident: ref33 doi: 10.1109/INFCOM.1998.662940 – ident: ref12 doi: 10.1109/ITW.2016.7606818 – ident: ref3 doi: 10.1109/TIT.2017.2695611 – year: 2018 ident: ref9 article-title: Coded caching with shared caches: Fundamental limits with uncoded prefetching publication-title: arXiv 1809 09422 – ident: ref11 doi: 10.1109/ITA.2016.7888186 – ident: ref22 doi: 10.1109/ISIT.2016.7541414 – ident: ref23 doi: 10.1109/TIT.2018.2856885 – ident: ref31 doi: 10.1017/CBO9781139030687 – ident: ref8 doi: 10.1109/ITW.2017.8277986 – ident: ref20 doi: 10.1109/NCC.2015.7084871 – ident: ref26 doi: 10.1109/ISIT.2017.8006555 – ident: ref19 doi: 10.1109/ISIT.2016.7541713 – ident: ref28 doi: 10.1109/ISIT.2013.6620369 – start-page: 161 year: 2016 ident: ref4 article-title: On the optimality of uncoded cache placement publication-title: Proc IEEE Inf Theory Workshop (ITW) – ident: ref13 doi: 10.1109/TIT.2017.2785237 – ident: ref29 doi: 10.1016/S0019-9958(79)90337-1 – ident: ref17 doi: 10.1109/TCOMM.2016.2638841 – ident: ref1 doi: 10.1109/TIT.2014.2306938 – ident: ref37 doi: 10.1109/Allerton.2012.6483193 – ident: ref16 doi: 10.1109/CISS.2016.7460574 – ident: ref7 doi: 10.1109/ICC.2018.8422195 – start-page: 361 year: 2017 ident: ref27 article-title: Novel outer bounds with uncoded cache placement for combination networks with end-user-caches publication-title: IEEE Inf Theory Workshop (ITW) – ident: ref14 doi: 10.1109/TIT.2018.2794543 – ident: ref6 doi: 10.1109/TCOMM.2019.2940671 – ident: ref25 doi: 10.1109/ISIT.2017.8006723 – year: 2006 ident: ref24 publication-title: Elements of Information Theory – ident: ref10 doi: 10.1109/ISIT.2018.8437325 – ident: ref5 doi: 10.1109/ISIT.2016.7541276
SSID	ssj0014512
Score	2.6323872
Snippet	Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user's local cache memory, even without... Caching is an efficient way to reduce network traffic congestion during peak hours, by storing some content at the user’s local cache memory, even without... Caching is an efficient way to reduce network trafficcongestion during peak hours, by storing some content at theuser’s local cache memory, even without...
SourceID	hal proquest crossref ieee
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	1318
SubjectTerms	Cache memory Caching Coded caching Coding Constraint modelling distributed source coding Encoding Engineering Sciences index coding Indexes Integrated circuit modeling Load modeling Peak hour traffic Placement Traffic congestion uncoded cache placement
Title	An Index Coding Approach to Caching With Uncoded Cache Placement
URI	https://ieeexplore.ieee.org/document/8963629 https://www.proquest.com/docview/2358911491 https://centralesupelec.hal.science/hal-02951659
Volume	66
WOSCitedRecordID	wos000519925900002&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1557-9654 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014512 issn: 0018-9448 databaseCode: RIE dateStart: 19630101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB7a4kEPVqtifRHEi-C2yT6Szc1SLAoiPVT0tmw3EyrIVnT195vZ3S6KIngLIYGQL5PJZGa-AThTTgVkUoZOkCLlhSrlrsW5Ry41KuxjU1Oy69-qu7v48VFPW3DR5MIgYhl8hgNqlr58s8ze6atsGLvTIn3dhrZSqsrVajwGYSQqZnDhBNjZHCuXJNfD2c3MGYI-H_haKhUF31RQe0EBkGVllR_XcaljJt3_rW4LNuu3JBtV4G9DC_MedFd1Glgttj3Y-EI6uAOXo5zdEEciGy9JcbFRTSvOiiUbV7GV7OGpWLD7nBLeTdmJbEof7rSEXbifXM3G115dR8HLAqkKT5gsTlWKUgU2kjgnEi8b8HnqgLAmku7JkmbBPLAm1Ijk1xQGtTOduIzR-DLYg06-zHEfmLVkIqH1IxOEKkad6VgIyW3M51EosA_D1dYmWU0yTrUunpPS2OA6cWAkBEZSg9GH82bGS0Ww8cfYU4dWM4yYsa9Htwn1cd89FWWkP0QfdgibZlQNSx-OVuAmtZi-JZQn7G77UIuD32cdwjotoAo6O4JO8fqOx7CWfRRPb68n5Qn8BC5i1Fo
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3da9swED_arrDtYf3aaLZuFWUvg7mRbH1YbwthJWFp6EPK-iYc60QLwymt279_OtsxHR2DvQkhgdBPp9Pp7n4H8NlEFVBqLaMgKZNIU_DY4jwhlxoV9gmFb9j1Z2Y-z6-u7MUGfO1zYRCxCT7DU2o2vny_Kh_oq2yYx9OiU7sJL5SUqWiztXqfgVSi5QYXUYSj1bF2SnI7XEwX0RRM-WlqtTEq-0MJbV5TCGRTW-XZhdxombOd_1vfLrzpXpNs1MK_BxtY7cPOulID6wR3H14_oR08gG-jik2JJZGNV6S62KgjFmf1io3b6Er286a-ZpcVpbz7phPZBX250xLewuXZ98V4knSVFJIy06ZOhC_zwhSoTRaUxiXReIWML4sIRfBKx0dLUWbLLHhpEcmzKTzaaDxxnaNPdfYOtqpVhYfAQiAjCUOqfCZNjra0uRCah5wvlRQ4gOF6a13Z0YxTtYtfrjE3uHURDEdguA6MAXzpZ9y2FBv_GHsS0eqHETf2ZDRz1MfT-FjUyj6KARwQNv2oDpYBHK3BdZ2g3jvKFI73vbTi_d9nHcPLyeJ85mbT-Y8P8IoW04agHcFWffeAH2G7fKxv7u8-NafxN2SF16E
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Index+Coding+Approach+to+Caching+With+Uncoded+Cache+Placement&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Wan%2C+Kai&rft.au=Tuninetti%2C+Daniela&rft.au=Piantanida%2C+Pablo&rft.date=2020-03-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=66&rft.issue=3&rft.spage=1318&rft_id=info:doi/10.1109%2FTIT.2020.2967753&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon