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

2016 IEEE International Symposium on Information Theory (ISIT)最新文献

筛选
英文 中文
An unconventional clustering problem: User Service Profile Optimization 一个非常规的集群问题:用户服务配置文件优化
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541420
Fabio D’Andreagiovanni, G. Caire
{"title":"An unconventional clustering problem: User Service Profile Optimization","authors":"Fabio D’Andreagiovanni, G. Caire","doi":"10.1109/ISIT.2016.7541420","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541420","url":null,"abstract":"We consider the problem of clustering N users into K groups such that users in the same group are assigned a common service profile over M commodities. The profile of each group k sets for each commodity m the maximum of the service quality that users in the k-th group are willing to pay. The objective is to find the clustering that maximizes the total service user quality, which corresponds to the revenue of the service provider. This Service Profile Optimization Problem (SPOP) emerges in various applications, as for example the bit-loading in Hybrid Fiber Coax data distribution systems. We propose a Mixed Integer Linear Programming (MILP) model for the problem, that allows to use state-of-the-art MILP solvers as the core tool in an original powerful heuristic. We show complexity and performance gains with respect to previously proposed methods and a direct application of a state of the art MILP solver.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"262 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131995860","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
Asynchronous decentralized algorithms for the noisy 20 questions problem 噪声20题问题的异步分散算法
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541789
Theodoros Tsiligkaridis
{"title":"Asynchronous decentralized algorithms for the noisy 20 questions problem","authors":"Theodoros Tsiligkaridis","doi":"10.1109/ISIT.2016.7541789","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541789","url":null,"abstract":"This paper studies the problem of adaptively searching for an unknown target using multiple agents connected through a time-varying network topology. Agents are equipped with sensors capable of fast information processing, and we propose an asynchronous decentralized algorithm for controlling their search based on noisy observations. We propose asynchronous decentralized algorithms for adaptive query-based search that combine the Bayesian bisection method and social learning. Under standard assumptions on the time-varying network dynamics, we prove convergence to correct consensus on the value of the parameter as the number of iterations grow. Our results establish that stability and consistency can be maintained even with one-way updating and randomized pairwise averaging, thus providing a scalable low complexity alternative to the synchronous decentralized estimation algorithms studied in previous works. We illustrate the effectiveness and robustness of our algorithm for random network topologies.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133039048","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
Fixed-length compression for letter-based fidelity measures in the finite blocklength regime 有限块长度下基于字母的保真度测量的定长压缩
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541734
L. Palzer, R. Timo
{"title":"Fixed-length compression for letter-based fidelity measures in the finite blocklength regime","authors":"L. Palzer, R. Timo","doi":"10.1109/ISIT.2016.7541734","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541734","url":null,"abstract":"This paper studies fixed-length compression with multiple constraints in the finite blocklength regime. We introduce two different average distortion measures and consider constraints for individual source outcomes. The concept of d-tilted information as well as recent finite-length bounds for the optimal coding rates are extended to this setting. We further particularise our results to the binary memoryless source and a sparse Gaussian source.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124049106","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
Degrees of freedom of MIMO Y channel with multiple relays 具有多个继电器的MIMO Y通道的自由度
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541509
Tian Ding, Xiaojun Yuan, S. Liew
{"title":"Degrees of freedom of MIMO Y channel with multiple relays","authors":"Tian Ding, Xiaojun Yuan, S. Liew","doi":"10.1109/ISIT.2016.7541509","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541509","url":null,"abstract":"We study the degrees of freedom (DoF) of a symmetric multi-relay multiple-input multiple-output (MIMO) Y channel, where three users, each equipped with M antennas, exchange messages via multiple geographically separated relay nodes, each with N antennas. We formulate a general DoF achievability problem assuming the use of linear precoding and post-processing. To solve this problem, we present a new uplink-downlink asymmetric strategy where the user precoders are designed for signal alignment and the user post-processors are used for interference neutralization. Based on that, we derive an achievable DoF of the considered model for an arbitrary antenna setup. The optimality of the derived DoF is established under certain antenna configurations. Also, we show that our design considerably outperforms the conventional uplink-downlink symmetric design.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124923370","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
Crossing the KS threshold in the stochastic block model with information theory 基于信息论的随机块模型中KS阈值的跨越
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541417
E. Abbe, Colin Sandon
{"title":"Crossing the KS threshold in the stochastic block model with information theory","authors":"E. Abbe, Colin Sandon","doi":"10.1109/ISIT.2016.7541417","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541417","url":null,"abstract":"Decelle et al. conjectured that community detection in the symmetric stochastic block model has a computational threshold given by the so-called Kesten-Stigum (KS) threshold, and that information-theoretic methods can cross this threshold for a large enough number of communities (4 or 5 depending on the regime of the parameters). This paper shows that at k = 5, it is possible to cross the KS threshold in the disassortative regime with a non-efficient algorithm that samples a clustering having typical cluster volumes. Further, the gap between the KS and information-theoretic threshold is shown to be large in some cases. In the case where edges are drawn only across clusters with an average degree of b, and denoting by k the number of communities, the KS threshold reads b ≳ k2 whereas our information-theoretic bound reads b ≳ k ln(k).","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122837303","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}
引用次数: 12
The capacity of discrete-time Gaussian MIMO channels with periodic characteristics 具有周期特性的离散时间高斯MIMO信道容量
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-11 DOI: 10.1109/ISIT.2016.7541461
Nir Shlezinger, R. Dabora
{"title":"The capacity of discrete-time Gaussian MIMO channels with periodic characteristics","authors":"Nir Shlezinger, R. Dabora","doi":"10.1109/ISIT.2016.7541461","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541461","url":null,"abstract":"In many communications scenarios the channel exhibits periodic characteristics. Periodicity may be expressed as a periodically time-varying channel transfer function as well as an additive noise with periodically time-varying statistics. Examples for such scenarios include interference-limited communications, both wireless and wireline, and also power line communications (PLC). In this work, we characterize the capacity of discrete-time, finite-memory Gaussian multiple-input multiple-output (MIMO) channels with periodic characteristics. The derivation transforms the periodic MIMO channel into an extended time-invariant MIMO channel, for which we obtain a closed-form capacity expression. It is shown that capacity can be achieved by an appropriate waterfilling scheme. The capacity expression obtained is numerically evaluated for practical PLC scenarios, and compared to the achievable rate of an ad-hoc orthogonal frequency division multiplexing based scheme, and the gains from optimally handling the periodicity of the channel are quantified.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"625 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132054297","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
On the energy benefit of compute-and-forward for multiple unicasts 多台单播的计算转发的能源效益
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-08-10 DOI: 10.1109/ISIT.2016.7541716
Zhijie Ren, J. Goseling, J. Weber, M. Gastpar
{"title":"On the energy benefit of compute-and-forward for multiple unicasts","authors":"Zhijie Ren, J. Goseling, J. Weber, M. Gastpar","doi":"10.1109/ISIT.2016.7541716","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541716","url":null,"abstract":"Compute-and-forward (CF) is a technique which exploits broadcast and superposition in wireless networks. In this paper, the CF energy benefit is studied for networks with unicast sessions and modeled by connected graphs. This benefit is defined as the ratio of the minimum energy consumption by traditional routing techniques, not using broadcast and superposition features, and the corresponding CF consumption. It is shown to be upper bounded by min(d̅, K, 12√K), where d̅ and K are the average hop-count distance and the number of sessions, respectively. Also, it can be concluded that the energy benefit of network coding (NC) is also upper bounded by the same value, which is a new scaling law of the energy benefit for NC as a function of K.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131089898","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
Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds 多量子假设检验表达式和经典量子信道逆界
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-26 DOI: 10.1109/ISIT.2016.7541820
G. Vazquez-Vilar
{"title":"Multiple quantum hypothesis testing expressions and classical-quantum channel converse bounds","authors":"G. Vazquez-Vilar","doi":"10.1109/ISIT.2016.7541820","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541820","url":null,"abstract":"Alternative exact expressions are derived for the minimum error probability of a hypothesis test discriminating among M quantum states. The first expression corresponds to the error probability of a binary hypothesis test with certain parameters; the second involves the optimization of a given information-spectrum measure. Particularized in the classical-quantum channel coding setting, this characterization implies the tightness of two existing converse bounds; one derived by Matthews and Wehner using hypothesis-testing, and one obtained by Hayashi and Nagaoka via an information-spectrum approach.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"37 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114138386","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
Bounds on the reliability of a typewriter channel 打字机通道可靠性的界限
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-18 DOI: 10.1109/ISIT.2016.7541592
M. Dalai, Yury Polyanskiy
{"title":"Bounds on the reliability of a typewriter channel","authors":"M. Dalai, Yury Polyanskiy","doi":"10.1109/ISIT.2016.7541592","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541592","url":null,"abstract":"We give new bounds on the reliability function of a typewriter channel with 5 inputs and crossover probability 1/2. The lower bound is more of theoretical than practical importance; it improves very marginally the expurgated bound, providing a counterexample to a conjecture on its tightness by Shannon, Gallager and Berlekamp which does not need the construction of algebraic-geometric codes previously used by Katsman, Tsfasman and Vlăduţ. The upper bound is derived by using an adaptation of the linear programming bound and it is essentially useful as a low-rate anchor for the straight line bound.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123989578","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
Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery 改进的擦除列表解码使用依赖于字母的列表恢复本地可修复的代码
2016 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2016-07-10 DOI: 10.1109/ISIT.2016.7541565
A. Zeh, A. Wachter-Zeh
{"title":"Improved erasure list decoding locally repairable codes using alphabet-dependent list recovery","authors":"A. Zeh, A. Wachter-Zeh","doi":"10.1109/ISIT.2016.7541565","DOIUrl":"https://doi.org/10.1109/ISIT.2016.7541565","url":null,"abstract":"New optimal constructions of locally repairable codes over small fields and their polynomial-time erasure list decoding are considered. Our code constructions are based on generalized code concatenation and give optimal binary codes with locality r = 2; 3. The impact of alphabet-dependent list recovery for alternant codes when applied to erasure list decoding of our constructed binary locally repairable codes is analyzed.","PeriodicalId":198767,"journal":{"name":"2016 IEEE International Symposium on Information Theory (ISIT)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115391181","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
首页 上一页 下一页 尾页
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学术官方微信