Explicit Construction of Optimal Constant-Weight Codes for Identification via Channels

Sergio Verdú

Research output: Contribution to journalArticlepeer-review

43 Scopus citations


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 languageEnglish (US)
Pages (from-to)30-36
Number of pages7
JournalIEEE Transactions on Information Theory
Issue number1
StatePublished - Jan 1993

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


  • Identifteation via ehannels
  • Reed-Solomon eodes
  • eoneatenated eodes
  • eonstant-weight eodes


Dive into the research topics of 'Explicit Construction of Optimal Constant-Weight Codes for Identification via Channels'. Together they form a unique fingerprint.

Cite this