Pub Date : 2024-10-25DOI: 10.1109/TIT.2024.3477754
{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2024.3477754","DOIUrl":"https://doi.org/10.1109/TIT.2024.3477754","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10736190","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517944","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-10-25DOI: 10.1109/TIT.2024.3477756
{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2024.3477756","DOIUrl":"https://doi.org/10.1109/TIT.2024.3477756","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2024-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10736189","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517749","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-25DOI: 10.1109/TIT.2024.3466566
Paul Mansanarez;Guillaume Poly;Yvik Swan
We investigate the properties of the entropy of a probability measure along the heat flow and more precisely we seek for closed algebraic representations of its derivatives. Provided that the measure admits moments of any order, it has been proved in Guo et al. (2010) that this functional is smooth, and in Ledoux (2016) that its derivatives at zero can be expressed into multivariate polynomials evaluated in the moments (or cumulants) of the underlying measure. Moreover, these algebraic expressions are derived through $Gamma $ -calculus techniques which provide implicit recursive formulas for these polynomials. Our main contribution consists in a fine combinatorial analysis of these inductive relations and for the first time to derive closed formulas for the leading coefficients of these polynomials expressions. Building upon these explicit formulas we revisit the so-called “MMSE conjecture” from Ledoux (2016) which asserts that two distributions on the real line with the same entropy along the heat flow must coincide up to translation and symmetry. Our approach enables us to provide new conditions on the source distributions ensuring that the MMSE conjecture holds and to refine several criteria proved in Ledoux (2016). As illustrating examples, our findings cover the cases of uniform and Rademacher distributions, for which previous results in the literature were inapplicable.
{"title":"Derivatives of Entropy and the MMSE Conjecture","authors":"Paul Mansanarez;Guillaume Poly;Yvik Swan","doi":"10.1109/TIT.2024.3466566","DOIUrl":"https://doi.org/10.1109/TIT.2024.3466566","url":null,"abstract":"We investigate the properties of the entropy of a probability measure along the heat flow and more precisely we seek for closed algebraic representations of its derivatives. Provided that the measure admits moments of any order, it has been proved in Guo et al. (2010) that this functional is smooth, and in Ledoux (2016) that its derivatives at zero can be expressed into multivariate polynomials evaluated in the moments (or cumulants) of the underlying measure. Moreover, these algebraic expressions are derived through \u0000<inline-formula> <tex-math>$Gamma $ </tex-math></inline-formula>\u0000-calculus techniques which provide implicit recursive formulas for these polynomials. Our main contribution consists in a fine combinatorial analysis of these inductive relations and for the first time to derive closed formulas for the leading coefficients of these polynomials expressions. Building upon these explicit formulas we revisit the so-called “MMSE conjecture” from Ledoux (2016) which asserts that two distributions on the real line with the same entropy along the heat flow must coincide up to translation and symmetry. Our approach enables us to provide new conditions on the source distributions ensuring that the MMSE conjecture holds and to refine several criteria proved in Ledoux (2016). As illustrating examples, our findings cover the cases of uniform and Rademacher distributions, for which previous results in the literature were inapplicable.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"7647-7663"},"PeriodicalIF":2.2,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518123","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-25DOI: 10.1109/TIT.2024.3464586
Lin Zhou;Qianyun Wang;Jingjing Wang;Lin Bai;Alfred O. Hero
We revisit the problem of statistical sequence matching between two databases of sequences initiated by Unnikrishnan, (2015) and derive theoretical performance guarantees for the generalized likelihood ratio test (GLRT). We first consider the case where the number of matched pairs of sequences between the databases is known. In this case, the task is to accurately find the matched pairs of sequences among all possible matches between the sequences in the two databases. We analyze the performance of the GLRT by Unnikrishnan and explicitly characterize the tradeoff between the mismatch and false reject probabilities under each hypothesis in both large and small deviations regimes. Furthermore, we demonstrate the optimality of Unnikrishnan’s GLRT test under the generalized Neyman-Person criterion for both regimes and illustrate our theoretical results via numerical examples. Subsequently, we generalize our achievability analyses to the case where the number of matched pairs is unknown, and an additional error probability needs to be considered. When one of the two databases contains a single sequence, the problem of statistical sequence matching specializes to the problem of multiple classification introduced by Gutman, (1989). For this special case, our result for the small deviations regime strengthens previous result of Zhou et al., (2020) by removing unnecessary conditions on the generating distributions.
{"title":"Large and Small Deviations for Statistical Sequence Matching","authors":"Lin Zhou;Qianyun Wang;Jingjing Wang;Lin Bai;Alfred O. Hero","doi":"10.1109/TIT.2024.3464586","DOIUrl":"https://doi.org/10.1109/TIT.2024.3464586","url":null,"abstract":"We revisit the problem of statistical sequence matching between two databases of sequences initiated by Unnikrishnan, (2015) and derive theoretical performance guarantees for the generalized likelihood ratio test (GLRT). We first consider the case where the number of matched pairs of sequences between the databases is known. In this case, the task is to accurately find the matched pairs of sequences among all possible matches between the sequences in the two databases. We analyze the performance of the GLRT by Unnikrishnan and explicitly characterize the tradeoff between the mismatch and false reject probabilities under each hypothesis in both large and small deviations regimes. Furthermore, we demonstrate the optimality of Unnikrishnan’s GLRT test under the generalized Neyman-Person criterion for both regimes and illustrate our theoretical results via numerical examples. Subsequently, we generalize our achievability analyses to the case where the number of matched pairs is unknown, and an additional error probability needs to be considered. When one of the two databases contains a single sequence, the problem of statistical sequence matching specializes to the problem of multiple classification introduced by Gutman, (1989). For this special case, our result for the small deviations regime strengthens previous result of Zhou et al., (2020) by removing unnecessary conditions on the generating distributions.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"7532-7562"},"PeriodicalIF":2.2,"publicationDate":"2024-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-24DOI: 10.1109/TIT.2024.3467123
Chaofeng Guan;Jingjie Lv;Gaojun Luo;Zhi Ma
This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive $[n,3.5,n-t]_{4}$ codes for all t with variable n, except for $t=6,7,12$ .
本文旨在构建非整数维的最优四元加法码。首先，我们提出了四元加法恒重码的组合构造，以及加法广义反码构造。随后，我们提出了广义构造 X，它有助于从线性码构造非整数维最优加法码。然后，我们通过这两种方法构建了十类最优四元非整数维加法码。作为应用，我们还确定了除 $t=6,7,12$ 外，所有 t 的可变 n 的最优加法码 $[n,3.5,n-t]_{4}$ 。
{"title":"Combinatorial Constructions of Optimal Quaternary Additive Codes","authors":"Chaofeng Guan;Jingjie Lv;Gaojun Luo;Zhi Ma","doi":"10.1109/TIT.2024.3467123","DOIUrl":"https://doi.org/10.1109/TIT.2024.3467123","url":null,"abstract":"This paper aims to construct optimal quaternary additive codes with non-integer dimensions. Firstly, we propose combinatorial constructions of quaternary additive constant-weight codes, alongside additive generalized anticode construction. Subsequently, we propose generalized Construction X, which facilitates the construction of non-integer dimensional optimal additive codes from linear codes. Then, we construct ten classes of optimal quaternary non-integer dimensional additive codes through these two methods. As an application, we also determine the optimal additive \u0000<inline-formula> <tex-math>$[n,3.5,n-t]_{4}$ </tex-math></inline-formula>\u0000 codes for all t with variable n, except for \u0000<inline-formula> <tex-math>$t=6,7,12$ </tex-math></inline-formula>\u0000.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"7690-7700"},"PeriodicalIF":2.2,"publicationDate":"2024-09-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-23DOI: 10.1109/TIT.2024.3466523
Xiaoshan Kai;Yajing Zhou;Shixin Zhu
Due to the application of high density data storage systems, symbol-pair codes are proposed to combat errors of the overlapping symbol pairs output over symbol-pair read channels. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that they have the highest pair error-correcting capability. In this paper, we construct two new classes of MDS symbol-pair codes with minimum pair distance seven based on simple-root cyclic codes. Our technique is through the decomposition of cyclic codes and the dual of each component code.
{"title":"Two New Classes of MDS Symbol-Pair Codes","authors":"Xiaoshan Kai;Yajing Zhou;Shixin Zhu","doi":"10.1109/TIT.2024.3466523","DOIUrl":"https://doi.org/10.1109/TIT.2024.3466523","url":null,"abstract":"Due to the application of high density data storage systems, symbol-pair codes are proposed to combat errors of the overlapping symbol pairs output over symbol-pair read channels. Maximum distance separable (MDS) symbol-pair codes are optimal in the sense that they have the highest pair error-correcting capability. In this paper, we construct two new classes of MDS symbol-pair codes with minimum pair distance seven based on simple-root cyclic codes. Our technique is through the decomposition of cyclic codes and the dual of each component code.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"7701-7710"},"PeriodicalIF":2.2,"publicationDate":"2024-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517997","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-20DOI: 10.1109/TIT.2024.3464678
Roberto Pereira;Xavier Mestre;David Gregoratti
This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are separately applied to each covariance matrix. This family of distances is particularly useful as it takes into consideration the fact that covariance matrices lie in the Riemannian manifold of positive definite matrices, thereby including a variety of commonly used metrics, such as the Euclidean distance, Jeffreys’ divergence, and the log-Euclidean distance. Moreover, a statistical analysis of the asymptotic behavior of this class of distance estimators has also been conducted. Specifically, we present a central limit theorem that establishes the asymptotic Gaussianity of these estimators and provides closed form expressions for the corresponding means and variances. Empirical evaluations demonstrate the superiority of our proposed consistent estimator over conventional plug-in estimators in multivariate analytical contexts. Additionally, the central limit theorem derived in this study provides a robust statistical framework to assess of accuracy of these estimators.
{"title":"Consistent Estimation of a Class of Distances Between Covariance Matrices","authors":"Roberto Pereira;Xavier Mestre;David Gregoratti","doi":"10.1109/TIT.2024.3464678","DOIUrl":"https://doi.org/10.1109/TIT.2024.3464678","url":null,"abstract":"This work considers the problem of estimating the distance between two covariance matrices directly from the data. Particularly, we are interested in the family of distances that can be expressed as sums of traces of functions that are separately applied to each covariance matrix. This family of distances is particularly useful as it takes into consideration the fact that covariance matrices lie in the Riemannian manifold of positive definite matrices, thereby including a variety of commonly used metrics, such as the Euclidean distance, Jeffreys’ divergence, and the log-Euclidean distance. Moreover, a statistical analysis of the asymptotic behavior of this class of distance estimators has also been conducted. Specifically, we present a central limit theorem that establishes the asymptotic Gaussianity of these estimators and provides closed form expressions for the corresponding means and variances. Empirical evaluations demonstrate the superiority of our proposed consistent estimator over conventional plug-in estimators in multivariate analytical contexts. Additionally, the central limit theorem derived in this study provides a robust statistical framework to assess of accuracy of these estimators.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"8107-8132"},"PeriodicalIF":2.2,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142518064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-20DOI: 10.1109/TIT.2024.3465218
Amit Berman;Yaron Shany;Itzhak Tamo
We present <inline-formula> <tex-math>$O(m^{3})$ </tex-math></inline-formula> algorithms for specifying the support of minimum-weight codewords of extended binary BCH codes of length <inline-formula> <tex-math>$n=2^{m}$ </tex-math></inline-formula> and designed distance <inline-formula> <tex-math>$d(m,s,i):=2^{m-1-s}-2^{m-1-i-s}$ </tex-math></inline-formula> for some values of <inline-formula> <tex-math>$m,i,s$ </tex-math></inline-formula> , where m may grow to infinity. Here, the support is specified as the sum of two sets: a set of <inline-formula> <tex-math>$2^{2i-1}-2^{i-1}$ </tex-math></inline-formula> elements, and a subspace of dimension <inline-formula> <tex-math>$m-2i-s$ </tex-math></inline-formula> , specified by a basis. In some detail, for designed distance <inline-formula> <tex-math>$6cdot 2^{j}$ </tex-math></inline-formula> , <inline-formula> <tex-math>$jin {0,ldots ,m-4}$ </tex-math></inline-formula> , we have a deterministic algorithm for even <inline-formula> <tex-math>$mgeq 4$ </tex-math></inline-formula> , and a probabilistic algorithm with success probability <inline-formula> <tex-math>$1-O(2^{-m})$ </tex-math></inline-formula> for odd <inline-formula> <tex-math>$mgt 4$ </tex-math></inline-formula> . For designed distance <inline-formula> <tex-math>$28cdot 2^{j}$ </tex-math></inline-formula> , <inline-formula> <tex-math>$jin {0,ldots , m-6}$ </tex-math></inline-formula> , we have a probabilistic algorithm with success probability <inline-formula> <tex-math>$geq frac {1}{3}-O(2^{-m/2})$ </tex-math></inline-formula> for even <inline-formula> <tex-math>$mgeq 6$ </tex-math></inline-formula> . Finally, for designed distance <inline-formula> <tex-math>$120cdot 2^{j}$ </tex-math></inline-formula> , <inline-formula> <tex-math>$jin {0,ldots , m-8}$ </tex-math></inline-formula> , we have a deterministic algorithm for <inline-formula> <tex-math>$mgeq 8$ </tex-math></inline-formula> divisible by 4. We also show how Gold functions can be used to find the support of minimum-weight words for designed distance <inline-formula> <tex-math>$d(m,s,i)$ </tex-math></inline-formula> (for <inline-formula> <tex-math>$iin {0,ldots ,lfloor m/2rfloor }$ </tex-math></inline-formula> , and <inline-formula> <tex-math>$sleq m-2i$ </tex-math></inline-formula> ) whenever <inline-formula> <tex-math>$2i|m$ </tex-math></inline-formula> . Our construction builds on results of Kasami and Lin, who proved that for extended binary BCH codes of designed distance <inline-formula> <tex-math>$d(m,s,i)$ </tex-math></inline-formula> (for integers <inline-formula> <tex-math>$mgeq 2$ </tex-math></inline-formula> , <inline-formula> <tex-math>$0leq ileq lfloor m/2rfloor $ </tex-math></inline-formula> , and <inline-formula> <tex-math>$0leq sleq m-2i$ </tex-math></inline-formula> ), the minimum distance equals the designed distance. The proof of Kasami and Lin makes use of a non-constructive existence result of Berlekamp, and a constructive “dow
{"title":"Efficient Algorithms for Constructing Minimum-Weight Codewords in Some Extended Binary BCH Codes","authors":"Amit Berman;Yaron Shany;Itzhak Tamo","doi":"10.1109/TIT.2024.3465218","DOIUrl":"https://doi.org/10.1109/TIT.2024.3465218","url":null,"abstract":"We present \u0000<inline-formula> <tex-math>$O(m^{3})$ </tex-math></inline-formula>\u0000 algorithms for specifying the support of minimum-weight codewords of extended binary BCH codes of length \u0000<inline-formula> <tex-math>$n=2^{m}$ </tex-math></inline-formula>\u0000 and designed distance \u0000<inline-formula> <tex-math>$d(m,s,i):=2^{m-1-s}-2^{m-1-i-s}$ </tex-math></inline-formula>\u0000 for some values of \u0000<inline-formula> <tex-math>$m,i,s$ </tex-math></inline-formula>\u0000, where m may grow to infinity. Here, the support is specified as the sum of two sets: a set of \u0000<inline-formula> <tex-math>$2^{2i-1}-2^{i-1}$ </tex-math></inline-formula>\u0000 elements, and a subspace of dimension \u0000<inline-formula> <tex-math>$m-2i-s$ </tex-math></inline-formula>\u0000, specified by a basis. In some detail, for designed distance \u0000<inline-formula> <tex-math>$6cdot 2^{j}$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$jin {0,ldots ,m-4}$ </tex-math></inline-formula>\u0000, we have a deterministic algorithm for even \u0000<inline-formula> <tex-math>$mgeq 4$ </tex-math></inline-formula>\u0000, and a probabilistic algorithm with success probability \u0000<inline-formula> <tex-math>$1-O(2^{-m})$ </tex-math></inline-formula>\u0000 for odd \u0000<inline-formula> <tex-math>$mgt 4$ </tex-math></inline-formula>\u0000. For designed distance \u0000<inline-formula> <tex-math>$28cdot 2^{j}$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$jin {0,ldots , m-6}$ </tex-math></inline-formula>\u0000, we have a probabilistic algorithm with success probability \u0000<inline-formula> <tex-math>$geq frac {1}{3}-O(2^{-m/2})$ </tex-math></inline-formula>\u0000 for even \u0000<inline-formula> <tex-math>$mgeq 6$ </tex-math></inline-formula>\u0000. Finally, for designed distance \u0000<inline-formula> <tex-math>$120cdot 2^{j}$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$jin {0,ldots , m-8}$ </tex-math></inline-formula>\u0000, we have a deterministic algorithm for \u0000<inline-formula> <tex-math>$mgeq 8$ </tex-math></inline-formula>\u0000 divisible by 4. We also show how Gold functions can be used to find the support of minimum-weight words for designed distance \u0000<inline-formula> <tex-math>$d(m,s,i)$ </tex-math></inline-formula>\u0000 (for \u0000<inline-formula> <tex-math>$iin {0,ldots ,lfloor m/2rfloor }$ </tex-math></inline-formula>\u0000, and \u0000<inline-formula> <tex-math>$sleq m-2i$ </tex-math></inline-formula>\u0000) whenever \u0000<inline-formula> <tex-math>$2i|m$ </tex-math></inline-formula>\u0000. Our construction builds on results of Kasami and Lin, who proved that for extended binary BCH codes of designed distance \u0000<inline-formula> <tex-math>$d(m,s,i)$ </tex-math></inline-formula>\u0000 (for integers \u0000<inline-formula> <tex-math>$mgeq 2$ </tex-math></inline-formula>\u0000, \u0000<inline-formula> <tex-math>$0leq ileq lfloor m/2rfloor $ </tex-math></inline-formula>\u0000, and \u0000<inline-formula> <tex-math>$0leq sleq m-2i$ </tex-math></inline-formula>\u0000), the minimum distance equals the designed distance. The proof of Kasami and Lin makes use of a non-constructive existence result of Berlekamp, and a constructive “dow","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 11","pages":"7673-7689"},"PeriodicalIF":2.2,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142517943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-18DOI: 10.1109/tit.2024.3462937
Arya Mazumdar, Soumyabrata Pal
{"title":"Support Recovery in Mixture Models with Sparse Parameters","authors":"Arya Mazumdar, Soumyabrata Pal","doi":"10.1109/tit.2024.3462937","DOIUrl":"https://doi.org/10.1109/tit.2024.3462937","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"17 1","pages":""},"PeriodicalIF":2.5,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142252675","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-09-17DOI: 10.1109/TIT.2024.3455151
{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2024.3455151","DOIUrl":"https://doi.org/10.1109/TIT.2024.3455151","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"70 10","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10682503","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142235921","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：