This preview shows page 1. Sign up to view the full content.
Unformatted text preview: { .X 1 X 2 X 3 X 4 X 5 < . 01110 } = .F 1 F 2 ... . (b) How many bits .F 1 F 2 ... can be known for sure if it is not known how X = 01110 continues? 3. LempleZiv. Give the LZ78 parsing and encoding of 00000011010100000110101. 4. Compression of constant sequence. We are given the constant sequence x n = 1111 ... (a) Give the LZ78 parsing of this sequence. (b) Argue that the number of encoding bits per symbol for this sequence goes to zero as n . 1...
View
Full
Document
This note was uploaded on 06/10/2008 for the course ECE 376B taught by Professor Tomcover during the Spring '05 term at Stanford.
 Spring '05
 TomCover

Click to edit the document details