Question: Consider a binary (n, M, d)-code C. Show that there always exists a binary (n ? 1, M', d)-code such that M' ? M/2. (Hint:
Consider a binary (n, M, d)-code C. Show that there always exists a binary (n ? 1, M', d)-code such that M' ? M/2. (Hint: either at least half of the codewords starts with a zero, or at least half of the codewords starts with a one.)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
