Concatenated Reed-Solomon Product Code/Convolutional Code with Iterative Decoding

Nguyen M V, Ko K, and Lee W, et al.. A new scheme topredict erasures for Reed-Solomon decoder in T-DMBreceiver[J].IEEE Transactions on Broadcasting.2007, 53(2):530-538[2]Xu Chang-long. Soft decoding algorithm for RS-CCconcatenated codes in WiMAX system. IEEE VTC2007-spring. Proceedings. Vehicular Technology Conference,Dublin, Ireland, 22-25 April 2007: 740-742.[3]Aitsab O and Pyndiah R. Performance of concatenatedReed-Solomon convolutional codes with iterative decoding.IEEE GLOBECOM 97. Proceedings. GlobalTelecommunications conference, Phoenix, USA, 3-8 Nov.1997: 934-938.[4]Pyndiah R, Glavieux A, Picart A, and Jacq S. Near optimumdecoding of product codes. IEEE. GLOBECOM 94.Proceedings. Global Telecommunications conference, SanFrancisco, USA, 28 Nov.-2 Dec.1994: 339-343.[5]Aitsab O and Pyndiah R. Performance of reed-solomon blockturbo code. IEEE GLOBECOM 96. Proceedings. GlobalTelecommunications conference, London, UK, 18-22 Nov.1996: 121-125.[6]Rong Zhou, Le Bidan R, Pyndiah R, and Goalic A.Low-complexity high-rate Reed-Solomon block turbo codes[J].IEEE Transactions on Communications.2007, 55(9):1656-1660[7]Le Bidan R, Pyndiah R, and Adde P. Some results on thebinary minimum distance of Reed-Solomon codes and blockturbo codes. IEEE. ICC2007. Proceedings. communicationsconference, Glasgow, Scotland, 24-28 June 2007: 990-994.[8]Hirst S A, Honary B, and Markarian G. Fast chase algorithmwith an application in turbo decoding[J].IEEE Transactions onCommunications.2001, 49(10):1693-1699[9]Chi Zhipei, Song Leilei, and Parhi K K. On the performance/complexity tradeoff in block turbo decoder design[J].IEEETransactions on Communications.2004, 52(2):173-175[10]Clark G C Jr and Cain J B. Error-Correction Coding forDigital Communications. New York: Plenum, 1981.[11]Pyndiah R. Near-optimum decoding of product codes: blockturbo codes[J].IEEE Transactions on Communications.1998,46(8):1003-1010