IEEE Transactions on Information Theory最新文献

{"title":"Distribution-Preserving Integrated Sensing and Communication","authors":"Yiqi Chen;Tobias J. Oechtering;Holger Boche;Mikael Skoglund;Yuan Luo","doi":"10.1109/TIT.2025.3592995","DOIUrl":"https://doi.org/10.1109/TIT.2025.3592995","url":null,"abstract":"Distribution-preserving integrated sensing and communication is investigated in this paper. In addition to the distortion constraint, we impose another constraint on the distance between the reconstructed sequence distribution and the original state distribution to force the system to preserve the statistical property of the channel states. An inner bound of the distribution-preserving capacity-distortion region is provided with some capacity region results under special cases. Furthermore, we consider the case where the system aims to keep the reconstructed sequence secret from an eavesdropper who also observes the channel output and receives rate-limited side information about the estimator. An inner bound of the tradeoff region and a capacity-achieving special case are presented. In addition, we provide some numerical examples to illustrate the tradeoff between the communication rate, distortion, and the preservation of the distribution.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7518-7539"},"PeriodicalIF":2.9,"publicationDate":"2025-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11097316","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110278","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}

{"title":"Exact Matching in Correlated Networks With Node Attributes for Improved Community Recovery","authors":"Joonhyuk Yang;Hye Won Chung","doi":"10.1109/TIT.2025.3592704","DOIUrl":"https://doi.org/10.1109/TIT.2025.3592704","url":null,"abstract":"We study community detection in multiple networks with jointly correlated node attributes and edges. This setting arises naturally in applications such as social platforms, where a shared set of users may exhibit both correlated friendship patterns and correlated attributes across different platforms. Extending the classical Stochastic Block Model (SBM) and its contextual counterpart (Contextual SBM or CSBM), we introduce the correlated CSBM, which incorporates structural and attribute correlations across graphs. To build intuition, we first analyze correlated Gaussian Mixture Models, wherein only correlated node attributes are available without edges, and identify the conditions under which an estimator minimizing the distance between attributes achieves exact matching of nodes across the two databases. For the correlated CSBMs, we develop a two-step procedure that first applies <italic>k</i>-core matching to most nodes using edge information, then refines the matching for the remaining unmatched nodes by leveraging their attributes with a distance-based estimator. We identify the conditions under which the algorithm recovers the exact node correspondence, enabling us to merge the correlated edges and average the correlated attributes for enhanced community detection. Crucially, by aligning and combining graphs, we identify regimes in which community detection is impossible in a single graph but becomes feasible when side information from correlated graphs is incorporated. Our results illustrate how the interplay between graph matching and community recovery can boost performance, broadening the scope of multi-graph, attribute-based community detection.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7916-7941"},"PeriodicalIF":2.9,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110273","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}

