Abstract
The identification coding theorems of Ahlswede and Dueck have shown that for any nonzero probabilities of missed and false identification, it is possible to transmit exp (exp (n R))) 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.
Original language | English (US) |
---|---|
Pages (from-to) | 30-36 |
Number of pages | 7 |
Journal | IEEE Transactions on Information Theory |
Volume | 39 |
Issue number | 1 |
DOIs | |
State | Published - Jan 1993 |
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Science Applications
- Library and Information Sciences
Keywords
- Identifteation via ehannels
- Reed-Solomon eodes
- eoneatenated eodes
- eonstant-weight eodes