2010 IEEE Information Theory Workshop最新文献

筛选
英文 中文
On optimum communication cost for joint compression and dispersive information routing 联合压缩和分散信息路由的最优通信代价
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592794
Kumar Viswanatha, E. Akyol, K. Rose
{"title":"On optimum communication cost for joint compression and dispersive information routing","authors":"Kumar Viswanatha, E. Akyol, K. Rose","doi":"10.1109/CIG.2010.5592794","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592794","url":null,"abstract":"In this paper, we consider the problem of minimum cost joint compression and routing for networks with multiple-sinks and correlated sources. We introduce a routing paradigm, called dispersive information routing, wherein the intermediate nodes are allowed to forward a subset of the received bits on subsequent paths. This paradigm opens up a rich class of research problems which focus on the interplay between encoding and routing in a network. What makes it particularly interesting is the challenge in encoding sources such that, exactly the required information is routed to each sink, to reconstruct the sources they are interested in. We demonstrate using simple examples that our approach offers better asymptotic performance than conventional routing techniques. We also introduce a variant of the well known random binning technique, called ‘power binning’, to encode and decode sources that are dispersively transmitted, and which asymptotically achieves the minimum communication cost within this routing paradigm.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"384 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122091489","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
Reduced-state decoding in two-way relay networks with physical-layer network coding 具有物理层网络编码的双向中继网络中的减少状态解码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592782
D. To, Jinho Choi
{"title":"Reduced-state decoding in two-way relay networks with physical-layer network coding","authors":"D. To, Jinho Choi","doi":"10.1109/CIG.2010.5592782","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592782","url":null,"abstract":"We consider the information exchange between two source nodes with the help of a relay node in a two-way relay network (TWRN). Based on physical-layer network coding (PNC), at the relay node, Viterbi or BCJR algorithms based on a full-state trellis can be used for decoding. Since the relay node only needs to decode XORed message rather than two individual messages in PNC, we show that the decoding can be performed using a reduced-state trellis which results in a lower complexity. It is proved that if the source nodes use identical encoders, based on the reduced-state trellis, the diversity order is kept unchanged, which is then confirmed by simulation results.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117252889","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
Multi-source operator channels: Efficient capacity-achieving codes 多源运营商信道:高效的容量实现码
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592812
Hongyi Yao, Theodoros K. Dikaliotis, S. Jaggi, T. Ho
{"title":"Multi-source operator channels: Efficient capacity-achieving codes","authors":"Hongyi Yao, Theodoros K. Dikaliotis, S. Jaggi, T. Ho","doi":"10.1109/CIG.2010.5592812","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592812","url":null,"abstract":"The network communication scenario where one or more receivers request all the information transmitted by different sources is considered. We introduce the first polynomial-time (in network size) network codes that achieve any point inside the rate-region for the problem of multiple-source multicast in the presence of malicious errors, for any fixed number of sources. Our codes are fully distributed and different sources require no knowledge of the data transmitted by their peers. Our codes are “end-to-end”, that is, all nodes apart from the sources and the receivers are oblivious to the adversaries present in the network and simply implement random linear network coding.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123409125","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
Recent results on bent and hyper-bent functions and their link with some exponential sums 弯曲和超弯曲函数的最新结果及其与指数和的联系
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592914
Sihem Mesnager
{"title":"Recent results on bent and hyper-bent functions and their link with some exponential sums","authors":"Sihem Mesnager","doi":"10.1109/CIG.2010.5592914","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592914","url":null,"abstract":"Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, but also because of their relations to coding theory (Reed-Muller codes) and applications in cryptography (design of stream ciphers), they have attracted a lot of research, specially in the last 15 years. The class of bent functions contains a subclass of functions, introduced by Youssef and Gong in 2001, the so-called hyper-bent functions whose properties are still stronger and whose elements are still rarer than bent functions. Bent and hyper-bent functions are not classified. A complete classification of these functions is elusive and looks hopeless. So, it is important to design constructions in order to know as many of (hyper)-bent functions as possible. This paper is devoted to the constructions of bent and hyper-bent Boolean functions in polynomial forms. We survey and present an overview of the constructions discovered recently. We extensively investigate the link between the bentness property of such functions and some exponential sums (involving Dickson polynomials).","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133827150","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
Cooperative strategies for relay-aided multi-cell wireless networks with backhaul 回程中继辅助多小区无线网络的协作策略
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592704
Jinfeng Du, Ming Xiao, M. Skoglund
{"title":"Cooperative strategies for relay-aided multi-cell wireless networks with backhaul","authors":"Jinfeng Du, Ming Xiao, M. Skoglund","doi":"10.1109/CIG.2010.5592704","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592704","url":null,"abstract":"We investigate cooperative strategies for relay-aided multi-source multi-destination wireless networks with backhaul support. Each source multicasts information to all destinations using a shared relay. We study cooperative strategies based on different network coding (NC) schemes, namely, finite field NC (FNC), linear NC (LNC), and lattice coding. To further exploit the backhaul connection, we also propose NC-based beam-forming (NBF). We measure the performance in term of achievable rates over Gaussian channels and observe significant gains over a benchmark scheme. The benefit of using backhaul is also clearly demonstrated in most of scenarios.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121748268","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}
引用次数: 5
On the secure outage performance for wireless multicasting through slow fading channels 慢衰落信道无线多播安全中断性能研究
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592764
Md. Zahurul I. Sarkar, T. Ratnarajah
{"title":"On the secure outage performance for wireless multicasting through slow fading channels","authors":"Md. Zahurul I. Sarkar, T. Ratnarajah","doi":"10.1109/CIG.2010.5592764","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592764","url":null,"abstract":"In the group-oriented applications such as military and commercial wireless cellular networks often require the same data to be conveyed to multiple users simultaneously. This technique is usually referred to as physical layer multicasting. In this paper, we are interested in protecting these data from eavesdropping. Here, we consider the transmission of confidential data through slow fading channels in the presence of single as well as multiple eavesdroppers. We define the perfect secrecy multicast mutual information in terms of secure outage probability for three different scenarios of secure wireless multicasting and provide a complete characterization of the maximum transmission rate at which the eavesdropper/eavesdroppers is/are unable to decode any information. We also present the average secrecy mutual information for multicasting in the presence of multiple eavesdroppers.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134415484","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
Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane 双曲平面正则平铺上的量子擦除纠错码与渗透
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592863
Nicolas Delfosse, G. Zémor
{"title":"Quantum erasure-correcting codes and percolation on regular tilings of the hyperbolic plane","authors":"Nicolas Delfosse, G. Zémor","doi":"10.1109/CIG.2010.5592863","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592863","url":null,"abstract":"We are interested in percolation for a family of self-dual tilings of the hyperbolic plane. We achieve an upper bound on the critical probability for these tilings by taking appropriate finite quotients and associating them with a family of quantum CSS codes. We then relate the probability of percolation to the probability of a decoding error for these codes on the quantum erasure channel.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"95 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127097865","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}
引用次数: 22
On the deterministic multicast capacity of bidirectional relay networks 双向中继网络的确定性组播容量研究
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592749
M. Mokhtar, Y. Mohasseb, M. Nafie, H. E. Gamal
{"title":"On the deterministic multicast capacity of bidirectional relay networks","authors":"M. Mokhtar, Y. Mohasseb, M. Nafie, H. E. Gamal","doi":"10.1109/CIG.2010.5592749","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592749","url":null,"abstract":"In this paper, we completely characterize the deterministic multicast capacity region of the symmetric two-pair bidirectional half duplex relay network with private messages. Towards this end, we first develop a new upper bound on the deterministic capacity region, based on the notion of a one-sided genie. We then proceed to construct novel detour schemes that achieve the upper bound by routing the bits intended for a certain receiver through the network rather than sending it directly. To the best of the authors' knowledge, this scenario corresponds to one of the rare cases where coding, across levels and time, is needed to achieve the deterministic capacity of the network.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125101186","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}
引用次数: 20
Fading channels with 1-bit output quantization: Optimal modulation, ergodic capacity and outage probability 1位输出量化的衰落信道:最优调制、遍历容量和中断概率
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592653
S. Krone, G. Fettweis
{"title":"Fading channels with 1-bit output quantization: Optimal modulation, ergodic capacity and outage probability","authors":"S. Krone, G. Fettweis","doi":"10.1109/CIG.2010.5592653","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592653","url":null,"abstract":"The achievable rate of communications systems depends on the quantization resolution at the receiver. Earlier work has shown that the capacity of real-valued AWGN channels with 1-bit output quantization is achieved with BPSK. This paper studies optimal modulation schemes, the ergodic capacity and the outage probability for complex-valued fading channels with 1-bit output quantization, assuming full channel knowledge at the receiver. It is shown that circular symmetry with at most one amplitude per phase is a necessary condition for optimal modulation. Circular-symmetric PSK achieves the ergodic capacity in case of Rayleigh fading. Considering the outage probability for Rayleigh fading, L-PSK with large L shows the best performance among conventional modulation schemes.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130833084","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}
引用次数: 47
Tail-biting products trellises, the BCJR-construction and their duals 咬尾产品格架、bcjr结构及其双联
2010 IEEE Information Theory Workshop Pub Date : 2010-09-30 DOI: 10.1109/CIG.2010.5592710
H. Gluesing-Luerssen, Elizabeth A. Weaver
{"title":"Tail-biting products trellises, the BCJR-construction and their duals","authors":"H. Gluesing-Luerssen, Elizabeth A. Weaver","doi":"10.1109/CIG.2010.5592710","DOIUrl":"https://doi.org/10.1109/CIG.2010.5592710","url":null,"abstract":"We consider the constructions of tail-biting trellises for linear codes introduced by Koetter/Vardy [6] and Nori/Shankar [12]. We will show that each one-to-one product trellis can be merged to a BCJR-trellis defined in a slightly stronger sense than in [12] and that each trellis that originates from the characteristic matrix defined in [6] is a BCJR-trellis. Furthermore, BCJR-trellises are always nonmergeable. Finally, we will consider a certain duality conjecture of Koetter/Vardy and show that it holds true for minimal trellises.","PeriodicalId":354925,"journal":{"name":"2010 IEEE Information Theory Workshop","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2010-09-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115402712","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
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学术官方微信