We introduce ordered-angle coding for binary-unanimity testing among n transformation-only users in a serial quantum architecture inherited from Loop-Back communication. User B_i fixes one private sign across a logical word and applies $R(s_i\alph
We introduce ordered-angle coding for binary-unanimity testing among n transformation-only users in a serial quantum architecture inherited from Loop-Back communication. User B_i fixes one private sign across a logical word and applies R(s_i\alpha_j) in trial j. If w users choose the negative sign, serial composition gives R[(n-2w)\alpha_j]. We show that every fixed same-axis pulse that is deterministic for both unanimous inputs under the binary Bell readout has \alpha_j=q_j\pi/(2n) with integer q_j. For a nonadaptive word \mathbf q=(q_1,\ldots,q_m), a mixed Hamming weight imitates the unanimous signature with probability \[ M_{\mathbf q}(w)=\prod_{j=1}^{m}\cos^2\!\left(\frac{\pi q_jw}{n}\right). \] Within this complete deterministic-unanimity pulse family, a finite perfect word exists if and only if n is a power of two. For n=2^r, the dyadic word (1,2,4,\ldots,2^{r-1}) is exact and pulse-minimal with m_{\min}=r=\log_2n trials. It replaces the O(n^2\log(1/\varepsilon)) worst-case burden of repeated smallest-angle tests by exact O(\log n) verification. Odd primes instead admit balanced statistical words with uniform mixed-weight imitation 2^{-(p-1)}. For actual operations R(s_i\alpha_j+\delta_{ij}), an ideal rejecting position is lifted to \sin^2\Delta_j, where \Delta_j=\sum_i\delta_{ij}. This yields explicit robustness bounds with angular and binary-readout errors. Bell entanglement is not required for the additive algebra, but it keeps the traveler locally maximally mixed in every honest trial. We therefore present the result as a coded multiuser relation primitive with optional raw conference-key-candidate use, not as a composably secure conference-key protocol.