In this paper we investigate subsets of the underlying set [n]={1,2, . . . ,n}. A family A⊆2[n] is called an antichain if for all distinct members B,C∈A we have B ⊂C. The size of A is |A|, the volume… (More)

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the… (More)

A set system is called t-intersecting if every two members meet each other in at least t elements. Katona determined the minimum ratio of the shadow and the size of such families and showed that the… (More)

Methods for the fast computation of Hamming distance developed for the case of large number of pairs of words are presented and discussed in the paper. The connection of this subject to some… (More)