Proving Information Inequalities by Gaussian Elimination

IF 2.9 3区 计算机科学 Q3 COMPUTER SCIENCE, INFORMATION SYSTEMS IEEE Transactions on Information Theory Pub Date : 2025-01-17 DOI:10.1109/TIT.2025.3531133
Laigang Guo;Raymond W. Yeung;Xiao-Shan Gao
{"title":"Proving Information Inequalities by Gaussian Elimination","authors":"Laigang Guo;Raymond W. Yeung;Xiao-Shan Gao","doi":"10.1109/TIT.2025.3531133","DOIUrl":null,"url":null,"abstract":"The proof of information inequalities and identities under linear constraints on the information measures is an important problem in information theory. For this purpose, ITIP and other variant algorithms have been developed and implemented, which are all based on solving a linear program (LP). Building on our recent work (Guo et al., 2023), we developed in this paper an enhanced approach for solving this problem. Experimental results show that our new approach improves the time complexity by over 500 times compared with Guo et al. (2023) for the problem studied by Tian (2014).","PeriodicalId":13494,"journal":{"name":"IEEE Transactions on Information Theory","volume":"71 4","pages":"2315-2328"},"PeriodicalIF":2.9000,"publicationDate":"2025-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Information Theory","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10844899/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The proof of information inequalities and identities under linear constraints on the information measures is an important problem in information theory. For this purpose, ITIP and other variant algorithms have been developed and implemented, which are all based on solving a linear program (LP). Building on our recent work (Guo et al., 2023), we developed in this paper an enhanced approach for solving this problem. Experimental results show that our new approach improves the time complexity by over 500 times compared with Guo et al. (2023) for the problem studied by Tian (2014).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
用高斯消去法证明信息不等式
在信息度量的线性约束下证明信息不等式和等式是信息论中的一个重要问题。为此,人们开发并实现了 ITIP 算法和其他变体算法,它们都基于线性规划(LP)的求解。在我们最近的工作(Guo 等人,2023 年)基础上,我们在本文中开发了一种解决该问题的增强方法。实验结果表明,对于 Tian(2014)研究的问题,我们的新方法与 Guo 等人(2023)的方法相比,时间复杂度提高了 500 多倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory 工程技术-工程:电子与电气
CiteScore
5.70
自引率
20.00%
发文量
514
审稿时长
12 months
期刊介绍: The IEEE Transactions on Information Theory is a journal that publishes theoretical and experimental papers concerned with the transmission, processing, and utilization of information. The boundaries of acceptable subject matter are intentionally not sharply delimited. Rather, it is hoped that as the focus of research activity changes, a flexible policy will permit this Transactions to follow suit. Current appropriate topics are best reflected by recent Tables of Contents; they are summarized in the titles of editorial areas that appear on the inside front cover.
期刊最新文献
TechRxiv: Share Your Preprint Research with the World! IEEE Transactions on Information Theory Information for Authors Huber-Robust Likelihood Ratio Tests for Composite Nulls and Alternatives Three New Families of Binary AFER-Optimal Linear Codes Secure Coded Caching: Exact End-Points and Tighter Bounds
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1