• DocumentCode
    2257862
  • Title

    If binary codes existed that exceed Gilbert-Varshamov bound they could not reach the cutoff rate of BSC

  • Author

    Beth, Thomas ; Lazic, Dejan E.

  • Author_Institution
    Fakultat fur Inf., Karlsruhe Univ., Germany
  • fYear
    1995
  • fDate
    17-22 Sep 1995
  • Firstpage
    132
  • Abstract
    Binary block codes exceeding the Gilbert-Varshamov bound on the minimum Hamming distance (if such codes exist) have their error exponents below the one of the binary symmetric channel (BSC) in the interval (Rcrit, Rc) and they cannot reach the cutoff rate R0 and thus the capacity Rc of the BSC if a maximum likelihood decoder (MLD) is used
  • Keywords
    binary sequences; block codes; channel capacity; coding errors; error statistics; maximum likelihood decoding; Gilbert-Varshamov bound; binary block codes; binary symmetric channel; channel capacity; channel code; cutoff rate; error exponents; maximum likelihood decoder; minimum Hamming distance; AWGN channels; Australia; Binary codes; Block codes; Decoding; Entropy; Euclidean distance; Hamming distance; Upper bound;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
  • Conference_Location
    Whistler, BC
  • Print_ISBN
    0-7803-2453-6
  • Type

    conf

  • DOI
    10.1109/ISIT.1995.531336
  • Filename
    531336
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2257862