IEEE Transactions on Information Theory最新文献_第2页

On the Communication-Computation Tradeoff for Symmetric Private Linear Computation 对称私有线性计算的通信-计算权衡

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-10 DOI: 10.1109/TIT.2025.3559736

Jinbao Zhu;Xiaohu Tang

{"title":"On the Communication-Computation Tradeoff for Symmetric Private Linear Computation","authors":"Jinbao Zhu;Xiaohu Tang","doi":"10.1109/TIT.2025.3559736","DOIUrl":"https://doi.org/10.1109/TIT.2025.3559736","url":null,"abstract":"We consider the problem of symmetric private linear computation (SPLC) over a replicated storage system with colluding and straggler constraints. The SPLC problem allows the user to privately compute a linear combination of multiple files from a set of replicated servers, even in the presence of straggler servers that can bottleneck the entire computation. It is guaranteed that a certain number of colluding servers learn nothing about the coefficients of the linear combination, and the user must not learn any information about the files other than the desired linear computation. Unlike previous private computation literature that mainly focused on decreasing download cost from servers, we aim to establish a flexible tradeoff between communication costs and computational complexities. In particular, we propose a novel SPLC scheme under the assumption of a fixed number of stragglers. Additionally, by generalizing this SPLC scheme, we construct an adaptive SPLC scheme capable of tolerating the presence of a varying number of stragglers, even if their identities and numbers are unknown in advance. Compared to the SPLC scheme with a fixed number of stragglers, the adaptive SPLC scheme achieves a lower communication cost based on the actual number of stragglers, albeit at the cost of increased computational complexities. Both types of SPLC schemes achieve flexible performance tradeoffs and can be employed to optimize system efficiency in practice.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4284-4305"},"PeriodicalIF":2.2,"publicationDate":"2025-04-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117407","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}

引用次数: 0

The Guesswork of Ordered Statistics Decoding: Guesswork Complexity and Decoder Design 有序统计译码的猜测：猜测复杂性与译码器设计

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-09 DOI: 10.1109/TIT.2025.3559168

Chentao Yue;Changyang She;Branka Vucetic;Yonghui Li

{"title":"The Guesswork of Ordered Statistics Decoding: Guesswork Complexity and Decoder Design","authors":"Chentao Yue;Changyang She;Branka Vucetic;Yonghui Li","doi":"10.1109/TIT.2025.3559168","DOIUrl":"https://doi.org/10.1109/TIT.2025.3559168","url":null,"abstract":"This paper investigates guesswork over ordered statistics and formulates the achievable guesswork complexity of ordered statistics decoding (OSD) in binary additive white Gaussian noise (AWGN) channels. The achievable guesswork complexity is defined as the number of test error patterns (TEPs) processed by OSD immediately upon finding the correct codeword estimate. The paper first develops a new upper bound for guesswork over independent sequences by partitioning them into Hamming shells and applying Hölder’s inequality. This upper bound is then extended to ordered statistics, by constructing the conditionally independent sequences within the ordered statistics sequences. Next, we apply these bounds to characterize the statistical moments of the OSD guesswork complexity. We show that the achievable guesswork complexity of OSD at maximum decoding order can be accurately approximated by the modified Bessel function, which increases exponentially with code dimension. We also identify a guesswork complexity saturation threshold, where increasing the OSD decoding order beyond this threshold improves error performance without further raising the achievable guesswork complexity. Finally, the paper presents insights on applying these findings to enhance the design of OSD decoders.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4167-4192"},"PeriodicalIF":2.2,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117449","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}

引用次数: 0

Derandomizing Codes for the Adversarial Wiretap Channel of Type II 二类对抗性窃听信道的非随机编码

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-09 DOI: 10.1109/TIT.2025.3559440

Eric Ruzomberka;Homa Nikbakht;Christopher G. Brinton;David J. Love;H. Vincent Poor

