2020 IEEE International Symposium on Information Theory (ISIT)最新文献_第3页

A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations 一种具有最优速率和较少子分组的D2D编码缓存设计框架

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174215

Xiang Zhang, Xianfeng Terry Yang, Mingyue Ji

{"title":"A New Design Framework on D2D Coded Caching with Optimal Rate and Less Subpacketizations","authors":"Xiang Zhang, Xianfeng Terry Yang, Mingyue Ji","doi":"10.1109/ISIT44484.2020.9174215","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174215","url":null,"abstract":"In this paper, we propose a new design framework on Device-to-Device (D2D) coded caching networks with optimal communication load (rate) but significantly less file subpacketizations compared to that of the well-known D2D coded caching scheme proposed by Ji, Caire and Molisch (JCM). The proposed design framework is referred to as the Packet Type-based (PTB) design, where each file is partitioned into packets according to their pre-defined types while the cache placement and user multicast grouping are based on the packet types. This leads to the so-called raw packet saving gain for the subpacketization levels. By a careful selection of transmitters within each multicasting group, a so-called further splitting ratio gain of the subpacketizatios can also be achieved. By the joint effect of the raw packet saving gain and the further splitting ratio gain, an order-wise subpacketization reduction can be achieved compared to the JCM scheme while preserving the optimal rate. In addition, as the first time presented in the literature according to our knowledge, we find that unequal subpacketizaton is a key to achieve subpacketization reductions when the number of users is odd. As a by-product, instead of directly translating shared link caching schemes to D2D caching schemes, at least for the sake of subpackeitzation, a new design framework is indeed needed.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130255329","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}

引用次数: 1

On the Storage Cost of Private Information Retrieval 论私有信息检索的存储成本

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174244

C. Tian

引用次数: 0

Linear Network Error Correction Coding Revisited 重新审视线性网络纠错编码

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174493

Xuan Guang, R. Yeung

引用次数: 3

Quantum Blahut-Arimoto Algorithms 量子Blahut-Arimoto算法

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174429

Navneeth Ramakrishnan, Raban Iten, V. Scholz, M. Berta

引用次数: 6

Sequential Detection and Isolation of a Correlated Pair 相关对的顺序检测和隔离

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174318

A. Chaudhuri, Georgios Fellouris

引用次数: 0

ISIT 2020 Table of Contents ISIT 2020目录

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/isit44484.2020.9174500

引用次数: 0

Locally Balanced Constraints 局部平衡约束

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9173933

Ryan Gabrys, H. M. Kiah, A. Vardy, Eitan Yaakobi, Yiwei Zhang

{"title":"Locally Balanced Constraints","authors":"Ryan Gabrys, H. M. Kiah, A. Vardy, Eitan Yaakobi, Yiwei Zhang","doi":"10.1109/ISIT44484.2020.9173933","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9173933","url":null,"abstract":"Three new constraints are introduced in this paper. These constraints are characterized by limitations on the Hamming weight of every subword of some fixed even length ℓ. In the (ℓ, δ)-locally-balanced constraint, the Hamming weight of every length-ℓ subword is bounded between ℓ/2 — δ and ℓ/2 + δ. The strong-(ℓ,δ)-locally-balanced constraint imposes the locally- balanced constraint for any subword whose length is at least ℓ. Lastly, the Hamming weight of every length-ℓ subword which satisfies the (ℓ, δ)-locally-bounded constraint is at most ℓ/2 — δ. It is shown that the capacity of the strong-(ℓ, δ)-locally-balanced constraint does not depend on the value of ℓ and is identical to the capacity of the (2δ + 1)-RDS constraint. The latter constraint limits the difference between the number of zeros and ones in every prefix of the word to be at most 2δ + 1. This value is also a lower bound on the capacity of the (ℓ, δ)-locally-balanced constraint, while a corresponding upper bound is given as well. Lastly, it is shown that if δ is not large enough, namely for $delta < sqrt ell /2$, then the capacity of the (ℓ, δ)-locally-bounded constraint approaches 1 as ℓ increases.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"79 8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130703959","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}

引用次数: 8

Bounds on Permutation Channel Capacity 置换信道容量的界

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174455

A. Makur

{"title":"Bounds on Permutation Channel Capacity","authors":"A. Makur","doi":"10.1109/ISIT44484.2020.9174455","DOIUrl":"https://doi.org/10.1109/ISIT44484.2020.9174455","url":null,"abstract":"The \"permutation channel\" model is a convenient representation of certain communication networks, where packets are not indexed and delivered out-of-order, and closely resembles models of DNA based storage systems. It consists of a standard discrete memoryless channel (DMC) followed by an independent random permutation block that permutes the output codewords of the DMC. In this paper, we present some new general bounds on the so called permutation channel capacity of such channels. Specifically, on the achievability front, we derive a lower bound on the permutation channel capacity of any DMC in terms of the rank of the stochastic matrix of the DMC. On the converse front, we illustrate two complementary upper bounds on the permutation channel capacity of any DMC whose stochastic matrix is entry-wise strictly positive. Together, these bounds characterize the permutation channel capacities of entry-wise strictly positive and \"full rank\" DMCs. Finally, we also demonstrate two related results concerning the well-known degradation preorder. The first constructs a symmetric channel for any DMC such that the DMC is a degraded version of the symmetric channel, and the second demonstrates the monotonicity of permutation channel capacity.","PeriodicalId":159311,"journal":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130758487","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}

引用次数: 4

Trimming Decoding of Color Codes over the Quantum Erasure Channel 量子擦除信道上颜色码的微调解码

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174084

Sangjun Lee, M. Mhalla, V. Savin

引用次数: 1

Secure GDoF of the Z-channel with Finite Precision CSIT: How Robust are Structured Codes? 有限精度CSIT z通道的安全gof:结构化代码的鲁棒性如何?

2020 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2020-06-01 DOI: 10.1109/ISIT44484.2020.9174149

Yao-Chia Chan, S. Jafar

引用次数: 5