 271-282, 2002. 453-461, March 2006. classification," IEEE Trans. Inform. [31] M. Luby, M. Mitzenmacher, [42] A. Schertz and C. Weck. Theory, vol. 34, pp. 1123-1151, A. Shokrollahi, D. Spielman, "Hierarchical modulation," EBU September 1988. and V. Stemann. "Practical loss- Technical Review, April 2003. [21] R. G. Gallager. Low Density Parity- resilient codes," 29th ACM [43] C. Schlegel. Trellis Coding, John Check Codes, MIT Press, Cambridge, Symposium Theory Computation, pp. Wiley & Sons, 1997. 1963. 150-159, 1997. [44] N. Seshadri and C.-E. W. Sundberg. [22] R. Gray. Entropy and Information [32] M. Luby, M. Mitzenmacher, "List Viterbi decoding algorithms Theory, Springer-Verlag, New York, A. Shokrollahi, and D. Spielman. with applications," IEEE Trans. 1990. "Efficient erasure correcting codes," Commun., vol. 42, pp. 313-323, [23] V. Guruswami and M. Sudan. IEEE Trans. Inform. Theory, vol. 47, February-April 1994. "Improved decoding of Reed- pp. 569-584, February 2001. [45] C. E. Shannon. "A mathematical Solomon and algebraic-geometry [33] D. J. C. MacKay. Information Theory, theory of communication," Bell codes," IEEE Trans. Inform. Theory, Inference and Learning Algorithms, System Technical Journal, vol. 27, vol. 45, pp. 1757-1767, September Cambridge University Press, 2003. pp. 379-423, 623-656, 1948. 1999. [34] D. J. C. MacKay and R. M. Neal. [46] C. E. Shannon. "Coding theorems for [24] J. Hagenauer. "Rate-compatible "Near Shannon limit performance of a discrete source with a fidelity punctured convolutional codes low density parity check codes," criterion," I.R.E. Nat. Conv. Rec., (RCPC codes) and their Electronics Letters, vol. 32, pp. 1645- part 4, pp. 142-163, 1959. applications," IEEE Trans. Commun., 1646, August 1996. [47] A. Shokrollahi. "Raptor codes," IEEE vol. 36, pp. 389-400, April 1988. [35] D.J.C. MacKay. "Good error- Trans. Inform. Theory, vol. 52, pp. [25] J. Hagenauer and P. Hoeher. "A correcting codes based on very sparse 2551-2567, June 2006. Viterbi algorithm with soft-decision matrices,