Back to search

University of British Columbia

Linear information theory and its application to the coded caching problem

Abstract

dc:description

We investigate the peculiar properties of information theory when all random variables involved are linear functions of a given source endowed with the structure of a Z/2Z-vector space. We describe the coded caching problem and review the progress made in particular cases of the problem. We devise a new caching scheme for a special instance of the problem and extend some approaches in the coded caching literature to the linear case such that we can use our results in linear algebra to drive new lower bounds. We show one example within coded caching, with the linearity assumption, where our results in information theory lead to stronger bounds. Our results infer certain "qualitative" aspects of caching schemes, using the information they must contain, rather than giving a complete analysis of such schemes.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Computer Science
Grantor dc:publisher
University of British Columbia
Year dc:date
2022

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Tootooni Mofrad, Amirhossein
Contributors dc:contributor
  • Friedman, Joel, 1962-

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/81218

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Tootooni Mofrad, Amirhossein. Linear information theory and its application to the coded caching problem. master's thesis, University of British Columbia, 2022. http://hdl.handle.net/2429/81218