Author :
Cohen, Gérard ; Fachini, Emanuela ; Körner, János
Author_Institution :
ENST, France
Abstract :
We introduce a new class of problems lying halfway between questions about graph capacity and intersection. We say that two binary sequences x and y of the same length have a skewincidence if there is a coordinate i for which xi=yi+1=1 or vice versa. We give relatively close bounds on the maximum number of binary sequences of length n any pair of which has a skewincidence. A systematic study of these problems helps to understand the mathematical difficulties to solve zero-error problems in information theory.
Keywords :
binary sequences; graph colouring; information theory; binary sequences; graph capacity; information theory; skewincidence; zero-error problems; Bipartite graph; Information theory; Random variables; Upper bound; Asymptotic combinatorics; zero-error capacity;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2011.2161753
