Can someone help to prove this:

Theorem :

If minimum distance of C denoted as d(C)=2t+s+1, then C is a t-error correcting AND (t+s) error detecting code.

Printable View

- October 16th 2011, 06:49 PMyounhockCoding Theory Problem.
Can someone help to prove this:

Theorem :

If minimum distance of C denoted as d(C)=2t+s+1, then C is a t-error correcting AND (t+s) error detecting code.