We consider a communication problem closely related to reliable communications via a point-to-point (P2P) channel [1]}, [2]}. Similar to the P2P channel model, a transmitter encodes an identifier, not known before encoding, into a codeword that is sent through a noisy channel such that a receiver observes a noisy codeword. Unlike the P2P channel model where the receiver decodes the observed noisy codeword, the receiver in the identification (ID) problem is interested in the reliable result of the binary hypothesis test whether the transmitted identifier is the identifier of interest for him. Since the transmitted information of interest for each receiver is fixed, it is considered as an identifier for the corresponding receiver; therefore, this hypothesis testing problem is called the identification via channels problem [3]}.
