Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Let $x=(x_1x_2...x_n)$ be a binary sequence of length $n$. The Varshamov-Tenengolts code $VT_0(n)$ consists of all binary vectors $(x_1, . . . , x_n)$ satisfying $\Sigma_{i=1}^n i*x_i \equiv0 \pmod {n+1} $.

Prove that $\forall$ $x,y \in VT_0(n)$ which has equal hamming weight the Hamming distance between $x$ and $y$ is exactly 4. For a binary vectore $x$ the hamming weight is $w$ if $\Sigma_{i=1}^n x_i= w $.

share|improve this question
1  
What exactly is the question? –  Abel Stolz May 10 '11 at 8:52
add comment

1 Answer

up vote 3 down vote accepted

Take $n=11$. 11000000100 and 00111000000 are both in the code and they both have Hamming weight 3 but the Hamming distance between them is 6.

share|improve this answer
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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