Reliability-based code-search algorithms for maximum-likelihood decoding of block codes

David Gazelle*, Jakov Snyders

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Efficient code-search maximum-likelihood decoding algorithms, based on reliability information, are presented for binary linear block codes. The codewords examined are obtained via encoding. The information set utilized for encoding comprises the positions of those columns of a generator matrix G of the code which, for a given received sequence, constitute the most reliable basis for the column space of G. Substantially reduced computational complexity of decoding is achieved by exploiting the ordering of the positions within this information set. The search procedures do not require memory; the codeword to be examined is constructed from the previously examined codeword according to a fixed rule. Consequently, the search algorithms are applicable to codes of relatively large size. They are also conveniently modifiable to achieve efficient nearly optimum decoding of particularly large codes.

Original languageEnglish
Pages (from-to)239-249
Number of pages11
JournalIEEE Transactions on Information Theory
Volume43
Issue number1
DOIs
StatePublished - 1997

Keywords

  • Block codes
  • Code-search
  • Maximum-likelihood decoding
  • Ordered basis
  • Ordered information set
  • Partial ordering

Fingerprint

Dive into the research topics of 'Reliability-based code-search algorithms for maximum-likelihood decoding of block codes'. Together they form a unique fingerprint.

Cite this