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

2021 IEEE Information Theory Workshop (ITW)最新文献

筛选
英文 中文
Locally Recoverable Streaming Codes for Packet-Erasure Recovery 本地可恢复流码报文擦除恢复
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-07 DOI: 10.1109/ITW48936.2021.9611509
Vinayak Ramkumar, Myna Vajha, P. V. Kumar
{"title":"Locally Recoverable Streaming Codes for Packet-Erasure Recovery","authors":"Vinayak Ramkumar, Myna Vajha, P. V. Kumar","doi":"10.1109/ITW48936.2021.9611509","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611509","url":null,"abstract":"Streaming codes are a class of packet-level erasure codes that are designed with the goal of ensuring recovery in low-latency fashion, of erased packets over a communication network. It is well-known in the streaming code literature, that diagonally embedding codewords of a $[{tau}+1, {tau}+1-{a}]$ Maximum Distance Separable (MDS) code within the packet stream, leads to rate-optimal streaming codes capable of recovering from a arbitrary packet erasures, under a strict decoding delay constraint ${tau}$. Thus MDS codes are geared towards the efficient handling of the worst-case scenario corresponding to the occurrence of a erasures. In the present paper, we have an increased focus on the efficient handling of the most-frequent erasure patterns. We study streaming codes which in addition to recovering from ${a}gt 1$ arbitrary packet erasures under a decoding delay ${tau}$, have the ability to handle the more common occurrence of a single-packet erasure, while incurring smaller delay ${r}lt {tau}$. We term these codes as $({a},{tau},{r})$ locally recoverable streaming codes (LRSCs), since our single-erasure recovery requirement is similar to the requirement of locality in a coded distributed storage system. We characterize the maximum possible rate of an LRSC by presenting rate-optimal constructions for all possible parameters ${{a},{tau},{r}}$. Although the rate-optimal LRSC construction provided in this paper requires large field size, the construction is explicit. It is also shown that our (${a},{tau}={a}({r}+1)-1,{r})$ LRSC construction provides the additional guarantee of recovery from the erasure of ${h}, 1leq {h}leq {a}$, packets, with delay ${h}({r}+1)-1$. The construction thus offers graceful degradation in decoding delay with increasing number of erasures. A full version of this paper is accessible at [1].","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115243144","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
Scalar Gaussian Wiretap Channel: Bounds on the Support Size of the Secrecy-Capacity-Achieving Distribution 标量高斯窃听通道:保密容量实现分布支持大小的边界
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-03 DOI: 10.1109/ITW48936.2021.9611469
L. Barletta, Alex Dytso
{"title":"Scalar Gaussian Wiretap Channel: Bounds on the Support Size of the Secrecy-Capacity-Achieving Distribution","authors":"L. Barletta, Alex Dytso","doi":"10.1109/ITW48936.2021.9611469","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611469","url":null,"abstract":"This work studies the secrecy-capacity of a scalar-Gaussian wiretap channel with an amplitude constraint on the input. It is known that for this channel, the secrecy-capacity-achieving distribution is discrete with finitely many points. This work improves such result by showing an upper bound of the order $frac{A^{2}}{sigma_{1}^{2}}$ where A is the amplitude constraint and $sigma_{1}^{2}$ is the variance of the Gaussian noise over the legitimate channel.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"441 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120875471","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
Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder 安全源编码与侧信息在解码器和共享密钥在编码器和解码器
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-03 DOI: 10.1109/ITW48936.2021.9611508
Hamid Ghourchian, Photios A. Stavrou, T. Oechtering, M. Skoglund
{"title":"Secure Source Coding with Side-information at Decoder and Shared Key at Encoder and Decoder","authors":"Hamid Ghourchian, Photios A. Stavrou, T. Oechtering, M. Skoglund","doi":"10.1109/ITW48936.2021.9611508","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611508","url":null,"abstract":"We study the problem of rate-distortion equivocation with side-information only available at the decoder when an independent private random key is shared between the sender and the receiver. The sender compresses the sequence, and the receiver reconstructs it such that the average distortion between the source and the output is limited. The equivocation is measured at an eavesdropper that intercepts the source encoded message, utilizing side-information correlated with the source and the side-information at the decoder. We have derived the entire achievable rate-distortion-equivocation region for this problem.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123540440","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
Energy-limited Joint Source–Channel Coding via Analog Pulse Position Modulation 通过模拟脉冲位置调制的有限能量联合源信道编码
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-02 DOI: 10.1109/ITW48936.2021.9611360
O. Lev, A. Khina
{"title":"Energy-limited Joint Source–Channel Coding via Analog Pulse Position Modulation","authors":"O. Lev, A. Khina","doi":"10.1109/ITW48936.2021.9611360","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611360","url":null,"abstract":"We study the problem of transmitting a source sample with minimum distortion over an infinite-bandwidth additive white Gaussian noise channel under an energy constraint. To that end, we construct a joint source–channel coding scheme using analog pulse position modulation (PPM) and bound its quadratic distortion. We show that this scheme outperforms existing techniques since its quadratic distortion attains both the exponential and polynomial decay orders of Burnashev’s outer bound.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121819238","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
On Age of Information for Discrete Time Status Updating System With Ber/G/1/1 Queues 具有Ber/G/1/1队列的离散时间状态更新系统的信息年龄
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-01 DOI: 10.1109/ITW48936.2021.9611393
Jixiang Zhang, Yinfei Xu
{"title":"On Age of Information for Discrete Time Status Updating System With Ber/G/1/1 Queues","authors":"Jixiang Zhang, Yinfei Xu","doi":"10.1109/ITW48936.2021.9611393","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611393","url":null,"abstract":"In this paper, we consider the age of information (AoI) of a discrete time status updating system, focusing on finding the stationary AoI distribution assuming that the Ber/G/1/1 queue is used. Following the standard queueing theory, we show that by invoking a two-dimensional state vector which tracks the AoI and packet age in system simultaneously, the stationary AoI distribution can be derived by analyzing the steady state of the constituted two-dimensional stochastic process. We give the general formula of the AoI distribution and calculate the explicit expression when the service time is also geometrically distributed. The discrete and continuous AoI are compared, we depict the mean of discrete AoI and that of continuous time AoI for system with M/M/1/1 queue. Although the stationary AoI distribution of some continuous time single-server system has been determined before, in this paper, we shall prove that the standard queueing theory is still appliable to analyze the discrete AoI, which is even stronger than the proposed methods handling the continuous AoI.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116753349","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
On the Existence of the Augustin Mean 论奥古斯丁平均数的存在性
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-09-01 DOI: 10.1109/ITW48936.2021.9611513
Hao-Chung Cheng, Barış Nakiboğlu
{"title":"On the Existence of the Augustin Mean","authors":"Hao-Chung Cheng, Barış Nakiboğlu","doi":"10.1109/ITW48936.2021.9611513","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611513","url":null,"abstract":"The existence of a unique Augustin mean and its invariance under the Augustin operator are established for arbitrary input distributions with finite Augustin information for channels with countably generated output $sigma$-algebras. The existence is established by representing the conditional Rényi divergence as a lower semi-continuous and convex functional in an appropriately chosen uniformly convex space and then invoking the Banach-Saks property in conjunction with the lower semi-continuity and the convexity. A new family of operators is proposed to establish the invariance of the Augustin mean under the Augustin operator for orders greater than one. Some members of this new family strictly decrease the conditional Rényi divergence, when applied to the second argument of the divergence, unless the second argument is a fixed point of the Augustin operator.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127934755","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
Multi-strand Reconstruction from Substrings 子字符串的多链重构
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-08-26 DOI: 10.1109/ITW48936.2021.9611486
Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi
{"title":"Multi-strand Reconstruction from Substrings","authors":"Yonatan Yehezkeally, Sagi Marcovich, Eitan Yaakobi","doi":"10.1109/ITW48936.2021.9611486","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611486","url":null,"abstract":"The problem of string reconstruction based on its substrings spectrum has received significant attention recently due to its applicability to DNA data storage and sequencing. In contrast to previous works, we consider in this paper a setup of this problem where multiple strings are reconstructed together. Given a multiset S of strings, all their substrings of some fixed length $ell$, defined as the $ell$-profile of S, are received and the goal is to reconstruct all strings in S. A multi-strand $ell$-reconstruction code is a set of multisets such that every element S can be reconstructed from its $ell$-profile. Given the number of strings k and their length n, we first find a lower bound on the value of $ell$ necessary for existence of multi-strand $ell$-reconstruction codes with non-vanishing asymptotic rate. We then present two constructions of such codes and show that their rates approach 1 for values of $ell$ that asymptotically behave like the lower bound.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127933764","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
Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors 基于部分高斯循环矩阵和生成先验的鲁棒1位压缩感知
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-08-08 DOI: 10.1109/ITW48936.2021.9611397
Zhaoqiang Liu, Subhro Ghosh, J. Han, J. Scarlett
{"title":"Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priors","authors":"Zhaoqiang Liu, Subhro Ghosh, J. Han, J. Scarlett","doi":"10.1109/ITW48936.2021.9611397","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611397","url":null,"abstract":"In 1-bit compressive sensing, each measurement is quantized to a single bit, namely the sign of a linear function of an unknown vector, and the goal is to accurately recover the vector. While it is most popular to assume a standard Gaussian sensing matrix for 1-bit compressive sensing, using structured sensing matrices such as partial Gaussian circulant matrices is of significant practical importance due to their faster matrix operations. In this paper, we provide recovery guarantees for a correlation-based optimization algorithm for robust 1-bit compressive sensing with partial Gaussian circulant matrices (with random column sign flips) under a generative prior, where the signal to estimate is assumed to belong to the range of a Lipschitz continuous generative model with bounded inputs. Under suitable assumptions, we match guarantees that were previously only known to hold for i.i.d. Gaussian matrices that require significantly more computation.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126874887","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
Optimal Exponents in Cascaded Hypothesis Testing under Expected Rate Constraints 期望率约束下级联假设检验的最优指数
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-06-23 DOI: 10.1109/ITW48936.2021.9611470
Mustapha Hamad, M. Wigger, M. Sarkiss
{"title":"Optimal Exponents in Cascaded Hypothesis Testing under Expected Rate Constraints","authors":"Mustapha Hamad, M. Wigger, M. Sarkiss","doi":"10.1109/ITW48936.2021.9611470","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611470","url":null,"abstract":"Cascaded binary hypothesis testing is studied in this paper with two decision centers at the relay and the receiver. All terminals have their own observations, where we assume that the observations at the transmitter, the relay, and the receiver form a Markov chain in this order. The communication occurs over two hops, from the transmitter to the relay, and from the relay to the receiver. Expected rate constraints are imposed on both communication links. In this work, we characterize the optimal type-II error exponents at the two decision centers under constraints on the allowed type-I error probabilities. Our recent work characterized the optimal type-II error exponents in the special case when the two decision centers have same type-I error constraints and provided an achievability scheme for the general setup. To obtain the exact characterization for the general case, in this paper we provide a new converse proof as well as a new matching achievability scheme. Our results indicate that under unequal type-I error constraints at the relay and the receiver, a tradeoff arises between the maximum type-II error probabilities at these two terminals. Previous results showed that such a tradeoff does not exist under equal type-I error constraints or under general type-I error constraints when a maximum rate constraint is imposed on the communication links.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133965992","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
Realizing GANs via a Tunable Loss Function 通过可调损失函数实现gan
2021 IEEE Information Theory Workshop (ITW) Pub Date : 2021-06-09 DOI: 10.1109/ITW48936.2021.9611499
Gowtham R. Kurri, Tyler Sypherd, L. Sankar
{"title":"Realizing GANs via a Tunable Loss Function","authors":"Gowtham R. Kurri, Tyler Sypherd, L. Sankar","doi":"10.1109/ITW48936.2021.9611499","DOIUrl":"https://doi.org/10.1109/ITW48936.2021.9611499","url":null,"abstract":"We introduce a tunable GAN, called $alpha$-GAN, parameterized by $alphain$(0, $infty$], which interpolates between various f-GANs and Integral Probability Metric based GANs (under constrained discriminator set). We construct $alpha-$ GAN using a supervised loss function, namely, $alpha-$ loss, which is a tunable loss function capturing several canonical losses. We show that $alpha-$ GAN is intimately related to the Arimoto divergence, which was first proposed by Österriecher (1996), and later studied by Liese and Vajda (2006). We posit that the holistic understanding that $alpha-$ GAN introduces will have practical benefits of addressing both the issues of vanishing gradients and mode collapses.","PeriodicalId":325229,"journal":{"name":"2021 IEEE Information Theory Workshop (ITW)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121084141","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
首页 上一页
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学术官方微信