An improvement to GMD-like decoding algorithms

Hitoshi Tokushige, Takuya Koumoto, Tadao Kasami

Research output: Contribution to journalArticle


For binary linear block codes, we introduce "multiple GMD decoding algorithm", where GMD-like decoding is iterated around a few appropriately selected search centers. Compared with the original GMD decoding by Forney [1], this decoding algorithm provides better error performance with increasing the number of iterations of erasure and error correction moderately. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.

Original languageEnglish
Number of pages1
JournalIEEE International Symposium on Information Theory - Proceedings
Publication statusPublished - Jan 1 2000


ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Cite this