Title :
On the extremal combinatorics of the Hamming space
Author_Institution :
Dept. of Comput. Sci., Rome Univ., Italy
fDate :
27 Jun-1 Jul 1994
Abstract :
We present new asymptotic bounds for problems in extremal set theory related to finding the maximum number of qualitatively 3-independent bipartitions of an n-set. We consider the space of all binary sequences of some fixed length n. Selecting subsets of growing cardinality we watch as more and more different “small configurations” necessarily emerge
Keywords :
binary sequences; combinatorial mathematics; set theory; Hamming space; asymptotic bounds; binary sequences; bipartitions; cardinality; extremal combinatorics; extremal set theory; fixed length sequences; Arithmetic; Binary sequences; Combinatorial mathematics; Computer science; Set theory; Upper bound; Watches;
Conference_Titel :
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location :
Trondheim
Print_ISBN :
0-7803-2015-8
DOI :
10.1109/ISIT.1994.394706
