• DocumentCode
    929588
  • Title

    On some properties of the undetected error probability of linear codes (Corresp.)

  • Author

    Leung-Yan-Cheong, Sik K. ; Barnes, Earl R. ; Friedman, Daniel U.

  • Volume
    25
  • Issue
    1
  • fYear
    1979
  • fDate
    1/1/1979 12:00:00 AM
  • Firstpage
    110
  • Lastpage
    112
  • Abstract
    A recent paper [1] discussed the 2^{-p} bound (where p = n- k ) for the probability of undetected error P(\\epsilon) for an (n,k) block code used for error detection on a binary symmetric channel. This investigation is continued and extended and dual codes are studied. The dual and extension of a perfect code obey the 2^{-p} bound, but this is not necessarily true for arbitrary codes that obey the bound. Double-error-correcting BCH codes are shown to obey the bound. Finally the problem of constructing uniformly good codes is examined.
  • Keywords
    BCH codes; Dual codes; Error-detecting codes; Linear codes; Block codes; Error probability; Information theory; Linear code; Parity check codes;
  • fLanguage
    English
  • Journal_Title
    Information Theory, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9448
  • Type

    jour

  • DOI
    10.1109/TIT.1979.1055991
  • Filename
    1055991