Hi everyone. I need to pick a set of 65 points p(x,y,z) in a 3D space of 274625 points; as the set picked should provide the maximum possible minimum Hamming distance. (Consider the Hamming bound for sphere packing). Can anybody please help me with developing an algorithm for naming these 65 discrete points? Thanks, Tan

Hammingdistance is clear (see also D.Roberts' comment). – Noam D. Elkies Aug 15 '12 at 12:30