发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Capacity Results for Erasure Broadcast Channels with Intermittent Feedback 具有间歇反馈的Erasure广播信道容量结果
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989343
Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin
{"title":"Capacity Results for Erasure Broadcast Channels with Intermittent Feedback","authors":"Alireza Vahid, I-Hsiang Wang, Shih-Chun Lin","doi":"10.1109/ITW44776.2019.8989343","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989343","url":null,"abstract":"Recently, we showed that, rather surprisingly, the capacity region of the two-user erasure broadcast channel with global delayed channel state information (CSI) can be achieved with single-user delayed CSI only. More precisely, we assumed one receiver does not provide its channel state to the other two nodes (the other receiver and the transmitter), while the other receiver reveals its state globally with unit delay. In this work, we consider a more general setting in which feedback links are intermittent. To be precise, at any time instant, each receiver broadcasts its CSI, and this information either becomes available to the other two nodes or gets erased. For this setting, we develop a new set of outer bounds to capture the intermittent nature of the feedback links. These outer bounds depend on the probability that both feedback links are erased rather than the individual erasure probability of each feedback link. This result matches our earlier findings for the single-user delayed CSI scenario. We also provide a capacity-achieving recursive communication protocol for the scenario in which feedback links are fully correlated.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 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":"121817412","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
New Upper Bounds on the Capacity of Primitive Diamond Relay Channels 原始菱形中继信道容量的新上界
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989311
Xiugang Wu, Ayfer Özgür, M. Peleg, S. Shamai
{"title":"New Upper Bounds on the Capacity of Primitive Diamond Relay Channels","authors":"Xiugang Wu, Ayfer Özgür, M. Peleg, S. Shamai","doi":"10.1109/ITW44776.2019.8989311","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989311","url":null,"abstract":"Consider a primitive diamond relay channel, where a source X wants to send information to a destination with the help of two relays Y1 and Y2, and the two relays can communicate to the destination via error-free digital links of capacities C1 and C2 respectively, while Y1 and Y2 are conditionally independent given X. In this paper, we develop new upper bounds on the capacity of such primitive diamond relay channels that are tighter than the cut-set bound. Our results include both the Gaussian and the discrete memoryless case and build on the information inequalities recently developed in [6]–[8] that characterize the tension between information measures in a certain Markov chain.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"36 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":"122170841","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
Context Aware Laplacian Mechanism for Local Information Privacy 上下文感知本地信息隐私的拉普拉斯机制
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989402
Mohamed Seif, R. Tandon, Ming Li
{"title":"Context Aware Laplacian Mechanism for Local Information Privacy","authors":"Mohamed Seif, R. Tandon, Ming Li","doi":"10.1109/ITW44776.2019.8989402","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989402","url":null,"abstract":"In this paper, we consider the problem of designing additive noise mechanisms for data release subject to a local information privacy constraint. While there has been significant prior work on devising additive noise mechanisms for differential privacy (such as Laplacian and Gaussian mechanisms), for the notion of information privacy, which accounts for prior-knowledge about the data, there are no such general purpose additive noise mechanisms. To this end, we devise a prior-aware Laplacian noise mechanism, which satisfies local information privacy. We show that adding context awareness (i.e., via the knowledge of prior of the data) improves the tradeoff between utility and privacy when compared to context-unaware mechanisms.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"60 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":"124971856","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
New Bounds for GLD Lattices and Codes GLD格和码的新边界
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989412
M. F. Bollauf, J. Boutros, N. Mir
{"title":"New Bounds for GLD Lattices and Codes","authors":"M. F. Bollauf, J. Boutros, N. Mir","doi":"10.1109/ITW44776.2019.8989412","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989412","url":null,"abstract":"We prove that the ensemble of random Generalized Low-Density (GLD) lattices can attain the Poltyrev limit for an alphabet size increasing polylogarithmically with the lattice dimension. Our main theorem imposes no constraints on the normalized minimum distance of the code associated to the lattice ensemble, any asymptotically good code is suitable. This is a great improvement with respect to the first theorem on Poltyrev goodness of GLD lattices (2015). Our new bound is based on a new method referred to as the buckets approach where we employ the asymptotics of the restricted compositions of the Hamming weight. The new bound has applications in many coding areas beyond the specific lattice ensemble considered in this paper.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"71 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":"125667912","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
Coset Probability Based Majority-logic Decoding for Non-binary LDPC Codes 基于协集概率的非二进制LDPC码多数逻辑译码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989103
V. B. Wijekoon, Shuiyin Liu, E. Viterbo, Y. Hong, R. Micheloni, A. Marelli
{"title":"Coset Probability Based Majority-logic Decoding for Non-binary LDPC Codes","authors":"V. B. Wijekoon, Shuiyin Liu, E. Viterbo, Y. Hong, R. Micheloni, A. Marelli","doi":"10.1109/ITW44776.2019.8989103","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989103","url":null,"abstract":"This paper presents a majority-logic decoding (MLgD) algorithm for non-binary LDPC codes based on a novel expansion of the Tanner graph. The expansion introduced converts the Q-ary graph into a binary one, which makes the new MLgD algorithm more attractive for hardware implementations. Proposed algorithm performs significantly better than the existing MLgD algorithms in the waterfall region, and it shows a much lower error-floor as well. Algorithm only requires integer additions, comparisons, finite field operations and some binary operations. Thus, it offers an effective trade-off between performance and complexity in decoding non-binary LDPC codes.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 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":"130382751","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
Block Source Coding with Sequential Encoding 块源编码与顺序编码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989296
Hamid Ghourchian, Photios A. Stavrou, T. Oechtering, M. Skoglund
{"title":"Block Source Coding with Sequential Encoding","authors":"Hamid Ghourchian, Photios A. Stavrou, T. Oechtering, M. Skoglund","doi":"10.1109/ITW44776.2019.8989296","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989296","url":null,"abstract":"We introduce the concept of achievable cumulative rate distribution functions (CRDF) to characterize sequentially encoding processes that ensure a lossless or lossy reconstruction subject to an average distortion using a non-causal decoder. Utilizing tools from majorization theory, we derive necessary and sufficient conditions on the CRDF for a given IID source. It turns out that the optimal achievable distortion level can be adequately characterized by the concave-hull of the CRDF.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"57 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":"127936427","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
Relaxed Wyner’s Common Information 放松怀纳的共同信息
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989086
Erixhen Sula, M. Gastpar
{"title":"Relaxed Wyner’s Common Information","authors":"Erixhen Sula, M. Gastpar","doi":"10.1109/ITW44776.2019.8989086","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989086","url":null,"abstract":"In the problem of coded caching for media delivery, two separate coding opportunities have been identified. The first opportunity is a multi-user advantage and crucially hinges on a public broadcast link in the delivery phase. This has been explored in a plethora of works. The second opportunity has received far less attention and concerns similarities between files in the database. Here, the paradigm is to cache “the similarity” between the files. Upon the request, the encoder refines this by providing the specific details for the requested files. Extending Gray and Wyner’s work (1974), it follows that the right measure of file similarity is Wyner’s Common Information and its generalizations. The present paper surveys and extends the role of Wyner’s Common Information in caching. As a novel result, explicit solutions are found for the Gaussian case under mean-squared error, both for the caching problem as well as for the network considered by Gray and Wyner. Our solution leverages and extends the recent technique of factorization of convex envelopes.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"67 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":"121159731","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}
引用次数: 11
Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample Setups 矢量值Witsenhausen反例设置的因果解码器协调编码
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989039
T. Oechtering, M. L. Treust
{"title":"Coordination Coding with Causal Decoder for Vector-valued Witsenhausen Counterexample Setups","authors":"T. Oechtering, M. L. Treust","doi":"10.1109/ITW44776.2019.8989039","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989039","url":null,"abstract":"The vector-valued extension of the famous Witsenhausen counter-example setup is studied where the first decision maker (DM1) non-causally knows and encodes the iid state sequence and the second decision maker (DM2) causally estimates the interim state. The coding scheme is transferred from the finite alphabet coordination problem for which it is proved to be optimal. The extension to the Gaussian setup is based on a non-standard weak typicality approach and requires a careful average estimation error analysis since the interim state is estimated by the decoder. Next, we provide a choice of auxiliary random variables that outperforms any linear scheme. The optimal scheme remains unknown.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"31 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":"117255787","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}
引用次数: 3
Endurance-Limited Memories with Informed Decoder 耐力有限的记忆与知情解码器
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989084
Y. M. Chee, M. Horovitz, A. Vardy, Van Khu Vu, Eitan Yaakobi
{"title":"Endurance-Limited Memories with Informed Decoder","authors":"Y. M. Chee, M. Horovitz, A. Vardy, Van Khu Vu, Eitan Yaakobi","doi":"10.1109/ITW44776.2019.8989084","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989084","url":null,"abstract":"Non-volatile resistive memories, such as phase change memories and resistive random access memories, have attracted significant attention recently due to their scalability, speed, and rewritability. However, in order to use these memories in large-scale memory and storage systems, the limited endurance deficiency of these memories must be addressed. In a recent paper, we proposed a new coding scheme, called endurance-limited memories (ELM) codes, which increases the endurance of these memories by limiting the number of cell programming operations. Namely, an l-change t-write ELM code is a coding scheme that allows to write t messages into some n binary cells while guaranteeing that the number of times each cell is programmed is at most l. There are several models of these codes which depend upon the information that is available to the encoder and the decoder before each write. This information can be one of the following three options: 1. the number of times each cell has been programmed, 2. only the memory state before programming, or 3. no information is available on the cells’ state or previous writes. In this paper, we study the models in which the decoder knows on each write the number of times each cell has been programmed before the last write, while for the encoder we consider the aforementioned three possibilities.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"1 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":"128624896","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
Channel Resolvability with a Full-Duplex Decode-and-Forward Relay 全双工译码转发中继的信道可分辨性
2019 IEEE Information Theory Workshop (ITW) Pub Date : 2019-08-01 DOI: 10.1109/ITW44776.2019.8989307
Noha Helal, M. Bloch, Aria Nosratinia
{"title":"Channel Resolvability with a Full-Duplex Decode-and-Forward Relay","authors":"Noha Helal, M. Bloch, Aria Nosratinia","doi":"10.1109/ITW44776.2019.8989307","DOIUrl":"https://doi.org/10.1109/ITW44776.2019.8989307","url":null,"abstract":"We study the minimum randomness required at a source node to approximately produce a chosen i.i.d. distribution at a destination, while a relay assists in the process. In the classical relay problem, the relay does not have any message of its own to transmit, and only re-transmits a function of its observation. In the resolvability problem the variable of interest is the randomness rate, therefore we assume the relay does not have access to any randomness outside what it observes at its input, i.e., the relay output is a deterministic function of its input. A block-Markov scheme is used in which the relay decodes the source message to assist with the approximation of the i.i.d. output. In addition, the relay extracts randomness from its noisy channel observation in each block and uses it in the next block to improve the resolvability rate. The careful handling of this randomness recycling, in order to avoid the introduction of unwanted dependencies, is a key part of the contribution of this paper.","PeriodicalId":214379,"journal":{"name":"2019 IEEE Information Theory Workshop (ITW)","volume":"93 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":"125687065","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
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信