A source of uniformly-distributed randomness for an ID transmitter can, for example, be obtained by a PUF embodied in the transmitter; see [1]}. Suppose a codeword is selected by the ID transmitter uniformly at random over the pre-determined set of codewords assigned to the identifier. There exist randomized encoding algorithms with equally sized codeword sets assigned to each identifier that achieve the ID capacity [2]}. Therefore, we analyze binary constant-weight codes (CWCs), which are used to represent the equally sized codeword sets assigned to an identifier with symbol “1” and conversely codewords that cannot be chosen for a given identifier with symbol “0”, respectively, as in [3]}, [4]}, [5]}.
