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

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

筛选
英文 中文
On the capacity of multihop device-to-device caching networks 关于多跳设备对设备缓存网络的容量
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133093
Sang-Woon Jeon, Songnam Hong, Mingyue Ji, G. Caire
{"title":"On the capacity of multihop device-to-device caching networks","authors":"Sang-Woon Jeon, Songnam Hong, Mingyue Ji, G. Caire","doi":"10.1109/ITW.2015.7133093","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133093","url":null,"abstract":"We consider a wireless device-to-device (D2D) network where n nodes are uniformly distributed at random over the network area. We let each node with storage capacity M cache files from a library of size m. Each node in the network requests a file from the library independently at random, according to a popularity distribution, and is served by other nodes having the requested file in their local cache via (possibly) multihop transmissions. Under the classical “protocol model” of wireless networks, we characterize the optimal per-node capacity scaling law for a broad class of heavy-tailed popularity distributions including the Zipf distribution with Zipf exponent less than one. Surprisingly, in the parameter regimes of interest, we show that decentralized random caching uniformly across the library yields optimal per-node capacity scaling of Θ(√M/m), which outperforms the single-hop caching networks whose capacity scales as Θ (M/m) [1], [2].","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"53 71 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":"114602452","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
Cyclic codes and algebraic immunity of Boolean functions 循环码与布尔函数的代数免疫
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133110
Sihem Mesnager, G. Cohen
{"title":"Cyclic codes and algebraic immunity of Boolean functions","authors":"Sihem Mesnager, G. Cohen","doi":"10.1109/ITW.2015.7133110","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133110","url":null,"abstract":"Since 2003, algebraic attacks have received a lot of attention in the cryptography literature. In this context, algebraic immunity quantifies the resistance of a Boolean function to the standard algebraic attack of the pseudo-random generators using it as a nonlinear Boolean function. A high value of algebraic immunity is now an absolutely necessary cryptographic criterion for a resistance to algebraic attacks but is not sufficient, because of more general kinds of attacks so-called Fast Algebraic Attacks. In view of these attacks, the study of the set of annihilators of a Boolean function has become very important. We show that studying the annihilators of a Boolean function can be translated into studying the codewords of a linear code. We then explain how to exploit that connection to evaluate or estimate the algebraic immunity of a cryptographic function. Direct links between the theory of annihilators used in algebraic attacks and coding theory are established using an atypical univariate approach.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"22 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":"115342380","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
Gaussian joint source-channel coding for the strong interference channel 强干扰信道的高斯联合信源信道编码
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133109
Iñaki Estella Aguerri, Deniz Gündüz
{"title":"Gaussian joint source-channel coding for the strong interference channel","authors":"Iñaki Estella Aguerri, Deniz Gündüz","doi":"10.1109/ITW.2015.7133109","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133109","url":null,"abstract":"Transmission of correlated Gaussian sources over a Gaussian interference channel is studied. Each terminal has one source available, which has to be reconstructed at the corresponding destination with the minimum average distortion. Focusing on the strong interference setting, we first derive necessary conditions on the achievable distortion pairs. Then, focusing on the symmetric scenario, we present achievable distortion pairs considering several transmission strategies. We compare the achievable distortion by the proposed schemes with the lower bound. In particular, we consider separate source and channel coding, uncoded transmission, a vector quantization (VQ) scheme which uses the quantization codewords as channel inputs, and finally a superposition of two quantization codewords. We show that the VQ scheme is optimal in the high SNR regime. We also show that the proposed superposition scheme performs very close to the lower bound in certain regimes.","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":"131002783","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
Throughput scaling for random hybrid wireless networks with physical-layer network coding 具有物理层网络编码的随机混合无线网络的吞吐量扩展
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133091
Yunyan Chang, S. Stańczak, Chan Zhou
{"title":"Throughput scaling for random hybrid wireless networks with physical-layer network coding","authors":"Yunyan Chang, S. Stańczak, Chan Zhou","doi":"10.1109/ITW.2015.7133091","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133091","url":null,"abstract":"With an increasing demand in user experience and service quality, there is a strong need for a massively enhanced throughput of current wireless networks. It has been shown that the capacity of a random ad hoc network does not scale well with the growing number of nodes [1]. This paper considers a random hybrid wireless network, in which nodes access the wireless channel in an uncoordinated manner to transfer their messages to a network of base stations interconnected by high-rate wired communication links. Moreover, physical-layer network coding (PLNC) is used to harness the interference, which presents the main performance bottleneck in wireless systems. Assuming a random hybrid network, we analyze the impact of PLNC on the throughput scaling. We show that each node can achieve a higher throughput that scales sublinearly or linearly with the number of base stations. This is in fact a significant improvement when compared to previous studies in which the impact of adding base stations on the network throughput is insignificant whenever the number of base stations grows slower than some threshold.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"68 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":"114842579","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 complexity and randomness of Markov-chain prediction 马尔可夫链预测的复杂性和随机性
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133078
Joel Ratsaby
{"title":"On complexity and randomness of Markov-chain prediction","authors":"Joel Ratsaby","doi":"10.1109/ITW.2015.7133078","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133078","url":null,"abstract":"Let {X<sub>t</sub> : t ∈ ℤ} be a sequence of binary random variables generated by a stationary Markov source of order k*. Let β be the probability of the event “X<sub>t</sub> = 1”. Consider a learner based on a Markov model of order k, where k may be different from k*, who trains on a sample sequence X<sup>(m)</sup> which is randomly drawn by the source. Test the learner's performance by asking it to predict the bits of a test sequence X<sup>(n)</sup> (generated by the source). An error occurs at time t if the prediction Y<sub>t</sub> differs from the true bit value X<sub>t</sub>, 1 ≤ t ≤ n. Denote by Ξ<sup>(n)</sup> the sequence of errors where the error bit Ξ<sub>t</sub> at time t equals 1 or 0 according to whether an error occurred or not, respectively. Consider the subsequence Ξ<sup>(ν)</sup> of Ξ<sup>(n)</sup> which corresponds to the errors made when predicting a 0, that is, Ξ<sup>(ν)</sup> consists of those bits Ξ<sub>t</sub> at times t where Y<sub>t</sub> = 0: In this paper we compute an upper bound on the absolute deviation between the frequency of 1 in Ξ<sup>(ν)</sup> and β. The bound has an explicit dependence on k, k*, m, ν, n. It shows that the larger k, or the larger the difference k - k*, the less random that Ξ<sup>(ν)</sup> can become.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"17 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":"127535240","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
Asymptotic distance properties of protograph-based spatially coupled LDPC codes over GF(q) GF(q)上基于原型的空间耦合LDPC码的渐近距离特性
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133099
Kechao Huang, David G. M. Mitchell, Xiao Ma, D. Costello
{"title":"Asymptotic distance properties of protograph-based spatially coupled LDPC codes over GF(q)","authors":"Kechao Huang, David G. M. Mitchell, Xiao Ma, D. Costello","doi":"10.1109/ITW.2015.7133099","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133099","url":null,"abstract":"In this paper, asymptotic methods are used to form lower and upper bounds on the typical free distance growth rate of ensembles of periodically time-varying protograph-based spatially coupled low-density parity-check (SC-LDPC) codes over GF(q). By evaluating and comparing these bounds, we find that the typical free distance of q-ary SC-LDPC codes increases linearly with constraint length and that the bounds coincide for a sufficiently large period. In particular, we show that the free distance to constraint length ratio of (3, 6)-regular q-ary SC-LDPC code ensembles exceeds the minimum distance to block length ratio of an underlying q-ary LDPC block code (LDPC-BC) ensemble. We also show that, similar to the minimum distance growth rate of the (3, 6)-regular q-ary LDPC-BC ensemble, the free distance growth rate of (3, 6)-regular q-ary SC-LDPC code ensembles increases with the field size q up to a certain point, and then it decreases as q increases further.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"14 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":"127939279","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
Capacity of deterministic, half-duplex, line networks with two sources 具有两个信号源的确定性半双工线路网络的容量
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133168
G. Kramer
{"title":"Capacity of deterministic, half-duplex, line networks with two sources","authors":"G. Kramer","doi":"10.1109/ITW.2015.7133168","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133168","url":null,"abstract":"The capacity region of deterministic, half-duplex, line networks with two sources is established. Capacity is achieved with superposition coding. The main novelty is the converse proof for which a property of optimal codes is identified, namely that the symbol input to the node immediately after the second source node may as well identify the latter node's output symbol.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"139 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":"127916495","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
Broadcast channels with cooperation: Capacity and duality for the semi-deterministic case 合作广播频道:半确定性情况下的容量和对偶性
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133095
Ziv Goldfeld, H. Permuter, G. Kramer
{"title":"Broadcast channels with cooperation: Capacity and duality for the semi-deterministic case","authors":"Ziv Goldfeld, H. Permuter, G. Kramer","doi":"10.1109/ITW.2015.7133095","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133095","url":null,"abstract":"The semi-deterministic (SD) broadcast channel (BC) where the decoders cooperate via a one-sided link is considered and its capacity region is derived. The direct proof relies on an achievable region for the general BC that is tight for the SD scenario. This achievable region follows by a coding scheme that combines rate-splitting and binning with Marton and superposition coding. The SD-BC is shown to be operationally equivalent to a class of relay-BCs (RBCs) and the correspondence between their capacity regions is established. Furthermore, a dual source coding problem, referred to as the Wyner-Ahlswede-Körner (WAK) problem with one-sided encoder cooperation, is proposed. Transformation principles between the problems are presented and the optimal rate region for the AK problem is stated. The SD-BC capacity and the admissible region of the AK problem are shown to be dual to one another in the sense that the information measures defining the corner points of both regions coincide. Special cases of the two problems are inspected and shown to maintain duality.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"26 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":"116745633","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
Non-asymptotic covering lemmas 非渐近覆盖引理
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133173
S. Verdú
{"title":"Non-asymptotic covering lemmas","authors":"S. Verdú","doi":"10.1109/ITW.2015.7133173","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133173","url":null,"abstract":"In information theory, the packing and covering lemmas are conventionally used in conjunction with the typical sequence approach in order to prove the asymptotic achievability results for discrete memoryless systems. In contrast, the single-shot approach in information theory provides non-asymptotic achievability and converse results, which are useful to gauge the backoff from the asymptotic fundamental limits due to fixed blocklength, and which do not rely on discrete/memoryless assumptions. This paper reviews the non-asymptotic covering lemmas we have obtained recently and their application in single-user and multiuser information theory.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"475 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":"123760171","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}
引用次数: 6
Cross-packing lattices for the Rician fading channel 典型衰落信道的交叉填充格
2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-25 DOI: 10.1109/ITW.2015.7133084
A. Sakzad, Anna-Lena Horlemann-Trautmann, E. Viterbo
{"title":"Cross-packing lattices for the Rician fading channel","authors":"A. Sakzad, Anna-Lena Horlemann-Trautmann, E. Viterbo","doi":"10.1109/ITW.2015.7133084","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133084","url":null,"abstract":"We introduce cross-packing lattices for Rician fading channels, motivated by a geometric interpretation stemming from the pairwise error probability analysis. We approximate the star bodies arising from the pairwise error probability analysis with n-dimensional crosses of radius t, consisting of 2nt + 1 unit cubes, for some positive integer t. We give a construction for a family of cross-packing lattices for all dimensions and any minimum cross distance 2t + 1. We show by simulations how our new cross-packing lattices perform compared to other known lattices over the Rician fading channel, for different values of the Rician K-factor.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"158 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":"131061867","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：604180095
Book学术官方微信