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

筛选
英文 中文
Computation of the random coding secrecy exponent for a constant composition ensemble 常数组合系随机编码保密指数的计算
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-08-09 DOI: 10.1109/ISIT.2017.8006822
Y. Jitsumatsu
{"title":"Computation of the random coding secrecy exponent for a constant composition ensemble","authors":"Y. Jitsumatsu","doi":"10.1109/ISIT.2017.8006822","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006822","url":null,"abstract":"Recently, Parizi, Telatar, and Merhav [1] determined the exact random coding secrecy exponents for a wiretap channel. In this study, we focus on the computation of such secrecy exponents. To obtain the exact random coding secrecy exponent for a constant composition random coding ensemble, optimization with respect to two stochastic matrices must be performed. Parizi et al. suggested that inner optimization is a convex optimization problem and therefore can be solved efficiently and that the outer optimization is not guaranteed to have convex structure and is solved by an exhaustive search. In this paper, we develop an efficient computation of the exact random coding secrecy exponent.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"705 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133464232","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
On additive channels with generalized Gaussian noise 具有广义高斯噪声的加性信道
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-08-09 DOI: 10.1109/ISIT.2017.8006563
Alex Dytso, R. Bustin, H. Poor, S. Shamai
{"title":"On additive channels with generalized Gaussian noise","authors":"Alex Dytso, R. Bustin, H. Poor, S. Shamai","doi":"10.1109/ISIT.2017.8006563","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006563","url":null,"abstract":"This paper considers a problem of communication over an additive noise channel where the noise is distributed according to a Generalized Gaussian (GG) distribution. In the first part of the paper, a number of properties of the family of GG distributions are derived which are of independent interest. For example, considerable attention is given to the properties of the characteristic function of the GG distribution. In the second part of the paper, the capacity of an additive noise channel with GG noise is considered under p-th absolute moment constraints. It is shown that, even though Shannon's upper bound is achievable in some instances, in general such achievability is not possible. Moreover, it is shown that discrete inputs can achieve capacity within a constant gap or full degree of freedom for any p-th absolute moment constraint. Following the seminal work of Smith, the paper also gives a condition under which discrete inputs are exactly optimal.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124665706","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}
引用次数: 19
Arimoto-Rényi conditional entropy and Bayesian hypothesis testing 条件熵与贝叶斯假设检验
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-08-09 DOI: 10.1109/ISIT.2017.8007073
I. Sason, S. Verdú
{"title":"Arimoto-Rényi conditional entropy and Bayesian hypothesis testing","authors":"I. Sason, S. Verdú","doi":"10.1109/ISIT.2017.8007073","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8007073","url":null,"abstract":"This paper gives upper and lower bounds on the minimum error probability of Bayesian M-ary hypothesis testing in terms of the Arimoto-Rényi conditional entropy of an arbitrary order α. The improved tightness of these bounds over their specialized versions with the Shannon conditional entropy (α = 1) is demonstrated. In particular, in the case where M is finite, we show how to generalize Fano's inequality under both the conventional and list-decision settings. As a counterpart to the generalized Fano's inequality, allowing M to be infinite, a lower bound on the Arimoto-Rényi conditional entropy is derived as a function of the minimum error probability. Explicit upper and lower bounds on the minimum error probability are obtained as a function of the Arimoto-Rényi conditional entropy.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131055325","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
Semidefinite programming converse bounds for classical communication over quantum channels 量子信道经典通信的半定规划逆界
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-08-09 DOI: 10.1109/ISIT.2017.8006825
Xin Wang, Wei Xie, R. Duan
{"title":"Semidefinite programming converse bounds for classical communication over quantum channels","authors":"Xin Wang, Wei Xie, R. Duan","doi":"10.1109/ISIT.2017.8006825","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006825","url":null,"abstract":"We study the classical communication over quantum channels when assisted by no-signalling (NS) and PPT-preserving (PPT) codes. We first show that both the optimal success probability of a given transmission rate and one-shot ∊-error capacity can be formalized as semidefinite programs (SDPs) when assisted by NS or NS∩PPT codes. Based on this, we derive SDP finite blocklength converse bounds for general quantum channels, which also reduce to the converse bound of Polyanskiy, Poor, and Verdii for classical channels. Furthermore, we derive an SDP strong converse bound for the classical capacity of a general quantum channel: for any code with a rate exceeding this bound, the optimal success probability vanishes exponentially fast as the number of channel uses increases. In particular, applying our efficiently computable bound, we derive improved upper bounds to the classical capacity of the amplitude damping channels and also establish the strong converse property for a new class of quantum channels.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126929410","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
Noise and uncertainty in string-duplication systems 字符串复制系统中的噪声和不确定性
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8007104
Siddhartha Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck
{"title":"Noise and uncertainty in string-duplication systems","authors":"Siddhartha Jain, Farzad Farnoud, Moshe Schwartz, Jehoshua Bruck","doi":"10.1109/ISIT.2017.8007104","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8007104","url":null,"abstract":"Duplication mutations play a critical role in the generation of biological sequences. Simultaneously, they have a deleterious effect on data stored using in-vivo DNA data storage. While duplications have been studied both as a sequence-generation mechanism and in the context of error correction, for simplicity these studies have not taken into account the presence of other types of mutations. In this work, we consider the capacity of duplication mutations in the presence of point-mutation noise, and so quantify the generation power of these mutations. We show that if the number of point mutations is vanishingly small compared to the number of duplication mutations of a constant length, the generation capacity of these mutations is zero. However, if the number of point mutations increases to a constant fraction of the number of duplications, then the capacity is nonzero. Lower and upper bounds for this capacity are also presented. Another problem that we study is concerned with the mismatch between code design and channel in data storage in the DNA of living organisms with respect to duplication mutations. In this context, we consider the uncertainty of such a mismatched coding scheme measured as the maximum number of input codewords that can lead to the same output.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121061798","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}
引用次数: 14
A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory 对数凹型随机变量微分熵的下界及其在率失真理论中的应用
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8006487
Arnaud Marsiglietti, V. Kostina
{"title":"A lower bound on the differential entropy for log-concave random variables with applications to rate-distortion theory","authors":"Arnaud Marsiglietti, V. Kostina","doi":"10.1109/ISIT.2017.8006487","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006487","url":null,"abstract":"We derive a lower bound on the differential entropy for symmetric log-concave random variable X in terms of the p-th absolute moment of X, which shows that entropy and p-th absolute moment of a symmetric log-concave random variable are comparable. We apply our bound to study the rate distortion function under distortion measure |x − x| for sources that follow a log-concave probability distribution. In particular, we establish that the difference between the rate distortion function and the Shannon lower bound is at most log(√2e) ≈ 1.9 bits, independently of r and the target distortion d. For mean-square error distortion, the difference is at most log √πe ≈ 1.55 bits, regardless of d. Our results generalize to the case of vector X. Our proof technique leverages tools from convex geometry.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126109205","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
Index mapping for bit-error resilient multiple description lattice vector quantizer 误差弹性多重描述点阵矢量量化器的索引映射
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8006997
S. Dumitrescu, Yifang Chen, Jun Chen
{"title":"Index mapping for bit-error resilient multiple description lattice vector quantizer","authors":"S. Dumitrescu, Yifang Chen, Jun Chen","doi":"10.1109/ISIT.2017.8006997","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006997","url":null,"abstract":"This work addresses the construction of bit-error resilient multiple description lattice vector quantizers (MDLVQ) by proposing the design of a structured mapping γ of side lattice points to binary indexes. We assume that the first description is correct while the second description may carry bit errors. To design the mapping γ the set of side lattice points is first partitioned into Voronoi regions of an appropriate coarse lattice. Next a good channel code C is selected, each Voronoi region is assigned a coset of this channel code and the side lattice points within each Voronoi region are mapped to binary sequences in the corresponding coset. We derive a lower bound on the error correction performance of the mapping γ in terms of the performance of the code C and we show that, as the rate of the MDLVQ grows to i, the mapping γ becomes as good as the code C. Simulation results show the significant superiority of the proposed mapping versus random mappings.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127055162","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
Compute-forward multiple access (CFMA) with nested LDPC codes 具有嵌套LDPC码的计算前向多址(CFMA)
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8007067
Erixhen Sula, Jingge Zhu, A. Pastore, S. Lim, M. Gastpar
{"title":"Compute-forward multiple access (CFMA) with nested LDPC codes","authors":"Erixhen Sula, Jingge Zhu, A. Pastore, S. Lim, M. Gastpar","doi":"10.1109/ISIT.2017.8007067","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8007067","url":null,"abstract":"Inspired by the compute-and-forward scheme from Nazer and Gastpar, a novel multiple-access scheme introduced by Zhu and Gastpar makes use of nested lattice codes and sequential decoding of linear combinations of codewords to recover the individual messages. This strategy, coined compute-forward multiple access (CFMA), provably achieves points on the dominant face of the multiple-access capacity region while circumventing the need of time sharing or rate splitting. For a two-user multiple-access channel (MAC), we propose a practical procedure to design suitable codes from off-the-shelf LDPC codes and present a sequential belief propagation decoder with complexity comparable with that of point-to-point decoders. We demonstrate the potential of our strategy by comparing several numerical evaluations with theoretical limits.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"188 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122972399","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}
引用次数: 9
Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control 基于arq的拥塞控制对跨长延迟瓶颈的编码隧道的约束
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8006532
U. Speidel, S. Puchinger, M. Bossert
{"title":"Constraints for coded tunnels across long latency bottlenecks with ARQ-based congestion control","authors":"U. Speidel, S. Puchinger, M. Bossert","doi":"10.1109/ISIT.2017.8006532","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006532","url":null,"abstract":"This paper considers capacity and delay constraints for coded tunnels across an erasure channel which occurs on shared Internet satellite links. Such links are long latency bottlenecks with a limited memory input queue which drops packets when it overflows. The latency delays ARQ ACK feedback to senders, making it difficult for them to tune their packet transmission rate. This can cause the input queue to oscillate between empty and overflow. Queue oscillation leaves the link underutilised during the empty phases and slows down large packet flows. Channel coding can in principle provide goodput improvement in this scenario by letting senders accelerate to higher packet rates before burst losses occur and by mitigating exponential backoff after losses. However, this is only possible if the codes preserve sufficient spare channel transmission rate for the improved goodput to expand into. We formulate rate and delay constraints that such block codes must meet. Using loss data obtained on a purpose-built simulator network, we show that such coding is feasible in a practical scenario and that partial unit memory (PUM) codes are particularly suitable for this task. In this context, we propose a part-systematic encoding for PUM codes, which performs slightly better than non-systematic encoding.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125095042","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
Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength 有限块长度下半确定性窃听信道的保密可靠性权衡
2017 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2017-06-25 DOI: 10.1109/ISIT.2017.8006906
Wei Yang, R. Schaefer, H. V. Poor
{"title":"Secrecy-reliability tradeoff for semi-deterministic wiretap channels at finite Blocklength","authors":"Wei Yang, R. Schaefer, H. V. Poor","doi":"10.1109/ISIT.2017.8006906","DOIUrl":"https://doi.org/10.1109/ISIT.2017.8006906","url":null,"abstract":"This paper studies the maximum secrecy rate for a semi-deterministic wiretap channel, in which the channel between the transmitter and the legitimate receiver is deterministic, while that between the transmitter and the eavesdropper is a discrete memoryless channel. For a given decoding error probability and information leakage (measured by the total variation distance), the optimal second-order secrecy rate is derived. Unlike the secrecy capacity, the second-order secrecy rate characterizes the optimal tradeoff between secrecy and reliability at finite blocklength.","PeriodicalId":287557,"journal":{"name":"2017 IEEE International Symposium on Information Theory (ISIT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134061165","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学术文献互助群
群 号:604180095
Book学术官方微信
小红书