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

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

筛选
英文 中文
Secret-Key capacity of compound source models with one-way public communication 单向公开通信复合源模型的保密密钥容量
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360774
Nima Tavangaran, H. Boche, R. Schaefer
{"title":"Secret-Key capacity of compound source models with one-way public communication","authors":"Nima Tavangaran, H. Boche, R. Schaefer","doi":"10.1109/ITWF.2015.7360774","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360774","url":null,"abstract":"In the classical Secret-Key generation model, Common Randomness is generated by two terminals based on the observation of correlated components of a common source, while keeping it secret from a non-legitimate observer. It is assumed that the statistics of the source are known to all participants. In this work, the Secret-Key generation model based on a compound source is studied where the source realization is unknown. The protocol should guarantee the security and reliability of the generated Secret-Key, simultaneously for all possible realizations of the compound source. A single-letter lower-bound of the Secret-Key capacity is derived for the case where the public communication rate is limited. Furthermore, a multi-letter capacity formula is computed for the case where the public communication is unconstrained.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129249968","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
A note on lower bounds for non-interactive message authentication using weak keys 关于使用弱密钥的非交互式消息身份验证的下界的说明
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360773
Divesh Aggarwal, Alexander Golovnev
{"title":"A note on lower bounds for non-interactive message authentication using weak keys","authors":"Divesh Aggarwal, Alexander Golovnev","doi":"10.1109/ITWF.2015.7360773","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360773","url":null,"abstract":"In this note, we prove lower bounds on the amount of entropy of random sources necessary for secure message authentication. We consider the problem of non-interactive c-time message authentication using a weak secret key having min-entropy k. We show that existing constructions using (c+1)-wise independent hash functions are optimal. This result resolves one of the main questions left open by the work of Dodis and Spencer [1] who considered this problem for one-time message authentication of one-bit messages.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124025962","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
On the degrees of freedom of the three-user MIMO interference channel with delayed CSIT 具有延迟CSIT的三用户MIMO干扰信道的自由度研究
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360771
Alexey Buzuverov, Hussein Al-Shatri, A. Klein
{"title":"On the degrees of freedom of the three-user MIMO interference channel with delayed CSIT","authors":"Alexey Buzuverov, Hussein Al-Shatri, A. Klein","doi":"10.1109/ITWF.2015.7360771","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360771","url":null,"abstract":"The three-user multiple-input multiple-output interference channel under i.i.d. fading is studied, where the transmitters have the delayed channel state information. The case where all transmitters and all receivers are equipped with M and N antennas, respectively, is considered. For this case, a new transmission scheme is proposed that achieves a number of degrees of freedom higher than previously reported for the range of 3/4 <; M/N <; 1, where the parameters of the scheme are determined as functions of the ratio M/N. The degrees of freedom gains compared to the previous approaches are due to the more effective use of transmit and receive antennas.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132870526","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
Secure degrees of freedom of the interference channel with no eavesdropper CSI 无窃听者CSI干扰信道的安全自由度
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360787
P. Mukherjee, S. Ulukus
{"title":"Secure degrees of freedom of the interference channel with no eavesdropper CSI","authors":"P. Mukherjee, S. Ulukus","doi":"10.1109/ITWF.2015.7360787","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360787","url":null,"abstract":"We consider the K-user interference channel with an external eavesdropper, with no eavesdropper's channel state information at the transmitters (CSIT). We determine the exact sum secure degrees of freedom (s.d.o.f.) for this channel by providing a new alignment based achievable scheme and a matching converse. Our results show that the lack of eavesdropper's CSIT does not have a significant impact on the optimal s.d.o.f. of the interference channel with an external eavesdropper, especially when the number of users is large.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131516738","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
Correlated Gaussian sources over Gaussian weak interference channels 高斯弱干扰信道上的相关高斯源
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360739
Iñaki Estella Aguerri, Deniz Gündüz
{"title":"Correlated Gaussian sources over Gaussian weak interference channels","authors":"Iñaki Estella Aguerri, Deniz Gündüz","doi":"10.1109/ITWF.2015.7360739","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360739","url":null,"abstract":"We consider the transmission of two correlated Gaussian sources over a Gaussian weak interference channel. Each transmitter has access to one component of a bivariate Gaussian source, and each of these components need to be reconstructed at the corresponding receiver, under the squared-error distortion measure. We are interested in characterizing the region of average distortion pairs achievable simultaneously at the two receivers. We derive an outer bound on the achievable region, and show that, under certain conditions, achievable distortion pair with uncoded transmission lies on this outer bound; therefore, it is optimal. In particular, optimality of uncoded transmission is shown to hold for all signal-to-noise ratio values below a certain threshold which depends on the correlation coefficient between the sources.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125679479","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
Construction of polar codes for channels with memory 带存储器信道的极性码的构造
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360760
Runxin Wang, J. Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou
{"title":"Construction of polar codes for channels with memory","authors":"Runxin Wang, J. Honda, Hirosuke Yamamoto, Rongke Liu, Yi Hou","doi":"10.1109/ITWF.2015.7360760","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360760","url":null,"abstract":"Polar codes for channels with memory are considered in this paper. ŗaşoğlu proved that Arikan's polarization applies to finite-state memory channels but practical decoding algorithms of polar codes for such channels have been unknown. This paper proposes a generalization of successive cancellation algorithm for channels with memory where the complexity is polynomial in the number of states. In addition, two polar coding scheme are proposed to generate codewords following non-i.i.d. process required to achieve the capacity. Whereas one is a simple application of the polar coding scheme for asymmetric memoryless channels, the other one combines a polar code with a fixed-to-variable length homophonic coding scheme, which can realize the input distribution exactly equal to the target process.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124736589","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}
引用次数: 29
Variable-security-level secure network coding 可变安全级别的安全网络编码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360729
Xuan Guang, Jiyong Lu, Fang-Wei Fu
{"title":"Variable-security-level secure network coding","authors":"Xuan Guang, Jiyong Lu, Fang-Wei Fu","doi":"10.1109/ITWF.2015.7360729","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360729","url":null,"abstract":"In network coding theory, when wiretapping attacks occur, secure network coding is introduced to prevent information from being leaked to adversaries. In practical network communications, secure constraints vary with time. How to effectively deal with information transmission and information security simultaneously under different security-levels is introduced in this paper as variable-security-level secure network coding problem. In order to solve this problem efficiently, we propose the concept of local-kernel-preserving variable-security-level secure linear network codes, which have the same local encoding kernel at each internal node. We further present an approach to construct such a family of SLNCs and give an algorithm for efficient implementation. This approach saves the storage space at both source node and internal nodes, and resources and time on networks. Subsequently, an example is given to illustrate our constructive algorithm. Finally, the performance of the proposed algorithm is analyzed, including the field size, computational and storage complexities.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130622605","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
A geometric approach to dynamic network coding 动态网络编码的几何方法
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360764
M. Vázquez-Castro
{"title":"A geometric approach to dynamic network coding","authors":"M. Vázquez-Castro","doi":"10.1109/ITWF.2015.7360764","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360764","url":null,"abstract":"Subspace coding over linear network channels assuming incoherent transmission allows independent design of channel and network codes. Joint design however would be desirable for dynamic network conditions. In this work a geometrical approach (in the Kleinian sense) to dynamic network coding is presented. The approach consists of capturing the communication process with group actions. Specifically, codes are chosen as geometries: homogeneous spaces obtained from group actions carry the information and the dynamic network code is the stabilizer of the action. The approach subsumes other approaches and provides natural adaptive encoding and decoding schemes with linear algebra tractability over different communication ambient spaces. The algebraic object called flag is proposed to encode information while the dynamic network coding is specified by its stabilizer (Borel group) showing the interplay between the flag, the channel impairing the flag and the network code stabilizing the flag. Ergodic capacity achievability is discussed.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116468027","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
Content delivery via multi-server coded caching in linear networks 在线性网络中通过多服务器编码缓存进行内容传递
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360777
S. P. Shariatpanahi, A. Motahari, B. Khalaj
{"title":"Content delivery via multi-server coded caching in linear networks","authors":"S. P. Shariatpanahi, A. Motahari, B. Khalaj","doi":"10.1109/ITWF.2015.7360777","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360777","url":null,"abstract":"We consider a content delivery network where multiple servers are connected to multiple cache-enabled clients. Clients request their corresponding contents from the servers and servers collaboratively transmit packets to fulfill all the requests. It is assumed that some contents are stored in the caches in off-peak time of the network without knowing the actual requests, the so called cache content placement phase. The goal is to minimize the worst case delay in the content delivery phase. Considering a random linear network, we propose a coding strategy which exploits servers' multiplexing gains as well as caches' global and local coding gains. The main idea in our coding scheme is to expand the number of users benefiting from a single packet by using zero-forcing techniques. This results in an increase in multi-casting gain which in turn provides faster delivery of the contents to the users. In addition, we show that our scheme is optimal for a certain regime of parameters.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126769995","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
Detection of correlated components in multivariate Gaussian models 多元高斯模型中相关成分的检测
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360768
Jun Geng, Weiyu Xu, L. Lai
{"title":"Detection of correlated components in multivariate Gaussian models","authors":"Jun Geng, Weiyu Xu, L. Lai","doi":"10.1109/ITWF.2015.7360768","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360768","url":null,"abstract":"In this paper, the problem of detecting correlated components in a p-dimensional Gaussian vector is considered. In the setup considered, s unknown components are correlated with a known covariance structure. Hence, there are equation possible hypotheses for the unknown set of correlated components. Instead of taking a full-vector observation at each time index, in this paper we assume that the observer is capable of observing any subset of components in the vector. With this flexibility in taking observations, the observer is interested in finding the optimal sampling strategy to maximize the error exponent (per sample) of the multi-hypothesis testing problem. We show that, when the correlation of these s components is weak, it is optimal for the observer to take full-vector observations; when the correlation is strong, the strategy of taking full-vector observation is not optimal anymore, and the optimal sampling strategy increases the detection error exponent by 25% at least, compared with the full-vector observation strategy.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"33 5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131489195","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
首页 上一页 下一页 尾页
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学术官方微信