Question: Recall that a q - ary ( n , M , 2 t + 1 ) code satisfies M ( k = 0 t (

Recall that a q
-ary (n,M,2t+1)
code satisfies
M(k=0t(nk)(q1)k)<=qn
(sphere-packing bound). Give an example of a q
-ary (n,M,2t+1)
code for which a sharper bound
M(k=0t+1(nk)(q1)k)<=qn
doesn't hold.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!