{"title":"The Decomposition of Cascade Connections of NFSRs: Old and New Results","authors":"Xiao-Xin Zhao;Wen-Feng Qi;Zhong-Xiao Wang;Qun-Xiong Zheng;Deng Tang","doi":"10.1109/TIT.2025.3592293","DOIUrl":"https://doi.org/10.1109/TIT.2025.3592293","url":null,"abstract":"Cascade connection architectures of nonlinear feedback shift registers (NFSRs) have been widely used as the main components in the design of cryptographic algorithms, such as the Grain family of stream ciphers. It is known that the cascade connection of an <italic>n</i>-stage NFSR into an <italic>m</i>-stage NFSR is equivalent to an <inline-formula> <tex-math>$(n+m)$ </tex-math></inline-formula>-stage NFSR. However, the converse problem on decomposing an NFSR into the cascade connection of two smaller NFSRs has not been well addressed, which can be transformed to decomposing the characteristic function <italic>h</i> of the NFSR into the form <inline-formula> <tex-math>$h=f ast g$ </tex-math></inline-formula> for some nonlinear <inline-formula> <tex-math>$f,g$ </tex-math></inline-formula>, where “<inline-formula> <tex-math>$ast $ </tex-math></inline-formula>” is a special composition of Boolean functions. In this paper, we present a complete and efficient method for such decomposition problem based on previous works. The framework of the decomposition consists of two steps. The first is to construct a candidate set for <italic>g</i> as precise as possible, and the second is to verify each candidate <italic>g</i> and recover the corresponding <italic>f</i>. We propose the notion of <inline-formula> <tex-math>$ast $ </tex-math></inline-formula>-multiples of Boolean functions, and present three ways to take derivatives of <italic>h</i> to extract the low-degree <inline-formula> <tex-math>$ast $ </tex-math></inline-formula>-multiples of <italic>g</i>, which are useful to determine <italic>g</i> efficiently. Compared to existing methods, the new approach can provide a very small candidate set for <italic>g</i> in most cases, with the size being <inline-formula> <tex-math>$O(deg (h))$ </tex-math></inline-formula>, thereby achieving lower and more stable time costs in determining whether <italic>h</i> is <inline-formula> <tex-math>$ast $ </tex-math></inline-formula>-reducible and enumerating all pairs <inline-formula> <tex-math>$(f,g)$ </tex-math></inline-formula> such that <inline-formula> <tex-math>$h=f ast g$ </tex-math></inline-formula> (if it is <inline-formula> <tex-math>$ast $ </tex-math></inline-formula>-reducible). Moreover, we show that the decomposition method also applies to shift-invariant maps, by establishing a connection between the <inline-formula> <tex-math>$ast $ </tex-math></inline-formula>-product of Boolean functions and the composition of shift-invariant maps.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"8029-8047"},"PeriodicalIF":2.9,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110338","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}

{"title":"IEEE Transactions on Information Theory Information for Authors","authors":"","doi":"10.1109/TIT.2025.3583661","DOIUrl":"https://doi.org/10.1109/TIT.2025.3583661","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 8","pages":"C3-C3"},"PeriodicalIF":2.2,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11095974","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144695536","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}

{"title":"IEEE Transactions on Information Theory Publication Information","authors":"","doi":"10.1109/TIT.2025.3583663","DOIUrl":"https://doi.org/10.1109/TIT.2025.3583663","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 8","pages":"C2-C2"},"PeriodicalIF":2.2,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11095972","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144695537","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}

{"title":"Improved Constructions of Skew-Tolerant Gray Codes","authors":"Gabriel Sac Himelfarb;Moshe Schwartz","doi":"10.1109/TIT.2025.3592490","DOIUrl":"https://doi.org/10.1109/TIT.2025.3592490","url":null,"abstract":"Skew-tolerant Gray codes are Gray codes in which changes in consecutive codewords occur in adjacent positions. We present the first construction of asymptotically non-vanishing skew-tolerant Gray codes, offering an exponential improvement over previous work. We also provide linear-time encoding and decoding algorithms for our codes. Finally, we extend the definition to non-binary alphabets, and provide constructions of complete <italic>m</i>-ary skew-tolerant Gray codes for every base <inline-formula> <tex-math>$mgeqslant 3$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"8017-8028"},"PeriodicalIF":2.9,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110301","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}

{"title":"Member ad suite","authors":"","doi":"10.1109/TIT.2025.3589741","DOIUrl":"https://doi.org/10.1109/TIT.2025.3589741","url":null,"abstract":"","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 8","pages":"6502-6502"},"PeriodicalIF":2.2,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11095973","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144695640","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}

