A transformation on boolean functions, its consequences on some problems related to reed-muller codes
We introduce a transformation defined on the set of all boolean functions defined on Galois fields GF(2m), m∈ℕ*,(or on F 2 m ), which changes their weights in a way easy to be followed, and which, when we iterate it, reduces their degrees down to 2 or 3. We deduce that it is as difficult to find a general characterization of the weights in the Reed-Muller codes of order 3 as it is to obtain one in the Reed-Muller codes of any orders. We also use this transformation to characterize the existence of some affine sets of bent functions, and to obtain bent functions of degree 4 from bent functions of degree 3.
Unable to display preview. Download preview PDF.
- (1).C. Carlet, thèse, publication du LITP, Institut Blaise Pascal, Université Paris 6, no 90.59 (1990).Google Scholar
- (2).J. F. Dillon, "Elementary Hadamard Difference sets", Ph. D. Thesis, Univ. of Mariland (1984).Google Scholar
- (4).F. J. Mac Williams and N. J. Sloane, "The theory of error-correcting codes", Amsterdam, North Holland.Google Scholar
- (6).J. H. Van Lint, "Coding Theory", Springer Verlag 201.Google Scholar
- (7).H.C.A. Van Tilborg "On weights in codes" Report 71-WSK03, Dep.of math. Technological University of Eindhoven, Netherlands (1971).Google Scholar