Perfect Difference Set
A set of residues {a_1,a_2,...,a_(k+1)} (mod n) such that every nonzero residue can be uniquely expressed in the form a_i-a_j. Examples include {1,2,4} (mod 7) and {1,2,5,7} (mod 13). A necessary condition for a difference set to exist is that n be of the form k^2+k+1. A sufficient condition is that k be a prime power. Perfect sets can be used in the construction of Golomb rulers.
See also
Golomb RulerExplore with Wolfram|Alpha
WolframAlpha
More things to try:
References
Guy, R. K. "Modular Difference Sets and Error Correcting Codes." §C10 in Unsolved Problems in Number Theory, 3rd ed. New York: Springer-Verlag, pp. 181-183, 2004.Referenced on Wolfram|Alpha
Perfect Difference SetCite this as:
Weisstein, Eric W. "Perfect Difference Set." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/PerfectDifferenceSet.html