JEST 2019

Question

Let ${(0,1)}^n$ set of all binary string of length n. Hamming sphere of radius around a string C in ${(0,1)}^n$ is the set of all strings d$\epsilon$ ${(0,1)}^n$ that differ from C in at most r of n position, S(C,r) for n=2k+1  

• A. For C,C’ $\epsilon$ ${(0,1)}^n$ S(C,k) and S(C’,k) are disjoint

couldn't remember rest of the options.

 

Comments

1.  
2. For,C’ ϵϵ (0,1)n(0,1)n S(C,k) and S(C’,k+1) are disjoint
3. For,C’ ϵϵ (0,1)n(0,1)n S(C,k+1) and S(C’,k+1) are disjoint
4. For,C’ ϵϵ (0,1)n(0,1)n S(C,k) and S(C’,k) are not disjoint

---

I was getting only option A as correct