0
$\begingroup$

I wonder how can I construct 4 (distinct) codewords given the fact that code distance is 5. As far as I know that the code distance is the number of distinct bits between any 2 codewords. How to achieve this code distance for the 6 possible pairs from the 4 codewords available(of any bit length). I named, for example, codewords u, v, w, & x so d(u,v) = d(u,w) = d(u,x) = d(v,w) = d(v,x) = d(w,x) = 5. The code words must be in binary format i.e 00100 10011. I considered a code length of 10 to achieve this but still struggling to find a solution.

$\endgroup$
1
  • $\begingroup$ A code has distance 5 if any two different codewords are at distance at least 5. It has minimum distance 5 if the minimum distance between two different codewords is 5. $\endgroup$ – Yuval Filmus Dec 6 '20 at 14:58
1
$\begingroup$
0000000000
1111100000
0000011111
1111111111
$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.