• DocumentCode
    937218
  • Title

    Some results on the existence of binary linear codes (Corresp.)

  • Author

    Elia, Michele

  • Volume
    29
  • Issue
    6
  • fYear
    1983
  • fDate
    11/1/1983 12:00:00 AM
  • Firstpage
    933
  • Lastpage
    934
  • Abstract
    A lower bound is given on the size of a linear code of given length and distance which improves the Varshamov bound in certain cases, though not asymptotically. Specific triples (n,k,d) are given with values larger than those guaranteed by the Varshamov bound.
  • Keywords
    Linear coding; Binary codes; Hamming distance; Information theory; Linear code; Telecommunications; Vectors;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

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