2019 IEEE Information Theory Workshop (ITW)最新文献_第9页

On the Fundamental Limit of Coded Caching Systems with a Single Demand Type 单需求型编码缓存系统的基本限制

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989383

Shuo Shao, Jesús Gomicronmez-Vilardebomicron, Kai Zhang, C. Tian

{"title":"On the Fundamental Limit of Coded Caching Systems with a Single Demand Type","authors":"Shuo Shao, Jesús Gomicronmez-Vilardebomicron, Kai Zhang, C. Tian","doi":"10.1109/ITW44776.2019.8989383","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989383","url":null,"abstract":"Caching is a technique to reduce the communication load in peak hours by prefetching contents during off-peak hours. Recently Maddah-Ali and Niesen introduced an information theoretic framework for coded caching, and showed that significant improvement can be obtained compared to uncoded caching. Considerable efforts have been devoted to identify the precise information theoretic fundamental limit of such systems, however the difficulty of this task has also become clear. One of the reasons for this difficulty is that the original coded caching setting allows multiple demand types during delivery, which in fact introduces tension in the coding strategy to accommodate all of them. In this paper, we seek to develop a better understanding of the fundamental limit of coded caching by investigating single demand type systems. We first show that in the canonical three-user three-file systems, such single demand type systems already provide important insights. Motivated by these findings, we focus on systems where the number of users and the number of files are the same, and the demand type is when all files are being requested. A novel coding scheme is proposed, which provides several optimal memory-transmission operating points. Outer bounds for this class of systems are also considered, and their relation with existing bounds is discussed.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"283 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127554428","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 7

Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems 一类双发送方单播索引编码问题的最优广播速率

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989283

Chinmayananda Arunachala, V. Aggarwal, B. Rajan

{"title":"Optimal Broadcast Rate of a Class of Two-Sender Unicast Index Coding Problems","authors":"Chinmayananda Arunachala, V. Aggarwal, B. Rajan","doi":"10.1109/ITW44776.2019.8989283","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989283","url":null,"abstract":"The two-sender unicast index coding problem consists of two senders collectively having all the demanded messages of a set of receivers, where each receiver demands a unique message. The senders avail the knowledge of the side-information present at all the receivers to reduce the total number of broadcast transmissions. This problem is relevant in many practical communication problems like multi-source satellite communication, multi-user coded cooperative data exchange, and other related problems. In this paper, the two-sender unicast index coding problem is analyzed using three independent single-sender subproblems. Optimal broadcast rate (total number of transmitted bits per message bit as the message length tends to infinity) for all the unsolved instances of a special class of the two-sender unicast index coding problem is provided in terms of those of the three associated subproblems. The optimal broadcast rate established in this work serves as a lower bound for the optimal broadcast rate of any general associated two-sender unicast index coding problem. An achievable broadcast rate (total number of transmitted bits per message bit) with finite length messages for any finite length, is given for a subclass of the two-sender unicast index coding problem by providing a code-construction. This serves as a tighter upper bound when compared to the prior state of art.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114726513","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

ITW 2019 Program ITW 2019计划

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/itw44776.2019.8989312

引用次数: 0

Design of Guruswami-Sudan List Decoding for Elliptic Codes 椭圆码的Guruswami-Sudan表译码设计

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989286

Yunqi Wan, Li Chen, Fangguo Zhang

引用次数: 4

Error Exponents of Typical Random Codes of Source-Channel Coding 源信道编码中典型随机码的误差指数

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989340

Ran Averbuch, N. Merhav

引用次数: 2

ITW 2019 Technical Program Committee ITW 2019技术计划委员会

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/itw44776.2019.8989207

引用次数: 0

Intrinsic Randomness Problem with Respect to a Subclass of f-divergence 关于f-散度子类的固有随机性问题

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/itw44776.2019.8989245

R. Nomura

引用次数: 1

Non-Colluding Attacks Identification in Distributed Computing 分布式计算中的非串通攻击识别

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989337

Arnav Solanki, Martina Cardone, S. Mohajer

引用次数: 7

Dynamics of Damped Approximate Message Passing Algorithms 阻尼近似消息传递算法的动力学

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989237

Kazushi Mimura, J. Takeuchi

引用次数: 4

The Metagenomic Binning Problem: Clustering Markov Sequences 宏基因组分簇问题:聚类马尔可夫序列

2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8988939

Grant Greenberg, Ilan Shomorony

引用次数: 1