{"title":"Derandomizing Codes for the Adversarial Wiretap Channel of Type II","authors":"Eric Ruzomberka;Homa Nikbakht;Christopher G. Brinton;David J. Love;H. Vincent Poor","doi":"10.1109/TIT.2025.3559440","DOIUrl":"https://doi.org/10.1109/TIT.2025.3559440","url":null,"abstract":"The adversarial wiretap channel of type II (AWTC-II) is a communication channel that can a) read a fraction of the transmitted symbols up to a given bound and b) induce both errors and erasures in a fraction of the symbols up to given bounds. The channel is controlled by an adversary who can freely choose the locations of the symbol reads, errors and erasures via a process with unbounded computational power. The AWTC-II is an extension of Ozarow’s and Wyner’s wiretap channel of type II to the adversarial channel setting. The semantic-secrecy (SS) capacity of the AWTC-II is partially known, where the best-known lower bound is non-constructive and proven via a random coding argument that uses a large number (that is, exponential in blocklength <italic>n) of random bits to describe the random code. In this work, we establish a new derandomization result in which we match the best-known lower bound via a non-constructive random code that uses only <inline-formula> <tex-math>$O(n^{2})$ </tex-math></inline-formula> random bits. Unlike fully random codes, our derandomized code admits an efficient encoding algorithm and benefits from some linear structure. Our derandomization result is a novel application of <italic>random pseudolinear codes – a class of non-linear codes first proposed for applications outside the AWTC-II setting, which have <italic>k-wise independent codewords where <italic>k is a design parameter. As the key technical tool in our analysis, we provide a novel concentration inequality for sums of random variables with limited independence, as well as a soft-covering lemma similar to that of Goldfeld, Cuff and Permuter that holds for random codes with <italic>k-wise independent codewords.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4686-4707"},"PeriodicalIF":2.2,"publicationDate":"2025-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117156","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}

引用次数: 0

Optimal Trace Codes and Their Self-Orthogonality 最优跟踪码及其自正交性

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-09 DOI: 10.1109/TIT.2025.3559453

Jong Yoon Hyun;Zhao Hu;Eun Ju Cheon;Yansheng Wu

引用次数: 0

Linear Programming Bound on Frequency Hopping Sequences 跳频序列的线性规划界

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-08 DOI: 10.1109/TIT.2025.3558949

Xing Liu

引用次数: 0

Security, Latency, and Throughput of Proof-of-Work Nakamoto Consensus 中本共识工作量证明的安全性、延迟性和吞吐量

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-07 DOI: 10.1109/TIT.2025.3557761

Shu-Jie Cao;Dongning Guo

引用次数: 0

Near Optimal Probabilistic Constructions of Frameproof Codes 防帧码的近最优概率构造

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-07 DOI: 10.1109/TIT.2025.3558360

Miao Liu;Zengjiao Ma;Chong Shangguan

{"title":"Near Optimal Probabilistic Constructions of Frameproof Codes","authors":"Miao Liu;Zengjiao Ma;Chong Shangguan","doi":"10.1109/TIT.2025.3558360","DOIUrl":"https://doi.org/10.1109/TIT.2025.3558360","url":null,"abstract":"Frameproof codes are a class of secure codes that were originally introduced in the pioneering work of Boneh and Shaw in the context of digital fingerprinting. They can be used to enhance the security and credibility of digital contents. Let <inline-formula> <tex-math>$M_{c,l}(q)$ </tex-math></inline-formula> denote the largest cardinality of a <italic>q-ary <italic>c-frameproof code with length <italic>l. Based on an intriguing observation that relates <inline-formula> <tex-math>$M_{c,l}(q)$ </tex-math></inline-formula> to the renowned Erdős Matching Conjecture in extremal set theory, in 2003, Blackburn posed an open problem on the precise value of the limit <inline-formula> <tex-math>$R_{c,l}=lim _{qrightarrow infty }frac {M_{c,l}(q)}{q^{lceil l/c rceil }}$ </tex-math></inline-formula>. By combining several ideas from the probabilistic method, we present a lower bound for <inline-formula> <tex-math>$M_{c,l}(q)$ </tex-math></inline-formula>, which, together with an upper bound of Blackburn, completely determines <inline-formula> <tex-math>$R_{c,l}$ </tex-math></inline-formula> for <italic>all fixed <inline-formula> <tex-math>$c,l$ </tex-math></inline-formula>, and resolves the above open problem in the full generality. We also present an improved upper bound for <inline-formula> <tex-math>$M_{c,l}(q)$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4137-4144"},"PeriodicalIF":2.2,"publicationDate":"2025-04-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117448","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}

