• DocumentCode
    2055912
  • Title

    Limited-trial chase-like bounded-distance decoding

  • Author

    Weber, Jos H. ; Fossorier, Marc P C

  • Author_Institution
    Delft Univ. of Technol., Netherlands
  • fYear
    2004
  • fDate
    27 June-2 July 2004
  • Firstpage
    258
  • Abstract
    The chase decoding algorithms are reliability-based algorithms achieving bounded-distance (BD) decoding for any binary linear code of Hamming distance d. The least complex version of the original chase algorithms ("Chase-3") uses O(d) trials of a conventional binary decoder. In this paper, we propose a class of Chase-like BD decoding algorithms of lower complexity than the original Chase-3 algorithm. In particular, the least complex member of this class requires only O(d23/) trials.
  • Keywords
    binary codes; linear codes; Hamming distance; Limited-trial chase decoding; binary linear code; bounded-distance decoding; AWGN; Block codes; Computational complexity; Error probability; Euclidean distance; Hamming distance; Iterative decoding; Linear code; Maximum likelihood decoding; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
  • Print_ISBN
    0-7803-8280-3
  • Type

    conf

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