A set of integers ${\displaystyle A=\{a_{1},a_{2},...,a_{m}\}}$ where ${\displaystyle a_{1}<a_{2}<...<a_{m}}$ is a Golomb ruler if and only if $$ \text{for all } i,j,k,l \in \{1,2,...,m\} {\text{ such that }} i\neq j {\text{ and }} k\neq l, a_{i}-a_{j}=a_{k}-a_{l}\iff i=k{\text{ and }}j=l. $$
A modular Goloumb ruler works the same, not on a line but on a circle of length $q$. I wonder how these rulers are connected to sets $B=\{b_1,b_2,...,b_m\}$, where $b_1<b_2<...<b_m$ and the sum $b^\star=\sum_{k=1}^m b_k \bmod q$ is unique, in the sense, that every other sum of $m$ elements of $B$ (e.g. $b^{\text{other}_1}=2b_1+b_3+...b_m \bmod q$), has a value other than $b^\star$. So I don't bother if $b^{\text{other}_k}=b^{\text{other}_l}$, only $b^\star$ shall be unique.
Can Goloumb Ruler help to generate the sets $B$ as well?
They were for example given in this answer, to a question that looks similar to my question...