• DocumentCode
    1424539
  • Title

    The smallest list for the arbitrarily varying channel

  • Author

    Hughes, Brian L.

  • Author_Institution
    Dept. of Electr. & Comput. Eng., Johns Hopkins Univ., Baltimore, MD, USA
  • Volume
    43
  • Issue
    3
  • fYear
    1997
  • fDate
    5/1/1997 12:00:00 AM
  • Firstpage
    803
  • Lastpage
    815
  • Abstract
    The capacity of the discrete memoryless arbitrarily varying channel (AVC) is investigated for deterministic list codes with fixed list size L. For every AVC with positive random code capacity Cr , a nonnegative integer M called the symmetrizability is defined. For the average probability of error criterion, it is shown that the list capacity is given by C(L)=Cr for L>M and C(L)=0 otherwise. Bounds are given which relate Cr and M. Also, explicit formulas for C(L) are given for a family of noiseless, additive AVCs
  • Keywords
    channel capacity; channel coding; discrete systems; error statistics; memoryless systems; time-varying channels; average probability of error criterion; capacity; deterministic list codes; discrete memoryless arbitrarily varying channel; list capacity; random code capacity; smallest list; symmetrizability; Additive noise; Automatic voltage control; Capacity planning; Channel capacity; Channel coding; Decoding; Error probability; Helium; Information theory; Jamming;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/18.568692
  • Filename
    568692
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=1424539