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

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

On the Best Approximation by Finite Gaussian Mixtures 有限高斯混合的最佳逼近

IF 2.2 3区计算机科学

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

Yun Ma;Yihong Wu;Pengkun Yang

引用次数: 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

Entanglement Measures for Detectability 可探测性的纠缠措施

IF 2.2 3区计算机科学

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

Masahito Hayashi;Yuki Ito

引用次数: 0

Optimal, Almost Optimal Few-Weight Linear Codes and Related Quantum Codes 最优、几乎最优的少权线性码及相关量子码

IF 2.2 3区计算机科学

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

Conghui Xie;Hao Chen;Haiyan Zhou;Yang Li;Huimin Lao

{"title":"Optimal, Almost Optimal Few-Weight Linear Codes and Related Quantum Codes","authors":"Conghui Xie;Hao Chen;Haiyan Zhou;Yang Li;Huimin Lao","doi":"10.1109/TIT.2025.3557315","DOIUrl":"https://doi.org/10.1109/TIT.2025.3557315","url":null,"abstract":"In eight published papers in IEEE Transactions on Information Theory, infinite families of optimal few-weight binary and <italic>q-ary linear codes were constructed and their weight distributions were determined. These codes are linear codes meeting the Griesmer bound. We indicate that many Griesmer codes constructed in these papers are not new. They are actually Solomon-Stiffler codes invented in 1965. Therefore weight distributions of some special binary or <italic>q-ary Solomon-Stiffler codes were determined in the papers mentioned above. From a similar geometric approach as Solomon-Stiffler codes, we construct ten infinite families of binary, ternary and quaternary few-weight, optimal, almost optimal and near-optimal linear codes close to the Griesmer bound and their weight distributions are determined. These linear codes have positive Griesmer defects up to five, and thus not Solomon-Stiffler codes and Griesmer codes from minihypers. Moreover, many optimal, best known and almost optimal quantum codes of small lengths, comparing with Grassl’s table on quantum codes, are constructed from the same geometric approach as binary Solomon-Stiffler codes.","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 6","pages":"4250-4259"},"PeriodicalIF":2.2,"publicationDate":"2025-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144117167","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