2015 IEEE Information Theory Workshop (ITW)最新文献_第9页

Subset-universal lossy compression 子集通用有损压缩

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-11-03 DOI: 10.1109/ITW.2015.7133146

Or Ordentlich, O. Shayevitz

引用次数: 0

Achievable and converse bounds over a general channel and general decoding metric 在一般信道和一般解码度量上的可达界和逆界

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-11-02 DOI: 10.1109/ITW.2015.7133137

Nir Elkayam, M. Feder

引用次数: 6

Capacity region continuity of the compound broadcast channel with confidential messages 包含机密信息的复合广播信道的容量区域连续性

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-11-02 DOI: 10.1109/ITW.2015.7133119

Andrea Grigorescu, H. Boche, R. Schaefer, H. Poor

引用次数: 3

Refined upper bounds on stopping redundancy of binary linear codes 改进了二进制线性码停止冗余的上界

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-10-31 DOI: 10.1109/ITW.2015.7133087

Yauhen Yakimenka, Vitaly Skachek

引用次数: 3

Codes for DNA storage channels DNA存储通道的代码

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-10-31 DOI: 10.1109/ITW.2015.7133132

H. M. Kiah, Gregory J. Puleo, O. Milenkovic

引用次数: 20

Non-adaptive group testing with inhibitors 非适应性组抑制剂试验

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-10-30 DOI: 10.1109/ITW.2015.7133108

A. Ganesan, S. Jaggi, Venkatesh Saligrama

引用次数: 10

The approximate optimality of simple schedules for half-duplex multi-relay networks 半双工多中继网络中简单调度的近似最优性

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-10-27 DOI: 10.1109/ITW.2015.7133090

Martina Cardone, Daniela Tuninetti, R. Knopp

{"title":"The approximate optimality of simple schedules for half-duplex multi-relay networks","authors":"Martina Cardone, Daniela Tuninetti, R. Knopp","doi":"10.1109/ITW.2015.7133090","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133090","url":null,"abstract":"In ISIT2012 Brahma, Özgür and Fragouli conjectured that in a half-duplex diamond relay network (a Gaussian noise network without a direct source-destination link and with N non-interfering relays) an approximately optimal relay scheduling (achieving the cut-set upper bound to within a constant gap uniformly over all channel gains) exists with at most N + 1 active states (only N + 1 out of the 2N possible relay listen-transmit configurations have a strictly positive probability). Such relay scheduling policies are said to be simple. In ITW2013 we conjectured that simple relay policies are optimal for any half-duplex Gaussian multi-relay network, that is, simple schedules are not a consequence of the diamond network's sparse topology. In this paper we formally prove the conjecture beyond Gaussian networks. In particular, for any memoryless half-duplex N-relay network for which the cut-set bound is approximately optimal to within a constant gap under some conditions (satisfied for example by Gaussian networks), an optimal schedule exists with at most N + 1 active states. The key step of our proof is to write the minimum of a submodular function by means of its Lovász extension and use the greedy algorithm for submodular polyhedra to highlight structural properties of the optimal solution. This, together with the saddle-point property of min-max problems and the existence of optimal basic feasible solutions in linear programs, proves the claim.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134276621","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

Polar coding for the general wiretap channel 一般窃听信道的极性编码

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-10-14 DOI: 10.1109/ITW.2015.7133080

Yi-Peng Wei, S. Ulukus

引用次数: 34

Conditioning and covariance on caterpillars 毛虫的条件作用和协方差

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-07-16 DOI: 10.1109/ITW.2015.7133115

Sarah R. Allen, R. O'Donnell

引用次数: 5

Capacity of Binary State Symmetric Channel with and without feedback and transmission cost 有无反馈的二进制状态对称信道容量与传输代价

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2014-01-31 DOI: 10.1109/ITW.2015.7133133

C. Kourtellaris, C. Charalambous

引用次数: 16