On the Shannon capacity of an arbitrary channel
نویسندگان
چکیده
منابع مشابه
The Articulation Index is a Shannon channel capacity
The articulation index (AI), denoted ¢ ¡ snr£ , first described by Fletcher in 1921 (Fletcher 1995), has served the speech and hearing community well, as a well known method for characterizing nonsense speech sound intelligibility. For example, the AI is a basic tool of hearing aid research, and has even been used to fit hearing aids. It is defined in terms of an average of a special function o...
متن کاملan investigation of the impact of self monitoring on langauge teachers motivational practice and its effect on learners motivation
the central purpose of this study was to conduct a case study about the role of self monitoring in teacher’s use of motivational strategies. furthermore it focused on how these strategies affected students’ motivational behavior. although many studies have been done to investigate teachers’ motivational strategies use (cheng & d?rnyei, 2007; d?rnyei & csizer, 1998; green, 2001, guilloteaux & d?...
On the Shannon capacity of a graph
A/Mmcr-It is proved that the Shannon zero-error capacity of the pentagon is e. The method is then generalized to obtain upper bounds on the capacity of au arbitrary graph. A well-characterized, and in a sense easily computable, function is introduced which bounds the capacity from above and equals the capacity in a large number of cases. Several results are obtained on the capacity of special g...
متن کاملOn the Shannon Capacity of Triangular Graphs
The Shannon capacity of a graph G is c(G) = supd>1(α(G d)) 1 d , where α(G) is the independence number of G. The Shannon capacity of the Kneser graph KGn,r was determined by Lovász in 1979, but little is known about the Shannon capacity of the complement of that graph when r does not divide n. The complement of the Kneser graph, KGn,2, is also called the triangular graph Tn. The graph Tn has th...
متن کاملOn the Computation of the Shannon Capacity of a Discrete Channel with Noise
Abstract. Muroga [M52] showed how to express the Shannon channel capacity of a discrete channel with noise [S49] as an explicit function of the transition probabilities. His method accommodates channels with any finite number of input symbols, any finite number of output symbols and any transition probability matrix. Silverman [S55] carried out Muroga’s method in the special case of a binary ch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae (Proceedings)
سال: 1974
ISSN: 1385-7258
DOI: 10.1016/1385-7258(74)90000-6