Coding Theory Construction of binary code with a fixed minimum distance

[xenonforlife]

Hi All,

I came across this problem in which I am required to construct a binary code with code length = 6 and the number of code words = 8 and the condition being that minimum distance between any two code words should be >= 3. Now I have solved this problem just by using a hit and trial approach. I wish to know if there is a systematic way to approach this problem.

Thanks

 

[SlipEternal]

I am pretty sure the algorithm would be NP complete. Trial and error is probably the easiest way to solve it.

Edit: What do you mean by distance, by the way? I am assuming that a distance of 3+ would mean that for two different words, they have at least 3 bits that are different.

 

[xenonforlife]

yep i meant exactly that...atleast three bits different