Let $C$ be a $[n, k]$ linear code over $\mathbb{F}_q$.
I want to calculate the covering radius of the Hamming codes.
I have thought the following:
Since the Hamming distance is $3$, the coverig radius will always be $3$.
Am I right?
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It only takes a minute to sign up.
Sign up to join this communityLet $C$ be a $[n, k]$ linear code over $\mathbb{F}_q$.
I want to calculate the covering radius of the Hamming codes.
I have thought the following:
Since the Hamming distance is $3$, the coverig radius will always be $3$.
Am I right?
The Hamming codes are perfect codes. This means that balls of radius $(d-1)/2$ (where $d$ is the minimal distance) centered around the codewords partition the space. In particular, the covering radius is $(d-1)/2$.