A direct approach for decoding product codes

Kobi Ovadya, Ofer Amrani*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially "distorts" the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity.

Original languageEnglish
Article number1523514
JournalIEEE International Symposium on Information Theory - Proceedings
StatePublished - 2005
Event2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia
Duration: 4 Sep 20059 Sep 2005


  • Bounded-distance decoding
  • Clipping
  • Decision region
  • Product codes
  • Projection


Dive into the research topics of 'A direct approach for decoding product codes'. Together they form a unique fingerprint.

Cite this