coding theorem based on λ-norm entropy for partitions in product mv-algebras

In the present paper shannon and λ-norm mean code word length is defined in product mv-algebra. two new measures l f (p) and l f λ (p) called average code word lengths with respect to entropies of finite partitions in product mv-algebras are given and its relationship with the shannon type information measure and λ-norm type information measures of finite partitions in product mv-algebras has been examined. some coding theorems using kraft inequality has been eastablished in this structure.