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

The Gaussian Interference Channel with lack of codebook knowledge at one receiver: Symmetric capacity to within a gap with a PAM input 在一个接收器上缺乏码本知识的高斯干扰信道:与PAM输入的间隙内的对称容量

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-24 DOI: 10.1109/ITW.2015.7133097

Alex Dytso, Daniela Tuninetti, N. Devroye

{"title":"The Gaussian Interference Channel with lack of codebook knowledge at one receiver: Symmetric capacity to within a gap with a PAM input","authors":"Alex Dytso, Daniela Tuninetti, N. Devroye","doi":"10.1109/ITW.2015.7133097","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133097","url":null,"abstract":"The study of the two-user Gaussian Interference Channel (IC) where one receiver lacks knowledge of the interfering codebook, also dubbed the IC with an oblivious receiver (IC-OR), is motivated by: (1) in heterogeneous, cognitive, distributed or dynamic networks, assuming that every node posses codebooks of every other node may not be practical, and (2) it is not clear whether and how much lack of codebook knowledge would affect the Han and Kobayashi (HK) achievable scheme, which involves joint decoding of intended and interfering messages and which appears not possible if nodes do not possess all codebooks. To address these issues, we evaluate a simplified HK (where the oblivious receiver treats interference as noise) with mixed inputs at the non-oblivious transmitter, i.e., a mixture of discrete and Gaussian random variables, where the power split between the two and the number of points of the discrete part are carefully chosen as a function of the channel parameters. The oblivious transmitter uses a purely Gaussian input. Surprisingly, for this choice of inputs, the capacity region of the symmetric Gaussian IC-OR is shown to be within 1 over 2 log (12πe) ≈ 3.34 bits of the best known outer bound for the classical Gaussian IC with full codebook knowledge at both receivers. Interestingly, this shows that a simplified HK where one receiver is restricted to treat interference as noise loses at most 1 over 2 log (12πe) ≈ 3.34 bits in performance. Moreover, the discrete part of the input behaves like a “common message” even though it is not jointly decoded (together with the intended messages) at the oblivious receiver.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130096283","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

Can feedback increase the capacity of the energy harvesting channel? 反馈能增加能量收集通道的容量吗?

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-06-05 DOI: 10.1109/ITW.2015.7133161

Dor Shaviv, Ayfer Özgür, H. Permuter

引用次数: 11

Coordinating partially-informed agents over state-dependent networks 在依赖状态的网络上协调部分知情的代理

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-26 DOI: 10.1109/ITW.2015.7133152

Benjamin Larrousse, S. Lasaulce, M. Wigger

引用次数: 19

New directions in information theoretic security: Benefits of bidirectional signaling 信息安全理论的新方向:双向信令的好处

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133165

A. Yener

{"title":"New directions in information theoretic security: Benefits of bidirectional signaling","authors":"A. Yener","doi":"10.1109/ITW.2015.7133165","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133165","url":null,"abstract":"The past decade has witnessed significant effort towards establishing reliable and information theoretically secure rates in communication networks, taking advantage of the properties of the communication medium. Such efforts include those in the wireless medium where simultaneous transmissions and the ensuing interference can prove advantageous from an information theoretic secrecy point of view. With the goal of obtaining a secrecy rate that scales with transmit power, structured signaling with simultaneous favorable signal alignment at the legitimate receiver(s) and unfavorable signal alignment at the eavesdropper(s) has proven particularly useful in multi-terminal Gaussian channels. Many challenges remain however in realizing the vision of absolute security provided by the wireless physical layer including handling more realistic models. In this paper, we provide a brief overview of the state of the art, the forward look and argue for an additional asset that could be utilized for secrecy, i.e., bidirectional signaling. Taking the bidirectional wiretap channel as an example, Gaussian signaling is demonstrated to be as good as structured signaling from the degrees of freedom point of view, while observed to be performing better with finite transmit power. Moreover, taking bidirectional signals explicitly into account for encoding performs even better and provides a way forward to synergistically combine physical layer based secrecy and encryption.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123090323","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 the (1, ∞)-RLL input-constrained erasure channel with feedback 带反馈的(1，∞)-RLL输入约束擦除信道的容量

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133107

Oron Sabag, H. Permuter, N. Kashyap

引用次数: 2

WOM codes with uninformed encoder WOM编码与未知编码器

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133105

M. Horovitz, Eitan Yaakobi

{"title":"WOM codes with uninformed encoder","authors":"M. Horovitz, Eitan Yaakobi","doi":"10.1109/ITW.2015.7133105","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133105","url":null,"abstract":"Write-once memory (WOM) is a storage device consisting of q-ary cells that can only increase their value. A WOM code is a coding scheme which allows one to write multiple times to the WOM without decreasing the levels of the cells. In the conventional model of WOM, it is assumed that the encoder can read the memory state before encoding, while the decoder reads only the memory state after encoding, but not before that. However, there are three more models in this setup. We follow an earlier work by Wolf et al. who studied the capacity results of all possible four models in which the encoder/decoder is or is not informed with the previous state of the memory before encoding, respectively. The two challenging models we study here assume that the encoder is uninformed with the memory state (that is, the encoder cannot read the memory prior to encoding). We show that if the decoder is also uninformed with the memory state before encoding, then codes in the Z channel provide constructions for the binary case, and codes correcting non-binary asymmetric errors are used for non-binary codes. In case the decoder is informed with the previous state, then erasure-correcting codes are invoked in the binary case, and codes in the Manhattan distance are used for the non-binary case.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128964835","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

One-to-one lossless codes in the variable input-length regime: Back to Kraft's inequality 可变输入长度体制下的一对一无损码:回到卡夫不等式

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133101

M. Weinberger

引用次数: 0

Exponential rates of convergence for waiting times and generalized AEP 等待时间和广义AEP的指数收敛率

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133104

Ayush Jain, R. Bansal

引用次数: 0

Information-theory-friendly models for fiber-optic channels: A primer 光纤通道的信息理论友好模型:入门

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133157

E. Agrell, G. Durisi, P. Johannisson

引用次数: 23

Combinatorial channels from partially ordered sets 部分有序集的组合通道

2015 IEEE Information Theory Workshop (ITW) Pub Date : 2015-04-01 DOI: 10.1109/ITW.2015.7133160

Daniel Cullina, N. Kiyavash

{"title":"Combinatorial channels from partially ordered sets","authors":"Daniel Cullina, N. Kiyavash","doi":"10.1109/ITW.2015.7133160","DOIUrl":"https://doi.org/10.1109/ITW.2015.7133160","url":null,"abstract":"A combinatorial channel specifies a set of possible channel outputs for each channel input. A ranked partially ordered set, or ranked poset, gives us a notion of up errors and down errors. This allows us to define a variety of combinatorial channels. There is a family of channels that have the rank-n elements of the poset as the input, and introduce s total errors, each performing a different mixture of up errors and down errors. If a ranked poset has the “parallelogram property,” the family of channels all have the same confusion graph and thus the same codes. Furthermore, there is a natural metric on each rank of the poset. In the common confusion graph of the channel, vertices are adjacent if and only if their distance in this metric is at most 2s. Although all of the channels in the family have the same set of codes, each channel corresponds to a different integer linear program that characterizes the set of codes. Because each integer linear program has a different fractional relaxation, each leads to a different sphere-packing upper bound for the codes. We take advantage of this phenomenon by optimizing across the family of channels to obtain the best bound. This formulation includes many of classical error models, including erasures and substitutions in q-ary vectors, Hamming errors in constant weight binary codes, insertions and deletions in q-ary strings, the error model of subspace codes, the natural error model for compositions, and various errors models for permutations.","PeriodicalId":174797,"journal":{"name":"2015 IEEE Information Theory Workshop (ITW)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123510366","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