R. B. Ash. Information Theory. Dover, 1965. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Quantum Mechanics as Quantum Information (and only a little more) - Fuchs (Correct)
....there are several reasons to think of it as a good measure of uncertainty. Perhaps the most important of these is that it quantifies the number of binary valued questions one expects to ask (per instance of H) if one s only means to ascertain the outcome is from a colleague who knows the result [81]. Under this quantification, the lower the Shannon entropy, the more predictable a measurement s outcomes. Because the function f(x) x log x is concave on the interval [0, 1] it follows that, log # P (h d) log P (h d) P (d)S(H d) 76) Indeed we hope to find a ....
R. B. Ash, Information Theory, (Dover, New York, 1965).
Information Measures for Sources with Memory and Their.. - Rached (2002) (Correct)
....optimal, and the best error exponent is L. 54 Remark: Our approach generalizes in a straightforward manner for stationary Markov sources that contain one irreducible essential class C1 and an arbitrary number of inessential classes C2, C8. Such a Markov source is said to be indecomposable [7]. In this case, the stationary distribution is r = rl, 0, 0) where rl is the station ary distribution corresponding to C1 and the zeros correspond to inessential classes. We have the following result. Corollary 3.4 Let X1, X2, be a stationary Markov source generated according to p( ....
R. B. Ash, Information Theory, Dover Publications, New York, 1965.
Distortion Measures for - Categorical Data Swapping (Correct)
.... to the natural interpretation of Shannon entropy as the expectation of a random variable that takes values log(f(X) with probability f(X) An alternative interpretation is that it is the minimum average number of yes or no questions required to determine the result of one observation of X [3]. This entropy function takes its largest value when all possible values of X have the same probability of being observed, and the smallest when all of the probability mass is concentrated on a single value. Shannon entropy has been considered as a distortion measure by other authors (see [17] ....
R. B. Ash. Information Theory. Dover Publication, Inc., New York, 1965.
Privacy Amplification Theorem for Noisy Main Channel - Korjik, Morales-Luna.. (Correct)
....z, z and y respectively and let E be the probability space that models the eavesdropper s information on z. Then, the following inequality holds Z; E; Y ) I(Z; E) 8) whenever det H 6= 0; 9) where H = H 2 H 1 ] Proof of the lemma. By very well known information theoretic relations [1] we have Z; E; Y ) I( Z; Y ) I( Z; EjY ) 10) Let us prove first that if eq. 9) were true, then I( Z; Y ) 0. Consider the joint probability Prob[ z; y] Prob[zH ] The condition (9) implies that H is a non singular ( r) r) matrix and therefore Prob[ z; y] Prob[z ....
.... symbol error probability m and check symbols through noiseless channel can be considered as a transmission of both groups of symbols over time sharing channel with the capacity C ts = k r Cm (19) where Cm = 1 H( m ) Substitution of (19) in Shannon s condition of reliable communication [1] gives R = C ts which implies the condition r k H( m ) Taking into account that asymptotically [2] t c (1 H( m ) k we get from eq. 7) the condition on key rate R k = to provide an exponential decreasing of information I 0 leaking to eavesdropper, as k 1 R k H( w ) H( m ) ....
Ash, R.B. "Information Theory". Dover, New York, 1990.
Identifying Functional Relationships Among Human Genes By.. - Tao, Leibel (2002) (Correct)
....the relevance between two kernel documents. The weight w i for a base vector document b i is calculated using the following equation: where n i is the number of related documents for b i and N is the total number of kernel documents. This weight measurement method is based upon information theory [3], and is similar to the weight measure employed by Wilbur et al.[4] to evaluate the significance of a specific keyword in determining the relatedness of two papers. Vector Representation of a Kernel Document Assuming that there are M base vectors documents, b 1 , b 2 , b M , and the weight ....
Ash R: Information Theory. Chapter 1. Dover Publishers 1990
A Deterministic - Algorithm For Sat (Correct)
No context found.
R. B. Ash. Information Theory. Dover, 1965.
On Considering Uncertainty and Alternatives in Low-Level Vision - Steven Lavalle Seth (1993) (Correct)
No context found.
R. B. Ash. Information Theory. Dover Publications, New York, NY, 1990.
An Accurate Evaluation of Maurer's Universal Test - Coron, Naccache (1999) (4 citations) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
On the Security of Random Sources - Published In Imai (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
On the Security of Random Sources - Published In Imai (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
An Accurate Evaluation of Maurer's Universal Test - Published In Tavares (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
The Disparity between Work and Entropy in Cryptology - Pliam (1999) (Correct)
No context found.
Robert B. Ash. Information Theory. Dover, New York, 1965.
An Accurate Evaluation of Maurer's Universal Test - Coron, Naccache (1999) (4 citations) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
Planning Algorithms - LaValle (2004) (3 citations) (Correct)
No context found.
R. B. Ash. Information Theory. Dover Publications, New York, NY, 1990.
On the Security of Random Sources - Coron (1999) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
Information Theory of Complex Networks: on evolution and.. - Sole, Valverde (Correct)
No context found.
Ash, R. B. Information Theory, Dover, London (1965).
Linear Time Universal Coding and Time Reversal of Tree .. - Martin, Seroussi.. (2004) (Correct)
No context found.
R. B. Ash, Information Theory. John Wiley & Sons, Inc., 1967.
On the Security of Random Sources - Coron (1999) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
An Accurate Evaluation of Maurer's Universal Test - Coron, al. (1999) (4 citations) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
On random graph homomorphisms into Z - Benjamini, Häggström, Mossel (1999) (1 citation) (Correct)
No context found.
Ash, R, B. (1965) Information Theory, Dover, New York.
On the Security of Random Sources - Coron (1999) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
An Accurate Evaluation of Maurer's Universal Test - Coron, Naccache (1999) (4 citations) (Correct)
No context found.
R. Ash, Information theory, Dover publications, New-York, 1965.
A Theory of Program Size Formally Identical to Information Theory - Chaitin (1975) (85 citations) (Correct)
No context found.
Ash, R. Information Theory. Wiley-Interscience, New York, 1965.
Exact Arbitrage, Well-Diversified Portfolios and Asset Pricing.. - Khan, Sun (Correct)
No context found.
R. Ash "Information Theory," Dover Publications, Inc, New York, 1965.
Deterministic Algorithms for k-SAT Based on Covering .. - Dantsin, Goerdt.. (2000) (1 citation) (Correct)
No context found.
R. B. Ash. Information Theory. Dover, 1965.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC