H-codes and Derivations



Let m be a positive integer. In this text, a Boolean function is a map from tex2html_wrap_inline26 into the field tex2html_wrap_inline28 . The affine invariants are tools to progress in the knowledge of the Boolean functions. An affine invariant j, is a map such that tex2html_wrap_inline32 , for all Boolean functions f and all affine transformations tex2html_wrap_inline36 of tex2html_wrap_inline26 . For example, the weight, the degree and the non-linearity are affine invariants. In this paper, we study a particular affine invariant : the height. In his thesis, J Dillon defines the derivation of a Boolean function f in the direction of a subspace S as tex2html_wrap_inline44 . The height of f, denoted by tex2html_wrap_inline48 , is equal to the minimal dimension of a subspace S such that tex2html_wrap_inline52 is the null function. The expession tex2html_wrap_inline52 is nothing but the convolutional product of f and the indicating function of S; It is also their product in the group algebra tex2html_wrap_inline60 . The height of f gives an information about the minimal distance of the annihilator of f. Following a definition of P. Camion, an H-code is a principal ideal of dimension tex2html_wrap_inline68 . An H-code is self-dual, and equal to its annihilator. In her article Self-dual codes which are principal ideals of the group algebra, P. Charpin proves that the family of H-codes is not a class of good codes, showing that the maximal value of the height of a function is tex2html_wrap_inline74 . Here, we give some values and new bounds on the strange function

P. Langevin, Octobre 1998