Blar i Department of Informatics på emneord "VDP::Mathematics and natural science: 400"
Viser treff 1-5 av 5
-
CCZ-equivalence of bent vectorial functions and related constructions
(Peer reviewed; Journal article, 2011-01-06)We observe that the CCZ-equivalence of bent vectorial functions over F2nFn2 (n even) reduces to their EA-equivalence. Then we show that in spite of this fact, CCZ-equivalence can be used for constructing bent functions ... -
Directed graph representation of half-rate additive codes over GF(4)
(Peer reviewed; Journal article, 2010)We show that (n, 2n) additive codes over GF(4) can be represented as directed graphs. This generalizes earlier results on self-dual additive codes over GF(4), which correspond to undirected graphs. Graph representation ... -
Lower bounds on the size of spheres of permutations under the Chebychev distance
(Peer reviewed; Journal article, 2011)Lower bounds on the number of permutations p of {1, 2, . . . , n} satisfying |pi − i| ≤ d for all i are given -
A Note on Exact Algorithms for Vertex Ordering Problems on Graphs
(Peer reviewed; Journal article, 2011-01-21)In this note, we give a proof that several vertex ordering problems can be solved in O ∗(2 n ) time and O ∗(2 n ) space, or in O ∗(4 n ) time and polynomial space. The algorithms generalize algorithms for the Travelling ... -
Sparse Boolean equations and circuit lattices
(Peer reviewed; Journal article, 2011)A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard problem in the cryptanalysis of modern ciphers. In ...