The performance of low-density random linear fountain codes over higher order galois fields under maximum likelihood decoding

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 1004-1011

  Schotsch, Birgit ^a   Lupoaie, Radu ^a   Vary, Peter ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DENSITY REDUCTION; DIGITAL FOUNTAIN CODES; ERASURE CHANNELS; ERROR FLOOR; EXCELLENT PERFORMANCE; FOUNTAIN CODES; GALOIS FIELDS; GENERAL UPPER BOUND; GENERATOR MATRIX; HIGH DENSITY; HIGHER ORDER; MAXIMUM LIKELIHOOD DECODING; TWO PARAMETER;

COMMUNICATION; DECODING; FLOORS; FOUNTAINS; MAXIMUM LIKELIHOOD;

COMPUTATIONAL COMPLEXITY;

EID: 84856109470     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120277     Document Type: Conference Paper

References (14)

1. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," ACM SIGCOMM Computer Communication Review, vol. 28, pp. 56-67, 1998. (Pubitemid 128566447)
2. q," IEEE Communications Letters, vol. 14, no. 2, pp. 178-180, 2010.
3. M. Luby, A. Shokrollahi, M. Watson, T. Stockhammer, and L. Minder, "IETF Internet Draft: RaptorQ Forward Error Correction Scheme for Object Delivery," 2011.
4. QUALCOMM Incorporated, "RaptorQ™ Technical Overview," 2010. [Online]. Available: www.qualcomm.com/documents/files/raptorqtm-technical- overview.pdf
5. M. Luby, "LT Codes," in Proc. 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002, pp. 271-280.
6. A. Shokrollahi, "Raptor Codes," IEEE Transactions on Information Theory, vol. 52, no. 6, pp. 2551-2567, 2006.
7. P. Maymounkov, "Online Codes," Secure Computer Systems Group, New York University, Tech. Rep. TR2002-833, Nov. 2002.
8. D. MacKay, "Fountain Codes," Communications, IEE Proceedings-, vol. 152, no. 6, pp. 1062-1068, 2005.
9. B. Schotsch, H. Schepker, and P. Vary, "The Performance of Short Random Linear Fountain Codes under Maximum Likelihood Decoding," in IEEE International Conference on Communications (ICC), June 2011.
10. R. Lidl, H. Niederreiter, and P. M. Cohn, Finite fields. Cambridge University Press, 1997.
11. N. Rahnavard and F. Fekri, "Bounds on Maximum-Likelihood Decoding of Finite-Length Rateless Codes," in Proc. of the 39th Annual Conference on Information Science and Systems (CISS'05), March 2005.
12. R. P. Stanley, Enumerative Combinatorics, 2nd ed. Cambridge University Press, 2011, vol. 1, to appear. [Online]. Available: http://math.mit.edu/ rstan/ec/ec1.pdf
13. K. M. Greenan, E. L. Miller, and T. J. E. Schwarz, "Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications,"in IEEE International Symposium on Modeling, Analysis and Simulation of Computers and Telecommunication Systems MASCOTS, 2008, pp. 1-10.
14. F. J. MacWilliams and N. J. A. Sloane, The theory of error-correcting codes. North-Holland, 1977.