Abstract
A search algorithm for stopping sets in a Tanner graph is proposed for designing good low-density parity-check (LDPC) codes. By applying the belief-propagation algorithm with messages containing the information of originated variable nodes and their connected edges, the stopping sets can be detected. Furthermore, a code design method using the algorithm is presented and the performances of the designed code over several channels are shown.
Original language | English |
---|---|
Article number | 1523486 |
Journal | IEEE International Symposium on Information Theory - Proceedings |
Volume | 2005-January |
DOIs | |
Publication status | Published - 2005 |
Externally published | Yes |
Event | 2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 2005 Sept 4 → 2005 Sept 9 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Modelling and Simulation
- Applied Mathematics