Hi

A is a set of 512 binary numbers of 9 bits each.

We say that two elements in A are related if they differ from each other by no more then 2 bits.

We should find a minimal subset of A that cover all A by this relation

Please excuse my bad English