### Abstract

The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Cond_{h} for 1 ≤ h ≤ 3 is evaluated by simulation.

Original language | English |
---|---|

Title of host publication | IEEE International Symposium on Information Theory - Proceedings |

Publisher | IEEE |

Pages | 470 |

Number of pages | 1 |

Publication status | Published - 1995 |

Externally published | Yes |

Event | Proceedings of the 1995 IEEE International Symposium on Information Theory - Whistler, BC, Can Duration: Sep 17 1995 → Sep 22 1995 |

### Other

Other | Proceedings of the 1995 IEEE International Symposium on Information Theory |
---|---|

City | Whistler, BC, Can |

Period | 9/17/95 → 9/22/95 |

### Fingerprint

### ASJC Scopus subject areas

- Electrical and Electronic Engineering
- Applied Mathematics
- Modelling and Simulation
- Theoretical Computer Science
- Information Systems

### Cite this

*IEEE International Symposium on Information Theory - Proceedings*(pp. 470). IEEE.

**Least stringent sufficient condition on the optimality of suboptimally decoded codewords.** / Kasami, Tadao; Kusaka, Takuya; Takata, Toyoo; Fujiwara, Toru; Lin, Shu.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*IEEE International Symposium on Information Theory - Proceedings.*IEEE, pp. 470, Proceedings of the 1995 IEEE International Symposium on Information Theory, Whistler, BC, Can, 9/17/95.

}

TY - GEN

T1 - Least stringent sufficient condition on the optimality of suboptimally decoded codewords

AU - Kasami, Tadao

AU - Kusaka, Takuya

AU - Takata, Toyoo

AU - Fujiwara, Toru

AU - Lin, Shu

PY - 1995

Y1 - 1995

N2 - The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.

AB - The number of iterations of an iterative optimal or suboptimal decoding scheme for binary linear block codes without any effect on its error performance can be reduced by testing a sufficient condition on the optimality of a candidate codeword. In this paper, the least stringent sufficient condition on the optimality of a decoded codeword is investigated under the assumption that the available information on the code is restricted to the minimum weight or the distance profile and for a given positive integer h, h or fewer already generated candidate codewords. The least stringent sufficient conditions of optimality for 1 ≤ h ≤ 3 are presented. As examples, the Chase Algorithm (Chase, 1972) and two iterative decoding algorithms (from Kasami et al., 1995) are considered. Majority-logic decoding with randomly breaking ties is used to generate candidate codewords. The effectiveness of Condh for 1 ≤ h ≤ 3 is evaluated by simulation.

UR - http://www.scopus.com/inward/record.url?scp=0029179920&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029179920&partnerID=8YFLogxK

M3 - Conference contribution

SP - 470

BT - IEEE International Symposium on Information Theory - Proceedings

PB - IEEE

ER -