This preview shows page 1. Sign up to view the full content.
Unformatted text preview: measure. 3. Problem 1.2 of Ron Roths text (page 19) 4. Problem 1.3 of Ron Roths text (page 19) 5. Problem 1.12 of Ron Roths text (page 22) A Grade Problems: additional question 6. GKOF_UJF_IFPFTBVPT_NCUTJZ_PH_B_[8,4,4]_EPFF. A+ Grade Problems: additional question 7. Let C be a circular sequence of zeros and ones of length 2 n , such that all the binary sequences of length n appear as subsequences of C (here, subsequence implies that the elements are taken in consecutive order). Here is an example: 0000111100101101. The sequence C is usually called a deBruijn sequence. Come up with an example of a deBrujin sequence of length 32. Do you see a way to construct these sequences? Can you find a lower or upper bound on their size? Remark: these sequences are closely tied to a well-known class of ECC, and they have applications for data scrambling as well....
View Full Document
- Fall '08