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

2012 IEEE International Symposium on Information Theory Proceedings最新文献

筛选
英文 中文
An optimal sampling technique for distinguishing random S-boxes 随机s盒识别的最优抽样技术
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284680
Paul Stankovski, Martin Hell
{"title":"An optimal sampling technique for distinguishing random S-boxes","authors":"Paul Stankovski, Martin Hell","doi":"10.1109/ISIT.2012.6284680","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284680","url":null,"abstract":"The nonrandom behavior of the outputs of a random S-box can be exploited when constructing distinguishers for cryptographic primitives. Different methods of constructing samples from the outputs have been used in the literature. However, it has been unclear exactly how these methods differ and which method is optimal. We analyze four different sampling techniques. We prove that two of these sampling techniques result in dependent samples. We further show one sampling technique that is optimal in terms of error probabilities in the resulting distinguisher. However, this sampling technique is quite impractical as it requires very large storage. We further show a fourth sampling technique that is much more practical, and we prove that it is equivalent to the optimal one. We also show an improved algorithm for calculating the associated probability distributions that are required for the attack.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114607702","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
An information theoretic perspective over an extremal entropy inequality 极值熵不等式的信息论观点
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283060
Sangwoo Park, E. Serpedin, K. Qaraqe
{"title":"An information theoretic perspective over an extremal entropy inequality","authors":"Sangwoo Park, E. Serpedin, K. Qaraqe","doi":"10.1109/ISIT.2012.6283060","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283060","url":null,"abstract":"This paper focuses on developing an alternative proof for an extremal entropy inequality, originally presented in [1]. The proposed alternative proof is simply based on the classical entropy power inequality and the data processing inequality. Compared with the proofs in [1], the proposed alternative proof is simpler, more direct, and information theoretic, and presents the advantage of providing the structure of the optimal solution covariance matrix. Also, the proposed proof might also be used as a novel method to address applications such as calculation of the vector Gaussian broadcast channel capacity, establishing a lower bound for the achievable rate of distributed source coding with a single quadratic distortion constraint, and the secrecy capacity of the Gaussian wire-tap channel.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122250216","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
The sufficiency principle for decentralized data reduction 分散数据约简的充分性原则
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284199
Ge Xu, Biao Chen
{"title":"The sufficiency principle for decentralized data reduction","authors":"Ge Xu, Biao Chen","doi":"10.1109/ISIT.2012.6284199","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284199","url":null,"abstract":"This paper develops the sufficiency principle suitable for data reduction in decentralized inference systems. Both parallel and tandem networks are studied and we focus on the cases where observations at decentralized nodes are conditionally dependent. For a parallel network, through the introduction of a hidden variable that induces conditional independence among the observations, the locally sufficient statistics, defined with respect to the hidden variable, are shown to be globally sufficient for the parameter of inference interest. For a tandem network, the notion of conditional sufficiency is introduced and the related theories and tools are developed. Finally, connections between the sufficiency principle and some distributed source coding problems are explored.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129938795","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
Amplification of the hidden Gaussian channel states 隐藏高斯信道状态的放大
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284126
C. Tian
{"title":"Amplification of the hidden Gaussian channel states","authors":"C. Tian","doi":"10.1109/ISIT.2012.6284126","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284126","url":null,"abstract":"We consider the problem of amplifying the channel states in a state-dependent Gaussian channel, where the encoder knows (non-causally) a noisy version of the channel states, i.e., the channel states are hidden under the noise. We provide a complete characterization of the minimum state reconstruction distortion at the decoder under a power constraint at the encoder, and show that a simple analog scheme with power control is optimal. More precisely, if the power available to the encoder is below certain threshold, the analog scheme using full power is optimal, however when the power available to the encoder is above that threshold, analog transmission using only a fixed amount of the available power is optimal. This is in contrast to the state amplification problem considered by Sutivong et al., when the channel states are known perfectly at the encoder for which the full power is always used in the optimal scheme. The converse proof of our result relies on a channel decomposition argument which was not necessary for the simpler case when the channel states are known perfectly.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128242037","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
New classes of generalized boolean bent functions over Z4 Z4上广义布尔弯曲函数的新类
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284679
Nian Li, Xiaohu Tang, T. Helleseth
{"title":"New classes of generalized boolean bent functions over Z4","authors":"Nian Li, Xiaohu Tang, T. Helleseth","doi":"10.1109/ISIT.2012.6284679","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284679","url":null,"abstract":"New quadratic bent functions in polynomial forms are constructed in this paper. The constructions give new boolean bent and generalized boolean bent functions. Based on Z4-valued quadratic forms, a simple method provides several new constructions of generalized boolean bent functions. From these generalized boolean bent functions a method is presented to transform them into binary bent and semi-bent functions.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128672474","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
Simple schedules for half-duplex networks 半双工网络的简单调度
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283025
Siddhartha Brahma, Ayfer Özgür, C. Fragouli
{"title":"Simple schedules for half-duplex networks","authors":"Siddhartha Brahma, Ayfer Özgür, C. Fragouli","doi":"10.1109/ISIT.2012.6283025","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283025","url":null,"abstract":"We consider the diamond network where a source communicates with the destination through N non-interfering half-duplex relays. Deriving a simple approximation to the capacity of the network, we show that simple schedules having exactly two states and avoiding broadcast and multiple access communication can still achieve a significant constant fraction of the capacity of the 2 relay network, independent of the channel SNRs. The results are extended to the case of 3 relays for the special class of antisymmetric networks. We also study the structure of (approximately) optimal relaying strategies for such networks. Simulations show that these schedules have at most N + 1 states, which we conjecture to be true in general. We prove the conjecture for N = 2 and for special cases for N = 3.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129645772","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}
引用次数: 19
From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA 从Glauber动力学到Metropolis算法:最优CSMA的较小延迟
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284006
Chul-Ho Lee, Do Young Eun, Seyoung Yun, Yung Yi
{"title":"From Glauber dynamics to Metropolis algorithm: Smaller delay in optimal CSMA","authors":"Chul-Ho Lee, Do Young Eun, Seyoung Yun, Yung Yi","doi":"10.1109/ISIT.2012.6284006","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284006","url":null,"abstract":"Glauber dynamics, a method of sampling a given probability distribution via a Markov chain, has recently made considerable contribution to the MAC scheduling research, providing a tool to solve a long-standing open issue - achieving throughput-optimality with light message passing under CSMA. In this paper, we propose a way of reducing delay by studying generalized Glauber dynamics parameterized by βϵ[0, 1], ranging from Glauber dynamics (β=0) to the Metropolis algorithm (β =1). The same stationary distribution is sustained across this generalization, thus maintaining the long-term optimality. However, a different choice of β results in a significantly different second-order behavior (or variability) that has large impact on delay, which is hardly captured by the recent research focusing on delay in the large n (the number of nodes) asymptotic. We formally study such second-order behavior and its resulting delay performance, and show that larger β achieves smaller delay. Our results provide new insight into how to operate CSMA for large throughput and small delay in real, finite-sized systems.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129671969","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}
引用次数: 30
The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedback 慢衰落MIMO干扰信道的广义复用增益区域及其有限反馈的可实现性
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6284141
Sanjay Karmakar, M. Varanasi
{"title":"The generalized multiplexing gain region of the slow fading MIMO interference channel and its achievability with limited feedback","authors":"Sanjay Karmakar, M. Varanasi","doi":"10.1109/ISIT.2012.6284141","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6284141","url":null,"abstract":"The generalized multiplexing gain region (GMGR) of the slow-fading MIMO interference channel is obtained under the assumption of perfect channel state information at the transmitters (CSIT) in the general case where there are an arbitrary number of antennas at each of the four nodes. It is shown that a simple Han-Kobayashi (HK) linear Gaussian superposition coding scheme with a public/private message split at each transmitter can achieve the GMGR of the channel if the covariance matrices associated with the private and public sub-message codewords at each transmitter are certain functions of the null-space of the respective cross-link channel matrix. Moreover, in such a coding scheme, the multiplexing gains of the sub-messages can be chosen without any CSIT. Building on this result, and with Mi and Ni denoting the numbers of transmit and receive antennas at the ith transmitter and receiver, respectively, it is shown that at transmitter i an approximate version of the associated null-space expressed in terms of Nj(Mi-Nj)+ log(INRij) bits per channel realization is sufficient to achieve the perfect CSIT GMGR of the channel, where INRij is the interference-to-noise ratio at receiver j. Furthermore, under the assumption of no CSIT, the GMGR is characterized for two sub-classes of MIMO ICs.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129231519","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
Worst-case expected-rate loss of slow-fading channels 慢衰落信道的最坏情况预期速率损失
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283839
Jae Won Yoo, Tie Liu, S. Shamai
{"title":"Worst-case expected-rate loss of slow-fading channels","authors":"Jae Won Yoo, Tie Liu, S. Shamai","doi":"10.1109/ISIT.2012.6283839","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283839","url":null,"abstract":"For delay-limited communication over block-fading channels, the difference between the ergodic capacity and the maximum expected rate for coding over a finite number of coherent blocks represents the penalty incurred by the delay constraint. This paper introduces a notion of worst-case expected-rate loss. Focusing on the slow-fading scenario (one block delay), the worst-case expected-rate loss is precisely characterized for the point-to-point fading channel and is characterized to within one bit for the fading-paper channel.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593532","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
The capacity of a three-user interference channel with a cognitive transmitter in strong interference 具有认知发射机的三用户干扰信道在强干扰下的容量
2012 IEEE International Symposium on Information Theory Proceedings Pub Date : 2012-07-01 DOI: 10.1109/ISIT.2012.6283593
M. G. Kang, Wan Choi
{"title":"The capacity of a three-user interference channel with a cognitive transmitter in strong interference","authors":"M. G. Kang, Wan Choi","doi":"10.1109/ISIT.2012.6283593","DOIUrl":"https://doi.org/10.1109/ISIT.2012.6283593","url":null,"abstract":"This paper analyzes the capacity of a three-user interference channel with a cognitive transmitter which non-causally knows the messages of the other two transmitters. Especially, We derive the capacity region when all interference channel gains are strong and show that the capacity is achieved by superposition coding. From the capacity results for the specific channel conditions, we also analyze the capacity region for three-user Gaussian interference channel with a cognitive transmitter.","PeriodicalId":300161,"journal":{"name":"2012 IEEE International Symposium on Information Theory Proceedings","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130642158","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}
引用次数: 9
首页 上一页 下一页 尾页
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学术官方微信
小红书