• DocumentCode
    818366
  • Title

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

  • Author

    Verdu, Sergio ; Wei, Victor K.

  • Author_Institution
    Dept. of Electr. Eng., Princeton Univ., NJ, USA
  • Volume
    39
  • Issue
    1
  • fYear
    1993
  • fDate
    1/1/1993 12:00:00 AM
  • Firstpage
    30
  • Lastpage
    36
  • 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 R
  • Keywords
    encoding; error correction codes; telecommunication channels; Shannon capacity; channel transmission code; constant-weight codes; identification codes; identification via channels; noisy channel; optimal codes; three layer concatenated code; Capacity planning; Channel capacity; Channel coding; Concatenated codes; Decoding; Error probability; Information theory; Memoryless systems;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.179339
  • Filename
    179339
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=818366