A transformation on boolean functions, its consequences on some problems related to reed-muller codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 514 LNCS, Issue , 1991, Pages 42-50

  Cadet, Claude ^a,b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BLOCK CODES; BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTER PROGRAMMING;

BENT FUNCTION; GALOIS FIELDS; REED-MULLER CODES;

FORWARD ERROR CORRECTION;

EID: 85031937171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-54303-1_116     Document Type: Conference Paper

References (7)

1. C. Carlet, Thèse, publication du LITP, Institut Blaise Pascal, Université Paris 6, no 90.59 (1990).
2. J. F. Dillon, “Elementary Hadamard Difference sets”, Ph. D. Thesis, Univ. of Mariland (1984).
3. T. Kasami and N. Tokura “On the weight structure of the Reed Muller codes”, IEEE Trans. Info. Theory 16 (1970) 752-759.
4. F. J. Mac Williams and N. J. Sloane, “The theory of error-correcting codes”, Amsterdam, North Holland.
5. O. S. Rothaus, “On bent functions”, J. Comb. Theory, 20A (1976) 300-305
6. J. H. Van Lint, “Coding Theory”, Springer Verlag 201.
7. H.C.A. Van Tilborg “On weights in codes” Report 71-WSK03, Dep.of math. Technological University of Eindhoven, Netherlands (1971)