Title :
Bounds for constrained entropy maximisation
Author :
Chan, Terence H. ; Grant, A.
Author_Institution :
Inst. for Telecommun. Res., Univ. of South Australia, Adelaide, SA, Australia
fDate :
June 29 2014-July 4 2014
Abstract :
This paper considers an entropy maximisation problem subject to functional dependency constraints. We compare Delsarte´s linear programming (LP) bound, an information theoretic LP bound, and functional dependency bounds and prove that both Delsarte´s LP bound and the information theoretic LP bound are at least better than the functional dependency bound.
Keywords :
constraint theory; entropy codes; information theory; linear programming; Delsartes LP bound; Delsartes linear programming bound; constrained entropy maximisation; functional dependency constraints; information theoretic LP bound; Entropy; Information theory; Linear programming; Maintenance engineering; Optimization; Random variables; Vectors;
Conference_Titel :
Information Theory (ISIT), 2014 IEEE International Symposium on
Conference_Location :
Honolulu, HI
DOI :
10.1109/ISIT.2014.6874851
