Explicit construction of optimal constant-weight codes for identification via channels
- 1 January 1993
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 39 (1) , 30-36
- https://doi.org/10.1109/18.179339
Abstract
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 RKeywords
This publication has 8 references indexed in Scilit:
- Approximation theory of output statisticsIEEE Transactions on Information Theory, 1993
- New results in the theory of identification via channelsIEEE Transactions on Information Theory, 1992
- Error-correcting codes for list decodingIEEE Transactions on Information Theory, 1991
- On identification via multiway channels with feedbackIEEE Transactions on Information Theory, 1991
- Efficient dispersal of information for security, load balancing, and fault toleranceJournal of the ACM, 1989
- Identification via channelsIEEE Transactions on Information Theory, 1989
- An improvement of the Gilbert bound for constant weight codes (Corresp.)IEEE Transactions on Information Theory, 1987
- Modular curves and codes with a polynomial constructionIEEE Transactions on Information Theory, 1984