Hi, my problem is as follows...I have calculated that the number of elements having integral coordinates, at a distance of upto 2 from any given point is 12, not counting the central element itself.

I would like an algorithmic construction to give me all sets of points at a distance 5 from each other, having integral coordinates , ie(3,4),(9,4),(0,0).

Golomb and Welch had given a similar construction for elements at a distance 3 from each other in the '71 paper on lee metric codes.

Kindly help me!!!