Campus Units

Electrical and Computer Engineering, Mathematics

Document Type

Article

Publication Version

Accepted Manuscript

Publication Date

4-2018

Journal or Book Title

IEEE Transactions on Information Theory

Volume

64

Issue

4

First Page

3099

Last Page

3120

DOI

10.1109/TIT.2018.2800059

Abstract

Coded caching is a technique that generalizes conventional caching and promises significant reductions in traffic over caching networks. However, the basic coded caching scheme requires that each file hosted in the server be partitioned into a large number (i.e., the subpacketization level) of non-overlapping subfiles. From a practical perspective, this is problematic as it means that prior schemes are only applicable when the size of the files is extremely large. In this work, we propose coded caching schemes based on combinatorial structures called resolvable designs. These structures can be obtained in a natural manner from linear block codes whose generator matrices possess certain rank properties.We obtain several schemes with subpacketization levels substantially lower than the basic scheme at the cost of an increased rate. Depending on the system parameters, our approach allows us to operate at various points on the subpacketization level vs. rate tradeoff.

Comments

This article is published as Tang, Li, and Aditya Ramamoorthy. "Coded Caching Schemes with Reduced Subpacketization from Linear Block Codes." IEEE Transactions on Information Theory 64, no. 4 (2018): 3099-3120. DOI: 10.1109/TIT.2018.2800059. Posted with permission.

Rights

Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Copyright Owner

IEEE

Language

en

File Format

application/pdf

Available for download on Tuesday, January 01, 2019

Published Version

Share

COinS