Search
Search Results
-
Runtime Analysis of Competitive Co-evolutionary Algorithms for Maximin Optimisation of a Bilinear Function
Co-evolutionary algorithms have a wide range of applications, such as in hardware design, evolution of strategies for board games, and patching...
-
Chain-imprimitive, flag-transitive 2-designs
We consider 2-designs which admit a group of automorphisms that is flag-transitive and leaves invariant a chain of nontrivial point-partitions. We...
-
Meet-in-the-middle attacks on AES with value constraints
In meet-in-the-middle (MITM) attacks, the sizes of the precomputation tables determine the effectiveness. In this paper, value constraints are...
-
Symmetric 2-adic complexity of Tang–Gong interleaved sequences from generalized GMW sequence pair
Tang–Gong interleaved sequences constructed from the generalized GMW sequence pair are a class of binary sequences with optimal autocorrelation...
-
Fast decoding of lifted interleaved linearized Reed–Solomon codes for multishot network coding
Martínez-Peñas and Kschischang (IEEE Trans. Inf. Theory 65(8):4785–4803, 2019) proposed lifted linearized Reed–Solomon codes as suitable codes for...
-
Constructing linked systems of relative difference sets via Schur rings
In the present paper, we study relative difference sets (RDSs) and linked systems of them. It is shown that a closed linked system of RDSs is always...
-
Analysing Equilibrium States for Population Diversity
Population diversity is crucial in evolutionary algorithms as it helps with global exploration and facilitates the use of crossover. Despite many...
-
Min Orderings and List Homomorphism Dichotomies for Graphs and Signed Graphs
Since the CSP dichotomy conjecture has been established, a number of other dichotomy questions have attracted interest, including one for list...
-
Flexible fingerprint cuckoo filter for information retrieval optimization in distributed network
In a large-scale distributed network, a naming service is used to achieve location transparency and provide effective content discovery. However,...
-
-
Jacobi polynomials for the first-order generalized Reed–Muller codes
In this paper, we give the Jacobi polynomials for first-order generalized Reed–Muller codes. We show as a corollary the nonexistence of combinatorial...
-
Conflict-Free Coloring: Graphs of Bounded Clique-Width and Intersection Graphs
A conflict-free coloring of a graph G is a (partial) coloring of its vertices such that every vertex u has a neighbor whose assigned color is unique...
-
Anonymous attribute-based broadcast encryption with hidden multiple access structures
Due to the high demands of data communication, the broadcasting system streams the data daily. This service not only sends out the message to the...
