Finding the capacity of next-generation networks by linear programming
Date
2014
Authors
Tan, C.
Ho, S.W.
Lin, S.
Yeung, R.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IEEE International conference on communication systems, IEEE ICCS 2014, 2014, pp.192-196
Statement of Responsibility
Conference Name
International conference on communication systems (19 Nov 2014 - 21 Nov 2014 : China)
Abstract
Proving or disproving an information inequality is a crucial step in establishing the converse results in the coding theorems of communication networks. However, next-generation networks are very large-scale, typically involving multiple users and many transceivers and relays. This means that an information inequality involving many random variables can be difficult to be proved or disproved manually. In [1], Yeung developed a framework that uses linear programming for verifying linear information inequalities, and it was recently shown in [2] that this framework can be used to explicitly construct an analytic proof of an information inequality or an analytic counterexample to disprove it if the inequality is not true in general. In this paper, we consider the construction of the smallest counterexample, and also give sufficient conditions for that the inequality can be manipulated to become true. We also describe the software development of automating this analytical framework enabled by cloud computing to analytically verify information inequalities in large-scale problem setting
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2014 IEEE