Fast algorithm for generating candidate codewords in reliability-based maximum likelihood decoding

Hideki Yagi, Toshiyasu Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticle

4 Citations (Scopus)


We consider the reliability-based heuristic search methods for maximum likelihood decoding, which generate test error patterns (or, equivalently, candidate codewords) according to their heuristic values. Some studies have proposed methods for reducing the space complexity of these algorithms, which is crucially large for long block codes at medium to low signal to noise ratios of the channel. In this paper, we propose a new method for reducing the time complexity of generating candidate codewords by storing some already generated candidate codewords. Simulation results show that the increase of memory size is small.

Original languageEnglish
Pages (from-to)2676-2683
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Issue number10
Publication statusPublished - 2006 Oct



  • Binary block codes
  • Maximum likelihood decoding
  • Most reliable basis
  • Priority-first search
  • Reliability

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this