1 Ex. 1 Verify that the function H(p 1,..., p n ) = k p k log 2 p k satisfies all 8 axioms on H.

Size: px

Start display at page:

Download "1 Ex. 1 Verify that the function H(p 1,..., p n ) = k p k log 2 p k satisfies all 8 axioms on H."

Barry Ray
5 years ago
Views:

1 Problem sheet Ex. Verify that the function H(p,..., p n ) = k p k log p k satisfies all 8 axioms on H. Ex. (Not to be handed in). looking at the notes). List as many of the 8 axioms as you can, (without just Ex. Let X be a random variable, taking the values a and a with probability p and p, respectively. Let Y be a random variable, taking the values b, b and b with probability q, q and q, respectively. Prove that H(X, Y ) H(X) + H(Y ), with equality if and only if X and Y are independent. (You should work through the proof here, not just say that this is a special case of a more general theorem stated in the lecture). Ex. 4 Two fair dice are thrown. X denotes the value obtained by the first, and Y the value obtained by the second, and let Z = X + Y be the corresponding random variable. Evaluate H(X), H(Y ), H(X, Y ), H(Z), H(X Y ). From this, verify that H(X, Y ) = H(X) + H(Y ) and show that H(Z) < H(X, Y ). Ex. 5 Show that, for any random variable H(X, X ) = H(X). Show that H(X X) = but that H(X X ) is not necessarily zero. Ex. 6 The random variable X takes the values,,..., N with equal probability. The random variable Y is defined by { if X is even, Y = if X is odd. Evaluate H(X Y ), and show that H(Y X) =. Ex. 7 (Think about this one for a while). Suppose you want to compress, encode and encrypt a message. (Compression for shortening the data if possible, encoding for securing against noise on the channel, encryption to keep the message secret). Does it matter in which order you do this, and if yes, in which order should you do it? Ex. 8 Make yourself familiar with the restricted bookshelf, there are copies of the recommended books, (Welsh, MCKay, Jones and Jones, Hill). (The restricted bookshelf is behind the counter on the left hand side, then inside at the very end close to the copy machine,.5***.. library coding).

2 Problem sheet Ex. 9 If X and Y are discrete random variables taking only a finite number of values, show that H(X + Y X) = H(Y X). Also show that does not hold generally for g : R R. H(g(X, Y ) X) = H(Y X) Ex. A statistical survey of married couples shows that 7% of men have dark hair, that 5% of girls are blonde, and that 8% of blonde girls marry dark-haired men. How much information about the colour of a man s hair is conveyed by the colour of his wife s hair? Ex. A random variable X has the binomial distribution with parameters n and p. That is, for k n ( ) n P (X = k) = p k q n k, k where < p < and q = p. Show that H(X) n(p log p + q log q). Remark: At the end of the year you will have to write a Thesis. Experience from last years shows that students learn the mathematical word processing language L A TEX just in the final steps of their Thesis. You are encouraged to learn this during the year. good exercise would be to type some of your weekly homework, and to learn L A TEX in small chunks. Essentially one can learn L A TEX by looking at a brief manual, looking just at some examples. L A TEX is installed on the computers of the Maths department. It s free software. So you can also dowload the package from the web and use on your computer. A very brief guide: ftp://ftp.ams.org/pub/tex/doc/amsmath/short-math-guide.pdf cjm/chris Mitchell.htm#LaTeX

3 Problem sheet Ex. Show that, for any positive integer m there exists an instantaneous code over Σ = {, } that has words of all lengths in the set {,..., m}. Ex. What is the maximum number of words in a binary instantaneous code in which the maximum word length is 7? Ex. 4 (Not to be handed in.) Work through the detailed example in section.6. Ex. 5 (Not to be handed in.) Welsh s argument on McMillan s inequality is a bit short. Read it carefully and try to understand the details. Below is the argument (almost a word by word quotation). Suppose we have a uniquely decipherable code C with word lengths l,..., l N. If l = max i l i, then, for any positive integer r, we have rl (D l D l N ) r = b i D i, where b i is a non-negative integer. Here b i counts the number of ways in which a string of length i of symbols from the alphabet Σ can be made up by stringing together r words of lengths chosen from the set {l,..., l N }. (This is a partition problem, also studied in the theory of generating functions. Construct some small examples to see what happens here!) But if the code C is uniquely decipherable, it must be the case that any string of length i formed from codewords must correspond to at most one sequence of code words. Hence we must have i= b i D i, ( i rl). Hence we obtain Therefore (D l D l N ) r rl. N k= D l k l r r r, for all positive integers r. We can let r, so that l r r r inequality follows., and McMillan s

4 Problem sheet 4 4 Ex. 6 Use Huffman s encoding for the source given in example.4. (p =.6, p =., p =., p 4 =., p 5 =.5). Compare the average word length with the Shannon-Fano encoding. Also calculate the entropy H = p i log p i and compare. Ex. 7 Use Shannon-Fano encoding for the source given in example.5.4 (p =.5, p =., p =.5, p 4 =., p 5 =.5). Compare the average word length with the Hufmann coding. Also calculate the entropy H and compare. Ex. 8 Find a simple necessary condition so that in Kraft s and McMillan s inequality equality = can hold. In the noiseless coding therem, when can the lower bound be attained? Ex. 9 Compare the noiseles coding theorem with the length of a compact encoding of k binary words with equal probability p = k. Ex. You are allowed six questions that will truthfully be answered by Yes or NO. Describe briefly a strategy how one can determine one square of a chessboard (64 squares). How many questions does one need to specify one square on and n n board? Ex. Examine whether the following three codes are uniquley decipherable, prefix codes, and/or instantaneous codes. C = {,,, }, C = {,,, }, C = {,,, }. (Prove your statements). Ex. You are given a balance and nine apparently identical coins. One coin is different from the rest. Devise a strategy of three weigings to find the coin and whether it is heavier or lighter. Try to generalise.

5 Problem sheet 5 Ex. Find the compact code over {, } for a source that emits words w,... w 6 with 5 P (w ) =, P (w ) = 4, P (w ) = 6, P (w 4) = P (w 5 ) = P (w 6 ) = and compare its average length with the upper and lower bounds given by the noiseless coding theorem. Ex. 4 (easy, with simple result from probability theory.) A message consisting of N binary digits is transmitted through a binary symmetric channel having error probability p. Show that the expected number of errors is Np. Ex. 5 A code consists of 4 codewords c =, c =, c =, c 4 =. Assume that the probabilities that these words occur are P (c ) = P (c ) =, P (c ) = P (c 4 ) = 6. You use a binary symmetric channel with error probability p =. You receive. How should you decode (using the maximum likelihood method)? What is the error probability? Use the time to revise old handouts, home work, Welsh s book, or to experiment with L A TEX.

6 Problem sheet 6 6 Ex. 6 (not to be handed in) Calculate the capacity of the binary symmetric channel with error probability ε. (Go through the details of the proof given in the lecture, or read about it in Welsh s book). Ex. 7 Calculate the capacity of the binary erasure channel with error probability ε. Ex. 8 Plot the real function C : [, ] R with C(p) = + p log p + ( p) log ( p). Evaluate it for p =, p =., p =., p =.5, p =., p =.5, p =.99, p = and explain what it has to do with channels. Ex. 9 (not so relevant for the course) For a code with code word length n Given any codeword c. Count how many vectors x V n = {, } n have Hamming distance d( x, c) = t. Do the same for d( x, c) t. Using maximum likelihood decoding, which is the same as nearest neighbour decoding, i.e. received any word, decode as the nearest codeword. At most how many codewords can there be, if any two codewords have distance at least? (generally, if the minimum distance is d, where d is odd)? Let n = 7, d =. How many codewords can there be at most? Use a computer. Let n be an integer. Generate M random binary codewords of length n. Ex. A source emits words with probabilities p =, p =, p = 4, p 4 =. Study the possible code word lengths in the Huffman code(s) and compare with the word lengths of Shannon encoding. Ex. A binary symmetric channel with symbol error probability p =.5 can transmit 8 binary digits per second. How many bits can it transmit accurately per second? Hint: use the noisy coding theorem. Ex. A binary symmetric channel which can can physically transmit 8 binary digits per second, can transmit 5 digits per second with arbitrarily small error. What does this tell about the error probability of the channel? Hint: use the noisy coding theorem. Ex. State in your own words the noisy coding theorem and write a short essay about its meaning (- words).

7 Problem sheet 7 Ex. 4 Give an example to show that equality can hold in Fano s inequality. 7 Ex. 5 Two binary vectors are chosen at random. What is the probability that their Hamming distance is at least k? Ex. 6 (For programming) Let V n denote the set of binary words of length n. Choose k codewords w,..., w k at random. Let D k denote their minimum distance, i.e. the minimum distance between any pairs of two distinct codewords. Estimate the expected value by a computer simulation. (Example: for k =, 4, and n do a few thousands random tests.) Ex. 7 Given a channel with matrix ( 6 Show that the capacity is given by C = log 5 log. 6 Ex. 8 A memoryless source of entropy 5 bits per sourceword is connected to a binary symmetric channel of symbol error probability p =., which can pass binary digits per second through the receiver. At which rate can the source words be emitted if they are to be communicated accurately through the channel? 6 6 )

8 Problem sheet 8, 6 8 Ex. 9 A source S is such that, for each n, the probability distribution of X n depends on X n in the following way: P (X n X n, X n,,..., X ) = P (X n X n ) P (X n = X n = ) = P (X n = X n = ) = p P (X n = X n = ) = P (X n = X n = ) = q, where p and q = p. Show that H(S) exists and find it. Ex. 4 A source behaves as follows: it emits, each with probability, either an infinite string of zeros or a purely random string of zeros and ones. Does S have an entropy? Ex. 4 Consider a source S whose output (X n : n =,,...) is as follows: X k = for all k and (X, X, X 5,...) is a purely random source. Show that H(S) exists, but that lim n H(X n X,..., X n ) does not. Ex. 4 Consider the sources of the three problems above. Are they stationary or not? Ex. 4 A memoryless source emits only vowels, each with the following probabilities: P (A) =., P (E) =., P (I) = P (O) =., P (U) =.. Estimate the number of typical outputs of length n. (Describe what you are doing: define what you mean by typical.) Ex. 44 A memoryless source over the 6-letter alphabet has a vocabulary of about n sequences of length n, for suifficiently large n. Estimate the entropy of the source. (Hint: The answer is simple and short.) Ex. 45 (nice problem but not exam-relevant) Consider the infinite square lattice consisting of all integer-coordinated points of the plane and with nearest neighbours in the direction of the coordinate axes joined by an edge. A self avoiding walk of length n is a sequence of n edges starting from the origin, each pair of consecutive edges having a common point, and at no stage revisiting a point already visited. If f(n) denotes the number of self-avoiding walks of length n, then f() = 4, f() = and so on. Prove that and hence deduce that f(m + n) f(m)f(n), lim n (f(n)) n = inf n (f(n)) n exists. Determine f(). Draw the situation for n =,,. Prove that θ. = θ

9 Problem sheet 9, 6 9 Ex. 46 With probability, a source S emits a random string of zeros and ones; with probability, it emits a random string of ones and twos. Show that the source is not ergodic. Ex. 47 (Study the examples from the lectures:) Find the entropy of the Markov source whose transition matrix is given by. The same for ( ). Ex. 48 Which of the Markov sources having transition matrices as shown are irreducible? M =, M = M =, M 4 = 4 4

10 Problem sheet, 6 This is a relatively easy problem sheet, reflecting that the chapter is rather on observations and empirical studies. Use also the time to catch up with previous problem sheets. Good further problems for exam preparation purposes can be found on the course s webpage and at Prof. Cover s webpage. Ignore problems on material that is not covered in this course...) For exam preparation:. Revise the problem sheets.. Revise the sketched solutions.. Iterate the above, modify the questions by taking different numerical values. 4. Go through the lecture notes and/or Welsh s book. 5. Last years exam paper is available online (library, you need to login with your account). Ex. 49 What is the average length of a word in the first order approximation to English if the probability of a space is p =.8? Ex. 5 Taking the entropy of English as.5 bits, estimate the number of meaningful strings of N symbols in English. Ex. 5 If you assume H E =. bits show, assuming the noiseless coding theorem, that letters of ordinary text can be encoded in 5. characters of recorded text without loss of information. Ex. 5 Prove that the average word length in the first-order and second-order approximation to English are the same. Ex. 5 Two languages obey Zipf s law exactly, but the first has twice as many words as the second. Show that, if q and p are the probabilities of the most frequent words in the two languages, then q p q ln.

11 Problem sheet, 6 Good further problems for exam preparation purposes can be found on the course s webpage and at Prof. Cover s webpage. Ignore problems on material that is not covered in this course... Ex. 54 Read the description of the Lempel Ziv algorithm in McKay s book. Describe, in your own words the method, and briefly discuss its performance, advantages/disadvantages. How good would it be for large examples? Can the basic method be improved? Ex. 55 Encode the string using the Lempel Ziv method. Ex. 56 Decode the string., which was encoded by the basic Lempel Ziv encoding in McKay s notation.

Chapter 9 Fundamental Limits in Information Theory

Chapter 9 Fundamental Limits in Information Theory Information Theory is the fundamental theory behind information manipulation, including data compression and data transmission. 9.1 Introduction o For