The Kraft inequality for EPS systems

It is a well known result that the Kraft inequality is a necessary and sufficient condition for the existence of a uniquely decodable code. This paper provides an inequality which is a counterpart of the Kraft inequality in Error free Perfect Secrecy (EPS) system. Our inequality is a necessary and sufficient condition for the existence of an EPS system. It also illustrates some necessary and sufficient conditions for an EPS system to achieve the minimal expected key consumption.

[1]  J. L. Massey,et al.  An introduction to contemporary cryptology , 1988, Proc. IEEE.

[2]  Raymond W. Yeung,et al.  Information Theory and Network Coding , 2008 .

[3]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[4]  Alfredo De Santis,et al.  On Secret Sharing Schemes , 1998, Inf. Process. Lett..

[5]  Alfredo De Santis,et al.  Probability of Shares in Secret Sharing Schemes , 1999, Inf. Process. Lett..

[6]  Wenjun Chris Zhang,et al.  Assessment of Data Redundancy in Fuzzy Relational Databases Based on Semantic Inclusion Degree , 1999, Inf. Process. Lett..

[7]  Imre Csisźar,et al.  The Method of Types , 1998, IEEE Trans. Inf. Theory.

[8]  Siu-Wai Ho,et al.  Error-free perfect-secrecy systems , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[9]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[10]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.