|
[1] E. R. Berlekamp, R. E. peile, and S. P. Pope, “The application of error control to communications,” IEEE Commun. Mag, vol.25, pp. 44-57, 1987. [2] W. W. Wu, D. Haccoun, R. E. peile, and Y. Hirata, “Coding for satellite communication,” IEEE J. Select. Areas Commun, vol. SAC-5, pp. 724 785, 1987. [3] Consultative Committee for Space Data Systems, “Recommendations for Space Data System Standards: Telemetry Channel Coding, Blue Book, 1984. [4] E. R. Berlekamp, J. Shifman, and W. Toms, “An application of Reed Solomon codes to a satellite TDMA system, MILCOM’86, Monterey, CA. [5] B. C. Mortimer, M. J. Moore, and M. Sablatash, “The design of a high performance error-correcting coding scheme for the Canadian broadcast telidon system based on Reed-Solomon codes,” IEEE Trans. Commun., vol. COM-35, pp. 1113-1138, 1987. [6] M. B. Pursley and W. E. Stark, “Performance of Reed-Solomon coded frequency-hop spread-spectrum communication in partial-band interfer ence,” IEEE Trans. Commun., vol. COM-33, pp. 767-774, 1985. [7] M. P. C. Fossorier and A. Valembois, “Reliability-based decoding of Reed Solomon codes using their binary image,” IEEE Commun. Lett., vol. 7, pp. 452-454, Jul. 2004. [8] J. Jiang, K. R. Narayanan, “Iterative soft-input soft-output decoding of Reed-Solomon codes by adapting the parity-check matrix,” IEEE Trasn. Inf. Theory, vol. 52, no. 8, 2006. [9] W.J.Gross,F.R.Kschischang R.Koetter, and P. G. Gulak, “Applications of algebraic soft-decision decoding of Reed-Solomon codes,” IEEE Trans. Communi., vol. 54, no. 7, pp. 1224-1234, Jul. 2006. [10] H. Tang, Y. Liu, M. P. C. Fossorier, and S. Lin, “Combining Chase-2 and GMD decoding algorithms for nonbinary block codes,” IEEE Commun. Lett., vol. 5, no. 5, pp. 209-211, May 2000. [11] A. V. Casado, M. Griot, and R. Wesel, “LDPC decoders with informed dynamic scheduling,” IEEE Trans. on Commun., vol. 58, no. 12, pp. 3470-3479, Dec. 2010 [12] H.-C. Lee, Y.-L. Ueng, S.-M. Yeh, and W.-Y. Weng, “Two informed dy namic scheduling strategies for iterative LDPC decoder,” IEEE Trans. on Commun., vol. 61, no. 3, pp. 886-896, Mar. 2013. [13] H.-C. Lee and Y.-L. Ueng, “Informed dynamic schedules for LDPC decod ing using belief propagation,” in Proc. 24th IEEE Int. Symp. on Personal Indoor and Mobile Radio Communications (PIMRC 2013), London, UK, 8-11 Sept., 2013. [14] H.-C. Lee and Y.-L. Ueng, “LDPC decoding scheduling for faster conver gence and lower error floor,” IEEE Trans. on Commun., vol. 62, no. 9, pp. 3104-3113, Sept. 2014. [15] V. Guruswami and M. Sudan, “Improved decoding of ReedSolomon and algebraic-geometric codes,” IEEE Trans. Inf. Theory, vol. 45, pp. 1757 1767, Sept. 1999. [16] R. Koetter and A. Vardy, “Algebraic soft-decision decoding of Reed Solomon codes,” IEEE Trans. Inf. Theory, 49: 2809-2825, November 2003. [17] A. Kothiyal and O. Y. Takeshita, “A comparison of adaptive belief prop agation and the best graph algorithm for the decoding of block codes,” in Proc. IEEE Int. Symp. on Inform. Theory 2005, pp. 724-728. [18] D. Agrawal and A. Vardy, “Generalized-minimum-distance decoding in euclidean space: Performance analysis,” in IEEE Trans. Inform. Theory, vol. 46, pp. 60-83, Jan. 2000. [19] M. Fossorier and S. Lin, “Error performance analysis for reliability-based decoding algorithms,” in IEEE Trans. Inform. Theory, vol. 48, pp. 287 293, Jan. 2002.
|