2015 IEEE Information Theory Workshop (ITW)最新文献

Degraded broadcast channel: Secrecy outside of a bounded range 降级广播信道:保密性超出限定范围

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2018-01-11 DOI: 10.1109/TIT.2018.2791995

Shaofeng Zou, Yingbin Liang, L. Lai, H. Poor, S. Shamai

引用次数: 10

A new coding method for a multiple-access system with a large number of active users 一种适用于具有大量活跃用户的多址系统的新编码方法

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133114

A. Frolov, V. Zyablov

引用次数: 8

On the transmission of a bivariate Gaussian source over the Gaussian broadcast channel with feedback 二元高斯源在带反馈的高斯广播信道上的传输

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133100

Yonathan Murin, Y. Kaspi, R. Dabora, Deniz Gündüz

引用次数: 2

Capacity scaling in noncoherent wideband massive SIMO systems 非相干宽带大规模SIMO系统的容量缩放

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133138

Mainak Chowdhury, Alexandros Manolakos, Felipe Gómez-Cuba, E. Erkip, A. Goldsmith

引用次数: 6

CEO problem for belief sharing CEO分享信念的问题

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133076

Aditya Vempaty, L. Varshney

{"title":"CEO problem for belief sharing","authors":"Aditya Vempaty, L. Varshney","doi":"10.1109/ITW.2015.7133076","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133076","url":null,"abstract":"We consider the CEO problem for belief sharing. Multiple subordinates observe independently corrupted versions of uniformly distributed data and transmit coded versions over rate-limited links to a CEO who then estimates the underlying data. Agents are not allowed to convene before transmitting their observations. This formulation is motivated by the practical problem of a firm's CEO estimating uniformly distributed beliefs about a sequence of events, before acting on them. Agents' observations are modeled as jointly distributed with the underlying data through a given conditional probability density function. We study the asymptotic behavior of the minimum achievable mean squared error distortion at the CEO in the limit when the number of agents L and the sum rate R tend to infinity. We establish a 1/R2 convergence of the distortion, an intermediate regime of performance between the exponential behavior in discrete CEO problems [Berger, Zhang, and Viswanathan (1996)], and the 1/R behavior in Gaussian CEO problems [Viswanathan and Berger (1997)]. Achievability is proved by a layered architecture with scalar quantization, distributed entropy coding, and midrange estimation. The converse is proved using the Bayesian Chazan-Zakai-Ziv bound.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123435063","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

Sub-Nyquist sampling achieves optimal rate-distortion 亚奈奎斯特采样实现最佳的速率失真

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133113

A. Kipnis, A. Goldsmith, Yonina C. Eldar

引用次数: 8

Caching-aided coded multicasting with multiple random requests 具有多个随机请求的缓存辅助编码多播

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133172

Mingyue Ji, A. Tulino, J. Llorca, G. Caire

{"title":"Caching-aided coded multicasting with multiple random requests","authors":"Mingyue Ji, A. Tulino, J. Llorca, G. Caire","doi":"10.1109/ITW.2015.7133172","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133172","url":null,"abstract":"The capacity of caching networks has received considerable attention in the past few years. A particularly studied setting is the shared link caching network, in which a single source with access to a file library communicates with multiple users, each having the capability to store segments (packets) of the library files, over a shared multicast link. Each user requests one file from the library according to a common demand distribution and the server sends a coded multicast message to satisfy all users at once. The problem consists of finding the smallest possible average codeword length to satisfy such requests. In this paper, we consider the generalization to the case where each user places L ≥ 1 independent requests according to the same common demand distribution. We propose an achievable scheme based on random vector (packetized) caching placement and multiple groupcast index coding, shown to be order-optimal in the asymptotic regime in which the number of packets per file B goes to infinity. We then show that the scalar (B = 1) version of the proposed scheme can still preserve order-optimality when the number of per-user requests L is large enough. Our results provide the first order-optimal characterization of the shared link caching network with multiple random requests, revealing the key effects of L on the performance of caching-aided coded multicast schemes.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"101 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127058602","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}

引用次数: 56

Secrecy degrees of freedom of the two-user MISO broadcast channel with mixed CSIT 混合CSIT下双用户MISO广播信道的保密自由度

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133129

Zhao Wang, Ming Xiao, M. Skoglund, H. Poor

引用次数: 6

Codes for RAID solutions based upon SSDs 基于ssd的RAID方案代码

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133159

A. Vardy, Eitan Yaakobi

{"title":"Codes for RAID solutions based upon SSDs","authors":"A. Vardy, Eitan Yaakobi","doi":"10.1109/ITW.2015.7133159","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133159","url":null,"abstract":"One of the prominent properties of flash memories is their asymmetry between writing and erasing. When pages, which are the smallest write unit, are updated, they are written in a new copy rather than in place. As a result, every page can have more than one copy in the memory, its current version as well as some of its old invalid copies. Each invalid copy can be cleaned only when the block in which it resides is erased (blocks are the smallest erase unit and are typically in the order of hundreds of pages). This write property introduces redundancy in the memory, given by the invalid copies of the pages, and as a result can also affect the memory lifetime. In this paper we show how this inherent redundancy of invalid pages can be taken advantage of for the purpose of improving RAID solutions which are based upon Solid State Drives (SSDs). Our main contribution in the paper is a construction which shows how to improve the repair bandwidth of codes which are implemented on SSDs. We first show that with a single parity it is possible to transmit on the average roughly half of the data for rebuilding a single drive failure. We then show how these ideas can be extended for Zigzag codes with two parities and again improve their repair bandwidth.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125805333","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}

引用次数: 2

Separation architectures for lossy compression 有损压缩的分离架构

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133164

Ying-zong Huang, G. Wornell

引用次数: 2