A new upper bound on the block error probability after decoding over the erasure channel

IEEE Transactions on Information Theory

Volumn 52, Issue 10, 2006, Pages 4496-4503

  Didier, Frédéric ^a  

^a INRIA   (France)

Author keywords

Algebraic immunity; Boolean functions; Erasure channel; Generalized Hamming weights; Reed Muller codes

Indexed keywords

ALGEBRA; BINARY CODES; BOOLEAN FUNCTIONS; CRYPTOGRAPHY; HAMMING DISTANCE; ITERATIVE DECODING; PROBABILITY;

ALGEBRAIC IMMUNITY; ERASURE CHANNEL; GENERALIZED HAMMING WEIGHTS; REED-MULLER CODES;

ERROR ANALYSIS;

EID: 33947361485     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.881719     Document Type: Article

References (16)

1. A. Braeken and B. Preneel, "On the algebraic immunity of symmetric boolean functions," in Proc. INDOCRYPT, Jul. 26, 2005, vol. 3797, pp. 35-48 [Online]. Available: http://eprint.iacr.org/,/245,26,2005/245
2. C. Carlet and P. Gaborit, "On the construction of balanced Boolean functions with a good algebraic immunity," in Proc. BFCA (First Workshop on Boolean Functions: Cryptogr. Appl.), Rouen, France, Mar. 2005, pp. 1-14.
3. N. Courtois and W. Meier, "Algebraic attacks on stream ciphers with linear feedback," Proc. Adv. Crypt. - EUROCRYPT 2003, vol. 2656, pp. 346-359, 2003.
4. D. K. Dalai, K. C. Gupta, and S. Maitra, "Results on algebraic immunity for cryptographically significant Boolean functions," in Proc. INDOCRYPT, ser. Lecture tes in Computer Science, A. Canteaut and K. Viswanathan, Eds. New York: Springer, 2004, vol. 3348, pp. 92-106.
5. _, "Cryptographically significant boolean functions: construction and analysis in term of algebraic immunity," in Fast Software Encryption, ser. Lecture tes in Computer Science. New York: Springer, 2005, vol. 3557, pp. 98-101.
6. D. K. Dalai, S. Maitra, and S. Sarkar, "Basic theory in construction of Boolean functions with maximum possible annihilator immunity," in Designs, Codes, Cryptogr., Jul. 15,2005, vol. 40, pp. 41-58 [Online]. Available: http://eprint.iacr.org/,/229,15,2005/229
7. F. Didier and J.-P. Tillich, "Computing the algebraic immunity efficiently," Fast Software Encryption, FSE, 2006.
8. P. Elias, "Coding for noisy channels," IRE Conv. Rec., pp. 37-46, Mar. 1955.
9. T. Helleseth, T. Kløve, and V. I. Levenshtein, "On the information function of an error-correcting code," IEEE Trans. Inf. Theory, vol. 43, pp. 549-557, 1997.
10. T. Kasami and N. Tokura, "On the weight structure of Reed-Muller codes," IEEE Trans. Inf. Theory, vol. 16, pp. 752-759, 1970.
11. T. Kasami, N. Tokura, and S. Asumi, "On the weight enumeration of weights less than 2.5d of Reed-Muller codes," Inf. Contr., vol. 30, no. 4, pp. 380-395, 1974.
12. S. J. MacMullan and O. M. Collins, "A comparison of known codes, random codes, and the best codes," IEEE Trans. Inf. Theory, vol. 44, pp. 3009-3022, 1998.
13. F. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes . Amsterdam, The Netherlands: North-Holland, 1977.
14. W. Meier, E. Pasalic, and C. Carlet, "Algebraic attacks and decomposition of Boolean functions," Lecture Notes in Comput. Sci., vol. 3027, pp. 474-491, Apr. 2004.
15. M. A. Tsfasman and S. G. Vlǎduţ, "Geometric approach to higher weights," IEEE Trans. Inf. Theory, vol. 41, pp. 1564-1588, 1995.
16. V. K. Wei, "Generalized Hamming weights for linear codes," IEEE Trans. Inf. Theory, vol. 37, pp. 1412-1418, Sep. 1991.