2022 IEEE International Symposium on Information Theory (ISIT)最新文献_第4页

Capacity-Achieving Constrained Codes with GC-Content and Runlength Limits for DNA Storage 具有gc含量和运行长度限制的DNA存储容量受限代码

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834494

Yajuan Liu, Xuan He, Xiaohu Tang

引用次数: 5

PCR, Tropical Arithmetic, and Group Testing 聚合酶链反应，热带算术，和组检验

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834718

Hsin-Po Wang, Ryan Gabrys, A. Vardy

引用次数: 1

Group Testing with Geometric Ranges 几何范围的群检验

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834574

Benjamin Aram Berendsohn, L. Kozma

{"title":"Group Testing with Geometric Ranges","authors":"Benjamin Aram Berendsohn, L. Kozma","doi":"10.1109/ISIT50566.2022.9834574","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834574","url":null,"abstract":"Group testing is a well-studied approach for identifying t defective items in a set X of m items, by testing appropriately chosen subsets of X. In classical group testing any subset of X can be tested, and for $t in {mathcal{O}}(1)$ the optimal number of (non-adaptive) tests is known to be Θ(logm).In this work we consider a novel geometric setting for group testing, where the items are points in Euclidean space and the tests are axis-parallel boxes (hyperrectangles), corresponding to the scenario where tests are defined by parameter-ranges (say, according to physical measurements). We present upper and lower bounds on the required number of tests in this setting, observing that in contrast to the unrestricted, combinatorial case, the bounds are polynomial in m. For instance, we show that with two parameters, identifying a defective pair of items requires Ω(m3/5) tests, and there exist configurations for which ${mathcal{O}}left({{m^{2/3}}}right)$ tests are sufficient, whereas to identify a single defective item Θ(m1/2) tests are always necessary and sometimes sufficient. Perhaps most interestingly, our work brings to the study of group testing a set of techniques from extremal combinatorics.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124538043","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

Capacity of the Shotgun Sequencing Channel 霰弹枪序列通道的容量

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834409

Aditya Narayan Ravi, Alireza Vahid, Ilan Shomorony

引用次数: 0

Learning neural codes for perceptual uncertainty 学习感知不确定性的神经编码

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834606

M. Salmasi, M. Sahani

{"title":"Learning neural codes for perceptual uncertainty","authors":"M. Salmasi, M. Sahani","doi":"10.1109/ISIT50566.2022.9834606","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834606","url":null,"abstract":"Perception is an inferential process, in which the state of the immediate environment must be estimated from sensory input. Inference in the face of noise and ambiguity requires reasoning with uncertainty, and much animal behaviour appears close to Bayes optimal. This observation has inspired hypotheses for how the activity of neurons in the brain might represent the distributional beliefs necessary to implement explicit Bayesian computation. While previous work has focused on the sufficiency of these hypothesised codes for computation, relatively little consideration has been given to optimality in the representation itself. Here, we adopt an encoder-decoder approach to study representational optimisation within one hypothesised belief encoding framework: the distributed distributional code (DDC). We consider a setting in which typical belief distribution functions take the form of a sparse combination of an underlying set of basis functions, and the corresponding DDC signals are corrupted by neural variability. We estimate the conditional entropy over beliefs induced by these DDC signals using an appropriate decoder. Like other hypothesised frameworks, a DDC representation of a belief depends on a set of fixed encoding functions that are usually set arbitrarily. Our approach allows us to seek the encoding functions that minimise the decoder conditional entropy and thus optimise representational accuracy in an information theoretic sense. We apply the approach to show how optimal encoding properties may adapt to represent beliefs in new environments, relating the results to experimentally reported neural responses.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"301 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114583776","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 Information-Debt-Optimal Streaming Codes With Small Memory 小内存下信息债务最优流码研究

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834842

Vinayak Ramkumar, M. Krishnan, Myna Vajha, P. V. Kumar

{"title":"On Information-Debt-Optimal Streaming Codes With Small Memory","authors":"Vinayak Ramkumar, M. Krishnan, Myna Vajha, P. V. Kumar","doi":"10.1109/ISIT50566.2022.9834842","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834842","url":null,"abstract":"In the context of an (n,k,m) convolutional code where k is the number of message symbols, n the number of code symbols and m the memory, Martinian [1] introduced the concept of information debt whose value at time t is the number of additional coded symbols needed to decode all prior message symbols. The same paper shows the existence of (n,k,m) convolutional codes that can recover all prior message symbols whenever the symbol-erasure pattern is such that the maximum time interval τ between successive returns to zero of the information debt function is at most m. The parameter τ also represents the worst-case delay in decoding a message symbol. In the present paper, we study (n,k,m) convolutional codes that possess the analogous property for the case τ > m whenever it is possible to do so. We will refer to such codes as information-debt-optimal streaming (iDOS) codes. We prove the existence of periodically time-varying iDOS codes for all possible {n,k,m,τ} parameters. We also show that m-MDS codes and Maximum Distance Profile convolutional codes are iDOS codes for certain parameter ranges. As a by-product of our existence result, the minimum memory needed for a particular class of streaming codes studied earlier in the literature, is determined.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114653299","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

Interpreting Deep-Learned Error-Correcting Codes 解释深度学习纠错码

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834599

N. Devroye, N. Mohammadi, A. Mulgund, H. Naik, R. Shekhar, Gyoergy Turan, Y. Wei, M. Žefran

引用次数: 6

Fundamental Limits of Personalized Federated Linear Regression with Data Heterogeneity 具有数据异质性的个性化联邦线性回归的基本限制

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834894

Chun-Ying Hou, I-Hsiang Wang

引用次数: 0

On the Ranking Recovery from Noisy Observations up to a Distortion 从噪声观测到失真程度的排序恢复

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834780

Minoh Jeong, Martina Cardone, Alex Dytso

引用次数: 0

Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner Basis 通过计算Gröbner基实现椭圆码的代数追码

2022 IEEE International Symposium on Information Theory (ISIT) Pub Date : 2022-06-26 DOI: 10.1109/ISIT50566.2022.9834889

Wan, Li Chen, Fangguo Zhang

{"title":"Algebraic Chase Decoding of Elliptic Codes Through Computing the Gröbner Basis","authors":"Wan, Li Chen, Fangguo Zhang","doi":"10.1109/ISIT50566.2022.9834889","DOIUrl":"https://doi.org/10.1109/ISIT50566.2022.9834889","url":null,"abstract":"This paper proposes two interpolation-based algebraic Chase decoding for elliptic codes. It is introduced from the perspective of computing the Gröbner basis of the interpolation module, for which two Chase interpolation approaches are utilized. They are Kötter’s interpolation and the basis reduction (BR) interpolation. By identifying η unreliable symbols, 2η decoding test-vectors are formulated, and the corresponding interpolation modules can be defined. The re-encoding further helps transform the test-vectors, facilitating the two interpolation techniques. In particular, Kötter’s interpolation is performed for the common elements of the test-vectors, producing an intermediate outcome that is shared by the decoding of all test-vectors. The desired Gröbner bases w.r.t. all test-vectors can be obtained in a binary tree growing fashion, leading to a low complexity but its decoding latency cannot be contained. In contrast, the BR interpolation first performs the common computation in basis construction which is shared by all interpolation modules, and then conducts the module basis construction and reduction for all test-vectors in parallel. It results in a significantly lower decoding latency. Finally, simulation results are also presented to demonstrate the effectiveness of the proposed Chase decoding.","PeriodicalId":348168,"journal":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129807707","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