• DocumentCode
    2086635
  • Title

    Information-set soft-decision decoding

  • Author

    Dumer, Ilya

  • Author_Institution
    Coll. of Eng., California Univ., Riverside, CA, USA
  • fYear
    1998
  • fDate
    22-26 Jun 1998
  • Firstpage
    77
  • Lastpage
    78
  • Abstract
    Information-set decoding is considered for soft decision channels. The sets of most plausible error patterns are represented as ellipsoids in Hamming spaces, and their minimum coverings are designed by random search. For general linear codes, maximum likelihood decoding with the lowest known complexity is obtained
  • Keywords
    binary codes; coding errors; computational complexity; linear codes; maximum likelihood decoding; random processes; search problems; set theory; Hamming spaces; binary linear code; complexity; ellipsoids; error patterns; general linear codes; information-set soft-decision decoding; maximum likelihood decoding; minimum coverings; minimum distance decoding; random search; soft decision channels; Educational institutions; Ellipsoids; Entropy; Equations; Error correction; Linear code; Maximum likelihood decoding; Testing; Upper bound; Vectors;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory Workshop, 1998
  • Conference_Location
    Killarney
  • Print_ISBN
    0-7803-4408-1
  • Type

    conf

  • DOI
    10.1109/ITW.1998.706443
  • Filename
    706443
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2086635