{"title":"Uhlmann’s Theorem for Relative Entropies","authors":"Giulia Mazzola;David Sutter;Renato Renner","doi":"10.1109/TIT.2025.3591775","DOIUrl":"https://doi.org/10.1109/TIT.2025.3591775","url":null,"abstract":"Uhlmann’s theorem states that, for any two quantum states <inline-formula> <tex-math>$rho _{AB}$ </tex-math></inline-formula> and <inline-formula> <tex-math>$sigma _{A}$ </tex-math></inline-formula>, there exists an extension <inline-formula> <tex-math>$sigma _{AB}$ </tex-math></inline-formula> of <inline-formula> <tex-math>$sigma _{A}$ </tex-math></inline-formula> such that the fidelity between <inline-formula> <tex-math>$rho _{AB}$ </tex-math></inline-formula> and <inline-formula> <tex-math>$sigma _{AB}$ </tex-math></inline-formula> equals the fidelity between their reduced states <inline-formula> <tex-math>$rho _{A}$ </tex-math></inline-formula> and <inline-formula> <tex-math>$sigma _{A}$ </tex-math></inline-formula>. In this work, we generalize Uhlmann’s theorem to <inline-formula> <tex-math>$alpha $ </tex-math></inline-formula>-Rényi relative entropies for <inline-formula> <tex-math>$alpha in left [{{frac {1}{2},infty }}right]$ </tex-math></inline-formula>, a family of divergences that encompasses fidelity, relative entropy, and max-relative entropy corresponding to <inline-formula> <tex-math>$alpha =frac {1}{2}$ </tex-math></inline-formula>, <inline-formula> <tex-math>$alpha =1$ </tex-math></inline-formula>, and <inline-formula> <tex-math>$alpha =infty $ </tex-math></inline-formula>, respectively.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 9","pages":"7039-7051"},"PeriodicalIF":2.9,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=11090167","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144891165","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}

{"title":"Derivation of Mutual Information and Linear Minimum Mean-Square Error for Viterbi Decoding of Convolutional Codes Using the Innovations Method","authors":"Masato Tajima","doi":"10.1109/TIT.2025.3591781","DOIUrl":"https://doi.org/10.1109/TIT.2025.3591781","url":null,"abstract":"We apply the innovations method to Viterbi decoding of convolutional codes. First, we calculate the covariance matrix of the innovation (i.e., the soft-decision input to the main decoder in a scarce-state-transition (SST) Viterbi decoder). Then a covariance matrix corresponding to that of the one-step prediction error in the Kalman filter is obtained. Furthermore, from that matrix, a covariance matrix corresponding to that of the filtering error in the Kalman filter is derived using the formula in the Kalman filter. This is justified from the fact that Viterbi decoding of convolutional codes has the structure of the Kalman filter. As a result, an upper bound on the average mutual information per branch for Viterbi decoding of convolutional codes is given using these covariance matrices. Also, the trace of the latter covariance matrix represents the (filtering) linear minimum mean-square error (LMMSE) per branch. We show that an upper bound on the average mutual information per branch is sandwiched between half the SNR times the filtering and one-step prediction LMMSEs per branch. In the case of quick-look-in (QLI) codes, from the covariance matrix of the soft-decision input to the main decoder, we can get a matrix. We show that the trace of this matrix has some connection with the linear smoothing error.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7435-7458"},"PeriodicalIF":2.9,"publicationDate":"2025-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110339","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}

{"title":"Bh Sets and Costas Cubes","authors":"David Fernando Daza Urbano;Carlos Alberto Trujillo Solarte;Carlos Andrés Martos Ojeda","doi":"10.1109/TIT.2025.3591529","DOIUrl":"https://doi.org/10.1109/TIT.2025.3591529","url":null,"abstract":"A Costas array is a permutation array in which the vectors joining pairs of 1’s are all distinct. Jedwab and Yen introduced Costas cubes, which are three-dimensional arrays that satisfy the condition that their three two-dimensional projections are Costas arrays. On the other hand, a subset <italic>A</i> in an additive group <italic>G</i> is a <inline-formula> <tex-math>$B_{h}$ </tex-math></inline-formula> set if all sums of the form <inline-formula> <tex-math>$a_{1} + a_{2} cdots + a_{h}$ </tex-math></inline-formula>, where <inline-formula> <tex-math>$a_{1}, a_{2} cdots, a_{h} in A$ </tex-math></inline-formula>, are different. In this paper, we present three new constructions of <inline-formula> <tex-math>$B_{h}$ </tex-math></inline-formula> sets for all <inline-formula> <tex-math>$hgeq 3$ </tex-math></inline-formula>. Moreover, in the case <inline-formula> <tex-math>$h=3$ </tex-math></inline-formula>, we analyze the relationship of these sets with Costas cubes constructed by Jedwab and Yen, and determine which of these cubes are <inline-formula> <tex-math>$B_{3}$ </tex-math></inline-formula> sets.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 10","pages":"7735-7741"},"PeriodicalIF":2.9,"publicationDate":"2025-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145110249","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}