This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: in this situation. However, if the value of Y is known but it does not tell anything about the value of X , then learning the value of X in this situation will convey the same number of bits as in the situation where the value of Y is not known. That is H ( X j Y ) = H ( X ) in this situation. Thus intuitively we have that H ( X j Y ) & H ( X ) with the equality in the case that X is independent of Y . 5. 2.7925 6. 1380 2...
View
Full
Document
This note was uploaded on 05/22/2010 for the course MATH 187 taught by Professor Staff during the Spring '08 term at UCSD.
 Spring '08
 staff
 Math, Cryptography

Click to edit the document details