TY - GEN
T1 - Two-stage iterative decoding algorithms for a class of cyclic codes
AU - Zhang, Li
AU - Huang, Qin
AU - Lin, Shu
PY - 2010
Y1 - 2010
N2 - 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 error performance of the codes. To avoid the degrading effect of these short cycles in performance, two-stage iterative decoding algorithms are devised. Cyclic codes have encoding advantage over other linear block codes. Encoding of a cyclic code in systematic form can be implemented with a single feedback shift-register.
AB - 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 error performance of the codes. To avoid the degrading effect of these short cycles in performance, two-stage iterative decoding algorithms are devised. Cyclic codes have encoding advantage over other linear block codes. Encoding of a cyclic code in systematic form can be implemented with a single feedback shift-register.
UR - https://www.scopus.com/pages/publications/77954828724
U2 - 10.1109/ITWKSPS.2010.5503173
DO - 10.1109/ITWKSPS.2010.5503173
M3 - 会议稿件
AN - SCOPUS:77954828724
SN - 9781424463725
T3 - IEEE Information Theory Workshop 2010, ITW 2010
BT - IEEE Information Theory Workshop 2010, ITW 2010
T2 - IEEE Information Theory Workshop 2010, ITW 2010
Y2 - 6 January 2010 through 8 January 2010
ER -