1. Let C be an [n, k] code over F2 that can correct two errors. Use the sphere packing bound to prove that the number of redundancy entries, n-k, is more than 2 log2 n - 1.

Linear Algebra: A Modern Introduction
4th Edition
ISBN:9781285463247
Author:David Poole
Publisher:David Poole
Chapter3: Matrices
Section3.7: Applications
Problem 74EQ
icon
Related questions
Question
5
1. Let C be an [n, k] code over F2 that can correct two errors. Use the sphere
packing bound to prove that the number of redundancy entries, n - k, is
more than 2 log, n - 1.
Transcribed Image Text:1. Let C be an [n, k] code over F2 that can correct two errors. Use the sphere packing bound to prove that the number of redundancy entries, n - k, is more than 2 log, n - 1.
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer