… In Chapter 3 we show how to use tilings of binary vector spaces to construct perfect binary
codes. In the last Chapter we list the open problems and possibilities for further research. …

… We introduce the binary variable αnu ∈ {0, 1} … Recall that αnu is a binary variable that
takes value 1 when user u resides in the coverage area of the nth SBS, otherwise its value is 0. …

Modern digitised approaches have dramatically changed the preservation and restoration
of cultural treasures, integrating computer scientists into multidisciplinary projects with ease. …

We explore some generalizations of fullerenes F_v (simple polyhedra with v vertices and only
5- and 6-gonal faces) seen as (d-1)-dimensional simple manifolds (preferably, spherical or …

… In [5], the binary Golay code was suggested to find approximate matches in bit-vectors. Data
is provided that suggests it is effective, but it is still not … First, we identify the binary expansion …

… First we identify the binary expansion x = ∑i<n 2ixn−i with the vector x = (x1,...,xn). Second,
for each optimal right-shifted down-set R2t,n we have listed a minimal set of generators. For …

… We introduce the binary variable αnu ∈ {0,1} that equals to 1 when user u resides in the
coverage area of the SBS n, and 0 otherwise. Each SBS is equipped with a cache with capacity …

… [96] save frequently accessed instructions in the beginning of a program binary using …
To demonstrate applicability of our proposals to a non-tiles architecture, we also simulate a …