# Coding Theory

• Oct 7th 2012, 12:28 AM
hky
Coding Theory
Hi Guys

I just got some problem about coding theory and I don't quite understand what question 2 is asking.

Can you guys help me?

Thanks a lot.
• Oct 7th 2012, 07:07 PM
ZeroDivisor
Re: Coding Theory
A code is perfect if the balls of radius e centered at codewords cover the whole vector space. The Hamming bound is obtained by counting the number of vectors
contained in disjoint balls of radius e centered around codewords (left hand side). This is less than or equal to the number of vectors in the whole vector space
(right hand side). So, the difference in the LHS and RHS in the Hamming bound comes from the vectors that are NOT covered by balls of radius e centered around codewords.
But, for a perfect code, there are no such vectors, hence we have equality in the Hamming bound.
• Oct 9th 2012, 10:58 PM
hky
Re: Coding Theory
Would you mind tell me more especially question 2A) part c?
• Oct 10th 2012, 07:53 PM
hky
Re: Coding Theory
hello, can someone give me a hand? Please.
• Oct 11th 2012, 06:36 PM
hky
Re: Coding Theory
I think that is harder than I thought.