引用次数: 0

Information Inequalities via Ideas From Additive Combinatorics 从加性组合学的思想看信息不等式

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-04 DOI: 10.1109/TIT.2025.3557796

Chin Wa Lau;Chandra Nair

引用次数: 0

New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density 通过Turán密度覆盖单插入码的最优密度的新界限

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-03 DOI: 10.1109/TIT.2025.3557393

Oleg Pikhurko;Oleg Verbitsky;Maksim Zhukovskii

{"title":"New Bounds for the Optimal Density of Covering Single-Insertion Codes via the Turán Density","authors":"Oleg Pikhurko;Oleg Verbitsky;Maksim Zhukovskii","doi":"10.1109/TIT.2025.3557393","DOIUrl":"https://doi.org/10.1109/TIT.2025.3557393","url":null,"abstract":"We prove that the density of any covering single-insertion code <inline-formula> <tex-math>$Csubseteq X^{r}$ </tex-math></inline-formula> over the <italic>n-symbol alphabet <italic>X cannot be smaller than <inline-formula> <tex-math>$1/r+delta _{r}$ </tex-math></inline-formula> for some positive real <inline-formula> <tex-math>$delta _{r}$ </tex-math></inline-formula> not depending on <italic>n. This improves the volume lower bound of <inline-formula> <tex-math>$1/(r+1)$ </tex-math></inline-formula>. On the other hand, we observe that, for all sufficiently large <italic>r, if <italic>n tends to infinity then the asymptotic upper bound of <inline-formula> <tex-math>$7/(r+1)$ </tex-math></inline-formula> due to Lenz et al. (2021) can be improved to <inline-formula> <tex-math>$4.911/(r+1)$ </tex-math></inline-formula>. Both the lower and the upper bounds are achieved by relating the code density to the Turán density from extremal combinatorics. For the last task, we use the analytic framework of measurable subsets of the real cube <inline-formula> <tex-math>$[{0,1}]^{r}$ </tex-math></inline-formula>.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4260-4266"},"PeriodicalIF":2.2,"publicationDate":"2025-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10948504","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117360","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}

引用次数: 0

Convergence Analysis of Probability Flow ODE for Score-Based Generative Models 基于分数的生成模型的概率流ODE收敛性分析

IF 2.2 3区计算机科学

IEEE Transactions on Information Theory Pub Date : 2025-04-02 DOI: 10.1109/TIT.2025.3557050

Daniel Zhengyu Huang;Jiaoyang Huang;Zhengjiang Lin

{"title":"Convergence Analysis of Probability Flow ODE for Score-Based Generative Models","authors":"Daniel Zhengyu Huang;Jiaoyang Huang;Zhengjiang Lin","doi":"10.1109/TIT.2025.3557050","DOIUrl":"https://doi.org/10.1109/TIT.2025.3557050","url":null,"abstract":"Score-based generative models have emerged as a powerful approach for sampling high-dimensional probability distributions. Despite their effectiveness, their theoretical underpinnings remain relatively underdeveloped. In this work, we study the convergence properties of deterministic samplers based on probability flow ODEs from both theoretical and numerical perspectives. Assuming access to <inline-formula> <tex-math>$L^{2}$ </tex-math></inline-formula>-accurate estimates of the score function, we prove the total variation between the target and the generated data distributions can be bounded above by <inline-formula> <tex-math>${mathcal {O}}(d^{3/4}delta ^{1/2})$ </tex-math></inline-formula> in the continuous time level, where <italic>d denotes the data dimension and <inline-formula> <tex-math>$delta $ </tex-math></inline-formula> represents the <inline-formula> <tex-math>$L^{2}$ </tex-math></inline-formula>-score matching error. For practical implementations using a <italic>p-th order Runge-Kutta integrator with step size <italic>h, we establish error bounds of <inline-formula> <tex-math>${mathcal {O}}(d^{3/4}delta ^{1/2} + dcdot (dh)^{p})$ </tex-math></inline-formula> at the discrete level. Finally, we present numerical studies on problems up to 128 dimensions to verify our theory.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4581-4601"},"PeriodicalIF":2.2,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117453","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}

引用次数: 0