by bebchuk - Thursday, 23 June 2016 16:02:00
In question #8, we need to find the maximum hamming distance.
what does it mean? the biggest hamming distance between all possible pairs in a set of words? (same as minimum, but biggest).
If so, what are the rules of detecting and fixing errors?
by shaera - Thursday, 23 June 2016 21:35:20
if by "rules" you mean 'what is the way of calcualate detecting and fixing errors, you can found it at the practical session.
assume d is the hamming distance then:
detecting & fixing erasing = d-1
fixing errors = [(d-1)/2] lower value.
by saarsch - Sunday, 26 June 2016 18:53:29
This answer fits the definition of MINIMUM hamming distance. The question asks for MAXIMUM hamming distance.
What does it mean? simply the biggest hamming distance possible? if so, we assume the same formulas do not apply...
Re: maximum hamming distance
by sadetsky - Wednesday, 29 June 2016 00:12:36
this means: try to build code words so that the the hamming distance of the this code would be the maximal possible