for an information word M with m bits that is coded as following:
- M is coded into a word A using an unknown code that allows detection of not more than one error.
- the code word is the word obtained by a concatenation of A to itself. so A becomes AA and etc..
1)is it possible to know the overhead in the given code?
2)is it possible to know the distance of the code?
after thinking on it again and rereading the text, i began to realize(hopefully i am right now) that the question is about parity bit and not hamming. so if it can detect not more than one error, there's a parity bit, i think. based on that thought i tried to solve it:
1)I began to realize it's not about hamming code. if we can only detect not more than one error, then it's about the parity bit. so i think that if we add a bit to each byte of message, then the overhead will be 9 bytes total. so it can be calculated, i think.
2)since this sub problem is about the concatenation of A to itself, then like @YuvalFilmus said, the minimal distance should be twice now.
is it correct now? would really appreciate your comments and help.
thank you very much