• DocumentCode
    927809
  • Title

    An upper bound for codes in a two-access binary erasure channel (Corresp.)

  • Author

    Van Tilborg, Henk C.

  • Volume
    24
  • Issue
    1
  • fYear
    1978
  • fDate
    1/1/1978 12:00:00 AM
  • Firstpage
    112
  • Lastpage
    116
  • Abstract
    A method for determining an upper bound for the size of a code for a two-access binary erasure channel is presented. For uniquely decodable codes, this bound gives a combinatorial proof of a result by Liao. Examples of the bound are given for codes with minimum distance 4.
  • Keywords
    Coding; Multiple-access communications; Decoding; Mathematics; Propulsion; Space technology; Upper bound; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1978.1055814
  • Filename
    1055814
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=927809