Codes witha SmallFraction ofDenseRows.

We design anewformoftheMaximumLikelihood Decoding Algorithm (MLDA)in(1)forLT codes(3)witha smallfraction ofdenserows.Inparticular, we design degree distributions using theRobustSoliton Distribution (RSD)forthe proposed MLDA baseddecoding ofLTcodes. We alsoestimate thecomputational complexity oftheproposed LTbasedMLDA. Simulation results, whichshowtheviability oftheproposed MLDA decoding ofLTcodes, arealsopresented. I.INTRODUCTION

[1]  Daniel A. Spielman,et al.  Efficient erasure correcting codes , 2001, IEEE Trans. Inf. Theory.

[2]  Steven Roman.  Advanced Linear Algebra , 1992 .

[3]  David Burshtein,et al.  Efficient maximum-likelihood decoding of LDPC codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.

[4]  Rüdiger L. Urbanke,et al.  Efficient encoding of low-density parity-check codes , 2001, IEEE Trans. Inf. Theory.

[5]  Faramarz Fekri,et al.  On decoding of low-density parity-check codes over the binary erasure channel , 2004, IEEE Transactions on Information Theory.