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 coordinatei for which x(i) = y(i+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.
Skewincidence / Gérard, Cohen; Fachini, Emanuela; Korner, Janos. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - STAMPA. - 57:11(2011), pp. 7313-7316. [10.1109/tit.2011.2161753]
Skewincidence
FACHINI, Emanuela;KORNER, JANOS
2011
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 coordinatei for which x(i) = y(i+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.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
