• DocumentCode
    977538
  • Title

    Capacity bound for a noiseless T-user binary adder channel

  • Author

    Mow, W.H.

  • Author_Institution
    Lehrstuhl fur Nachrichtentechnik, Tech. Univ. Munchen, Germany
  • Volume
    32
  • Issue
    13
  • fYear
    1996
  • fDate
    6/20/1996 12:00:00 AM
  • Firstpage
    1157
  • Lastpage
    1158
  • Abstract
    The author proves an upper bound on the sum capacity of a noiseless T-user binary adder channel, thus settling a conjecture made by Chang and Weldon (1979). The bound is asymptotically tight and enables a more accurate performance evaluation of some very recent code constructions
  • Keywords
    channel capacity; codes; information theory; multi-access systems; binary adder channel; capacity bound; code constructions; noiseless T-user channel; performance evaluation; upper bound;
  • fLanguage
    English
  • Journal_Title
    Electronics Letters
  • Publisher
    iet
  • ISSN
    0013-5194
  • Type

    jour

  • DOI
    10.1049/el:19960817
  • Filename
    502973
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=977538