Minimal families in terms of double-sided shadow in the Boolean cube layer

The double-sided shadow minimization problem for the Boolean cube layer is considered. It is shown that the intersection of Hamming ball of radius 2 and the layer has the minimal double-sided shadow, and optimal families of a smaller size are described.