Explicit construction of optimal constant-weight codes for identification via channels

The identification coding theorems of R. Ahlswede and G. Dueck (1981) have shown that for any nonzero probabilities of missed and false identification, it is possible to transmit exp(exp(nR)) messages with n uses of a noisy channel, where R is as close as desired to the Shannon capacity of the channel. That capability is achieved by the identification codes explicitly constructed with a three-layer concatenated constant-weight code used in conjunction with a channel transmission code of rate R.<
>