Bounds on the Error Probability of Raptor Codes

[1]  W. Marsden.  I and J , 2012 .

[2]  Peter Vary,et al.  Analysis of LT Codes over Finite Fields under Optimal Erasure Decoding , 2013, IEEE Communications Letters.

[3]  Thomas Stockhammer,et al.  RaptorQ Forward Error Correction Scheme for Object Delivery , 2011, RFC.

[4]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[5]  Masoud Ardakani,et al.  On Raptor Code Design for Inactivation Decoding , 2012, IEEE Transactions on Communications.

[6]  Andrew M. Odlyzko,et al.  Solving Large Sparse Linear Systems over Finite Fields , 1990, CRYPTO.

[7]  Amin Shokrollahi,et al.  Raptor codes , 2011, IEEE Transactions on Information Theory.

[8]  David Burshtein,et al.  Lower Bounds on the Error Rate of LDPC Code Ensembles , 2007, IEEE Transactions on Information Theory.

[9]  Gerhard Bauch,et al.  On the weight distribution of fixed-rate Raptor codes , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[10]  Gerhard Bauch,et al.  Bounds on the Error Probability of Raptor Codes , 2016, 2016 IEEE Global Communications Conference (GLOBECOM).

[11]  Elwyn R. Berlekamp,et al.  Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[12]  K. Sakaniwa,et al.  Weight distribution of non-binary LDPC codes , 2008, 2008 International Symposium on Information Theory and Its Applications.

[13]  Gerhard Bauch,et al.  LT code design for inactivation decoding , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[14]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[15]  Birgit Schotsch,et al.  Rateless coding in the finite length regime , 2014 .

[16]  Seymour M. Kwerel.  Most Stringent Bounds on Aggregated Probabilities of Partially Specified Dependent Probability Systems , 1975 .

[17]  Gerhard Bauch,et al.  Distance Spectrum of Fixed-Rate Raptor Codes With Linear Random Precoders , 2015, IEEE Journal on Selected Areas in Communications.

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

[19]  Marco Chiani,et al.  Performance versus overhead for fountain codes over Fq , 2010, IEEE Communications Letters.

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

[21]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[22]  Ke Zhang,et al.  Bounds on the Reliability of RaptorQ Codes in the Finite-Length Regime , 2017, IEEE Access.

[23]  Michael Luby,et al.  A digital fountain approach to reliable distribution of bulk data , 1998, SIGCOMM '98.

[24]  Weifa Liang,et al.  Performance Analysis of Raptor Codes Under Maximum Likelihood Decoding , 2015, IEEE Transactions on Communications.

[25]  N. J. A. Sloane,et al.  Generalizations of Gleason's theorem on weight enumerators of self-dual codes , 1972, IEEE Trans. Inf. Theory.

[26]  David Sankoff,et al.  AN INEQUALITY FOR PROBABILITIES , 1967 .

[27]  Francisco Lázaro,et al.  Fountain Codes under Maximum Likelihood Decoding , 2017, ArXiv.

[28]  Nazanin Rahnavard,et al.  Rateless Codes With Unequal Error Protection Property , 2007, IEEE Transactions on Information Theory.

[29]  David Burshtein,et al.  Asymptotic enumeration methods for analyzing LDPC codes , 2004, IEEE Transactions on Information Theory.

[30]  Gerhard Bauch,et al.  Enhancing the LT Component of Raptor Codes for Inactivation Decoding , 2015 .

[31]  Philippe Godlewski,et al.  Replication decoding , 1979, IEEE Trans. Inf. Theory.

[32]  Gerhard Bauch,et al.  Inactivation Decoding of LT and Raptor Codes: Analysis and Code Design , 2017, IEEE Transactions on Communications.