Noiseless Coding Theorems Corresponding to Fuzzy Entropies
نویسندگان
چکیده
Noiseless coding theorems connected with fuzzy entropies corresponding to Shannon, Renyi and Havrada and Charvat have been established. The upper bounds of these entropies in terms of mean code word lengths have been provided and some interesting properties of these codeword lengths have been studied.
منابع مشابه
Application of Fuzzy Information Measure to Coding Theory
The objective of the present communication is to develop new measure , called average code word length of order and type and establish its relationship with a result of generalized fuzzy information measures. Using , Noiseless coding theorems connected with fuzzy information measure have been proved.
متن کاملSecond-order noiseless source coding theorems
I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...
متن کاملChannels with Arbitrarily Varying Channel Probability Functions in the Presence of Noiseless Feedback
In this article we study a channel with arbitrarily varying channel probability functions in the presence of a noiseless feedback channel (a. v. ch. f.). We determine its capacity by proving a coding theorem and its strong converse. Our proof of the coding theorem is constructive; we give explicitly a coding scheme which performs at any rate below the capacity with an arbitrarily small decoding...
متن کاملSome New Fixed Point Theorems in Fuzzy Metric Spaces
Motivated by Samet et al. [Nonlinear Anal., 75(4) (2012), 2154-2165], we introduce the notions of $alpha$-$phi$-fuzzy contractive mapping and $beta$-$psi$-fuzzy contractive mapping and prove two theorems which ensure the existence and uniqueness of a fixed point for these two types of mappings. The presented theorems extend, generalize and improve the corresponding results given in the literature.
متن کاملPubTeX output 1997.05.27:1654
Shannon’s celebrated source coding theorem can be viewed as a “one-sided law of large numbers.” We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a “one-sided central limit theorem” and a law of the iterated logarithm.
متن کامل