Two-stage iterative decoding algorithms for a class of cyclic codes
This paper presents a class of iteratively decodable cyclic codes. Codes in this class have large minimum distance; however, their Tanner graphs contain many short cycles of length 4. With the conventional iterative decoding based on belief propagation, these short cycles significantly degrade the e...
Saved in:
| Published in: | 2010 IEEE Information Theory Workshop on Information Theory pp. 1 - 5 |
|---|---|
| Main Authors: | , , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
IEEE
01.01.2010
|
| Subjects: | |
| ISBN: | 9781424463725, 1424463726 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!

