메뉴 건너뛰기




Volumn 2015-June, Issue , 2015, Pages 1686-1690

Coded caching for files with distinct file sizes

Author keywords

[No Author keywords available]

Indexed keywords

CUT-SET BOUND; ENTROPY INEQUALITY; HIGH VOLUMES; LOWER BOUNDS; MULTIPLE USER; PERFORMANCE LIMITS; TRANSMISSION RATES; UPPER BOUND;

EID: 84969801999     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2015.7282743     Document Type: Conference Paper
Times cited : (83)

References (8)
  • 1
    • 84899645734 scopus 로고    scopus 로고
    • Fundamental limits of caching
    • May
    • M. A. Maddah-Ali, and U. Niesen, "Fundamental Limits of Caching", in IEEE Trans. Inform. Theory, vol. 60, no. 5, pp. 2856-2867, May 2014.
    • (2014) IEEE Trans. Inform. Theory , vol.60 , Issue.5 , pp. 2856-2867
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 2
    • 85027907954 scopus 로고    scopus 로고
    • Decentralized coded caching attains order-optimal memory-rate tradeoff
    • M. A. Maddah-Ali, and U. Niesen, "Decentralized Coded Caching Attains Order-Optimal Memory-Rate Tradeoff', to appear in IEEEIACM Trans. Netw., 2014.
    • (2014) IEEEI ACM Trans. Netw.
    • Maddah-Ali, M.A.1    Niesen, U.2
  • 8
    • 0031268521 scopus 로고    scopus 로고
    • A framework for linear information inequalities
    • Nov.
    • R. W. Yeung, "A Framework for Linear Information Inequalities", in IEEE Trans. Inform. Theory, vol. 43, no. 6, pp. 1924-1934, Nov. 1997.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , Issue.6 , pp. 1924-1934
    • Yeung, R.W.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.