
#1
May1013, 07:05 PM

P: 29

does a hamming code always corrects one error and detect 2 errors ? and is the distance always 3 ?
I know that that is true for (7,4) hamming code but does that apply to a (11,7) or (15,11) ? if not please let me how to get the answers 



#2
May1113, 08:19 AM

Mentor
P: 10,846

I think the Hamming distance of 3 is used for the definition of "Hamming code". You can use codes with more additional bits to get more error detection/correction, but (7,4), (15,11) and so on are always 2 bits detection / 1 bit correction.




#3
May1113, 09:11 AM

P: 951

Hamming codes are class of codes that have [itex] (2^{m}1, 2^{m}m1,3) [/itex] which means that they all correct one and only one error. I don't know about detection of those other two, I am not familiar with that. But the distance of 3 dictates that they can correct only one error.




#4
May1113, 10:00 AM

P: 29

does a hamming code always corrects one error and detect 2 errors ?
sorry I meant is the minimum distance always 3 ?




#5
May1113, 12:34 PM

P: 951




Register to reply 
Related Discussions  
Hamming Code, Parity Matrix  Linear & Abstract Algebra  0  
Hamming code and distance  Programming & Computer Science  1  
Hamming Code  Engineering, Comp Sci, & Technology Homework  1  
Finding the decoding transformation for a hamming code  Calculus & Beyond Homework  4  
Question about a hamming (7,4) code  Introductory Physics Homework  0 