Add to ORKGThis note presents a descending method that allows us to classify quotients of Reed-Muller codes of lenghth 128 under the action of the affine general linear group
Boolean functions appear in various scientific disciplines including coding theory, combinatorics, c...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
Low degree annihilators for Boolean functions are of great interest in cryptology because of algebra...
Abstract. This paper presents an efficient approach for classification of the affine equivalence cla...
We compute the weight distribution of the ${\mathcal R} (4,9)$ by combining the approach described i...
In this article, we study two representations of a Boolean function which are very important in the ...
Abstract By Walsh transform, autocorrelation function, decomposition, derivation and modification of...
In this note we describe two transformations of boolean functions based on the binary representation...
Polynomial representations of Boolean functions over various rings such as ? and ?_m have been studi...
By Walsh transform, autocorrelation function, decomposition, derivation and modification of truth ta...
Carlet and Charpin classified in \cite{CC04} the set of cubic $(n-4)$-resilient Boolean functions in...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
In the article we study boolean functions with affine annihilators. We have obtained results in both...
Two Boolean functions, f(x1,…, xn) and g(x1 ,…, xn) are said to be affine equivalent if g can be wri...
Boolean functions appear in various scientific disciplines including coding theory, combinatorics, c...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
Low degree annihilators for Boolean functions are of great interest in cryptology because of algebra...
Abstract. This paper presents an efficient approach for classification of the affine equivalence cla...
We compute the weight distribution of the ${\mathcal R} (4,9)$ by combining the approach described i...
In this article, we study two representations of a Boolean function which are very important in the ...
Abstract By Walsh transform, autocorrelation function, decomposition, derivation and modification of...
In this note we describe two transformations of boolean functions based on the binary representation...
Polynomial representations of Boolean functions over various rings such as ? and ?_m have been studi...
By Walsh transform, autocorrelation function, decomposition, derivation and modification of truth ta...
Carlet and Charpin classified in \cite{CC04} the set of cubic $(n-4)$-resilient Boolean functions in...
So far, there are no efficient algorithms to solve a problem of finding the low degree annihilators ...
AbstractWe give a new lower bound to the covering radius of the first order Reed–Muller code RM(1,n)...
In the article we study boolean functions with affine annihilators. We have obtained results in both...
Two Boolean functions, f(x1,…, xn) and g(x1 ,…, xn) are said to be affine equivalent if g can be wri...
Boolean functions appear in various scientific disciplines including coding theory, combinatorics, c...
AbstractWe prove that the automorphism group of Generalized Reed-Muller codes is the general linear ...
Low degree annihilators for Boolean functions are of great interest in cryptology because of algebra...