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

2015 IEEE Information Theory Workshop - Fall (ITW)最新文献

筛选
英文 中文
Almost lossless analog compression without phase information - complex case 无相位信息的几乎无损模拟压缩-复杂情况
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360796
G. Tauböck, Erwin Riegler
{"title":"Almost lossless analog compression without phase information - complex case","authors":"G. Tauböck, Erwin Riegler","doi":"10.1109/ITWF.2015.7360796","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360796","url":null,"abstract":"We extend the recently proposed information-theoretic framework for phase retrieval [1] to the complex case. Specifically, we consider the problem of recovering an unknown random vector x ∈ ℂn up to an overall phase factor from ⌊Rn⌋ phaseless measurements with compression rate R and derive a general achievability bound for R. Although phase retrieval is known not to extend straightforwardly from the real to the complex case, our bound on the compression rate turns out to be conceptually similar to the one derived for real-valued signals [1]. For x being s-sparse our results imply that 2s phaseless measurements are sufficient to recover x up to an overall phase factor irrespectively of the specific distribution of x. The best known recovery threshold for deterministic complex-valued s-sparse vectors is 4s - 2 so far.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"45 22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132790863","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
Authentication for two-way relay channel with Physical-Layer Network coding 具有物理层网络编码的双向中继信道的认证
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360732
Jhordany Rodriguez Parra, T. Chan, I. Land, Siu-Wai Ho
{"title":"Authentication for two-way relay channel with Physical-Layer Network coding","authors":"Jhordany Rodriguez Parra, T. Chan, I. Land, Siu-Wai Ho","doi":"10.1109/ITWF.2015.7360732","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360732","url":null,"abstract":"Physical Layer Network coding (PLNC) can significantly improve network performance, but some security issues arise due to the limited information available to the forwarders. This paper analyses authentication in networks with PLNC and show theoretical and practical security limits. In particular, we obtain a lower bound for the probability of an attacker being able to insert a false message such that the message is believed to come from a legitimate source. We prove that an information-theoretic bound similar to the one for point-to-point communication systems can be achieved in networks employing PLNC. Necessary and sufficient conditions to achieve the bound are identified. Finally, a simple but important modification of a previous scheme is proposed to achieve the obtained bound.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115588872","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
Protograph design for spatially-coupled codes to attain an arbitrary diversity order 为实现任意分集顺序的空间耦合码设计原型机
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360752
N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis
{"title":"Protograph design for spatially-coupled codes to attain an arbitrary diversity order","authors":"N. Hassan, I. Andriyanova, M. Lentmaier, G. Fettweis","doi":"10.1109/ITWF.2015.7360752","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360752","url":null,"abstract":"This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J,K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115913211","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
Information integrity between correlated sources through Wyner-Ziv coding
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360790
Eric Graves, T. Wong
{"title":"Information integrity between correlated sources through Wyner-Ziv coding","authors":"Eric Graves, T. Wong","doi":"10.1109/ITWF.2015.7360790","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360790","url":null,"abstract":"In this paper, the problem of achieving information integrity in the classical Wyner-Ziv lossy source coding model is considered. A discrete memoryless source encodes its source sequence using the standard Wyner-Ziv coding technique and forwards the bin index to another source that employs the bin index and its own correlated sequence to decode the first source's sequence. There is an adversary who may arbitrarily modify the bin index sent to the decoder. It is assumed the adversary may base the attack on the true bin index, its own sequence (which may be correlated to both the encoder and decoder sequences) as well as the known codebook used by the sources. It is shown that a non-simulatability condition on the joint source distribution is necessary and sufficient to achieve information integrity. However, the additional requirement of information integrity may incur a penalty on the rate-distortion performance.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128569449","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
Top-K ranking: An information-theoretic perspective Top-K排名:信息论视角
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360765
Yuxin Chen, Changho Suh
{"title":"Top-K ranking: An information-theoretic perspective","authors":"Yuxin Chen, Changho Suh","doi":"10.1109/ITWF.2015.7360765","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360765","url":null,"abstract":"We develop an information-theoretic framework that explores the identifiability of top-K ranked items. The goal of the problem considered herein is to recover a consistent ordering that emphasizes the top-K ranked items, based on partially revealed preferences. Under the Bradley-Terry-Luce model that postulates a set of latent preference scores underlying all items and the odds of paired comparisons depend only on the relative scores of the items involved, we characterize the fundamental limits (up to some constant gap) on the amount of information required for reliably identifying the top-K ranked items. Here we introduce an information-theoretic notion of reliable ranking, meaning that the probability of the estimated ranking being inconsistent with the ground truth can be made arbitrarily close to zero. We single out one significant measure that plays a crucial role in determining the limits: the separation measure that quantifies the gap of preference scores between the Kth and (K + 1)th ranked items. We show that the minimum sample complexity required for reliable top-K ranking scales inversely with the separation measure.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133411979","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
Achievable rate regions for asynchronous Slepian-Wolf coding systems 异步睡眠-狼编码系统的可实现速率区域
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360786
Tetsunao Matsuta, T. Uyematsu
{"title":"Achievable rate regions for asynchronous Slepian-Wolf coding systems","authors":"Tetsunao Matsuta, T. Uyematsu","doi":"10.1109/ITWF.2015.7360786","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360786","url":null,"abstract":"The Slepian-Wolf (SW) coding system is a source coding system with two encoders and a decoder, where these encoders independently encode input sequences emitted from two correlated sources into fixed-length codewords, and the decoder reconstructs all input sequences from the codewords. In this paper, we consider the situation in which the SW coding system is asynchronous, i.e., each encoder runs with each delay from the base time. We assume that these delays are unknown to encoders and a decoder, but the maximum of delays is known to encoders and the decoder. For this asynchronous SW coding system, we clarify the achievable rate region, where the achievable rate region is the set of rate pairs of encoders such that the decoding error probability vanishes as the block length tends to infinity. Furthermore, we show an exponential bound of the error probability for this coding system by using Gallager's random coding techniques.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130575023","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
The three/two Gaussian parametric LDLC decoder 三/二高斯参数LDLC解码器
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360757
Ricardo Antonio Parrao Hernandez, B. Kurkoski
{"title":"The three/two Gaussian parametric LDLC decoder","authors":"Ricardo Antonio Parrao Hernandez, B. Kurkoski","doi":"10.1109/ITWF.2015.7360757","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360757","url":null,"abstract":"Low density lattice codes (LDLC) can be decoded efficiently using iterative decoding, and approach the capacity of the AWGN channel. In the iterative LDLC decoder the messages are Gaussian mixtures. In any implementation, the Gaussian mixtures must be approximated. This work describes a three/two Gaussian parametric LDLC decoder. Internally at the variable node the periodic Gaussian mixtures are approximated with three or two Gaussians, while the messages between nodes are single Gaussians. The proposed approximation is more accurate than the previously-proposed approximation. Numerical results shows that for moderate dimension, e.g. n = 1, 000, the two Gaussian approximation is sufficient for accurate performance. But for large dimension, e.g. n = 10, 000, three Gaussians are needed.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127790526","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}
引用次数: 3
Trellis based lower bounds on capacities of channels with synchronization errors 基于网格的同步信道容量下界
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360727
J. Castiglione, A. Kavcic
{"title":"Trellis based lower bounds on capacities of channels with synchronization errors","authors":"J. Castiglione, A. Kavcic","doi":"10.1109/ITWF.2015.7360727","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360727","url":null,"abstract":"In this paper, we model synchronization error channels as hidden Markov models. Through this model we introduce a rhomboidal trellis for calculating information rates for synchronization error channels. In particular, the introduced trellis is novel due to being synchronized with the channel input sequence, i.e., one trellis section corresponds to one channel input symbol, but (possibly) multiple channel output symbols. By further conditioning on the output sequence length, we construct a finite-length/finite-width trellis, and proceed to provide Monte Carlo methods to evaluate the information rates for Markov channel inputs of any finite order. We also demonstrate how to optimize the Markov process using a generalized Blahut-Arimoto technique to improve on the known lower bounds for the deletion channel.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121081736","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}
引用次数: 13
Locally correcting multiple bits and codes of high rate 本地校正多比特和高速率码
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360747
Liyasi Wu
{"title":"Locally correcting multiple bits and codes of high rate","authors":"Liyasi Wu","doi":"10.1109/ITWF.2015.7360747","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360747","url":null,"abstract":"Locally correctable codes are error-correcting codes that allow a single bit of the codeword to be recovered by looking up a small subset of the coordinates of the received word. In this work, we generalize the concept of traditional locally correcting to locally correcting multiple bits, and present a family of codes which allow multiple bits to be recovered with probability approaching 1 by visiting a small number of locations of the received word, even when a constant fraction of errors exist. Moreover, our codes are of high rate.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115405800","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
Exact recovery threshold in the binary censored block model 精确恢复阈值在二进制截尾块模型
2015 IEEE Information Theory Workshop - Fall (ITW) Pub Date : 2015-12-21 DOI: 10.1109/ITWF.2015.7360742
B. Hajek, Yihong Wu, Jiaming Xu
{"title":"Exact recovery threshold in the binary censored block model","authors":"B. Hajek, Yihong Wu, Jiaming Xu","doi":"10.1109/ITWF.2015.7360742","DOIUrl":"https://doi.org/10.1109/ITWF.2015.7360742","url":null,"abstract":"Given a background graph with n vertices, the binary censored block model assumes that vertices are partitioned into two clusters, and every edge is labeled independently at random with labels drawn from Bern(1 - ε) if two endpoints are in the same cluster, or from Bern(ε) otherwise, where ε E [0, 1/2] is a fixed constant. For Erdós-Rényi graphs with edge probability p = a log n/n and fixed a, we show that the semidefinite programming relaxation of the maximum likelihood estimator achieves the optimal threshold a(√1 - ε - √ε)2 > 1 for exactly recovering the partition from the labeled graph with probability tending to one as n oo. For random regular graphs with degree scaling as a log n, we show that the semidefinite programming relaxation also achieves the optimal recovery threshold aD(Bern(1/2)IIBern(ε)) > 1, where D denotes the Kullback-Leibler divergence.","PeriodicalId":281890,"journal":{"name":"2015 IEEE Information Theory Workshop - Fall (ITW)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115146544","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}
引用次数: 15
首页 上一页 下一页 尾页
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学术官方微信