On optimal error exponents in noiseless channel identification
Marat Valievich Burnashev, H. Yamamoto · 2017
Recently Yamamoto and Ueda proposed multiple object identification (MOID) codes to identify multiple objects via a channel at once, which is an extension of identification (ID) codes. They gave the explicit construction of MOID codes and derived the achievable triplet of coding rate R, the error exponents E1and E2of type I and type II decoding error probabilities. However, they did not treat the converse problem of the coding theorem. In this paper, we consider the coding rate of multiple objects Rkin addition to R, E1, and E2, and derive a condition that (R, Rk, E1, E2) must satisfy for any MOID codes of noiseless channels.