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: A Range Problems 1 4) Roth text, problem 4.14. You are allowed to search online for perfect ternary codes. 5) SVHITDXEHOERCPRUOEERASTNPBMOHTFTLTFSNIETRLFMAEO The space symbols are not encrypted. A+ Range Problems 6) The covering radius of a code is the largest weight of a coset leader of the code. What can you say about the covering radius of perfect codes? Can you nd an upper bound on the covering radius of an arbitrary linear block code? The covering radius of codes that meet the Singleton bound, Griesmer bound (i.e. can you tell if there is any connection at all between the covering radius and the bounds at hand)? 2...
View Full Document
- Fall '08