Skewincidence

Skewincidence

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on information theory 2011-11, Vol.57 (11), p.7313-7316
Hauptverfasser: Cohen, G., Fachini, E., Korner, J.
Format: Artikel
Sprache:eng
Schlagworte:
Applied sciences
Asymptotic combinatorics
Bipartite graph
Computer Science
Exact sciences and technology
Graphs
Information Theory
Information, signal and communications theory
Intersections
Mathematical analysis
Mathematical problems
Random variables
Studies
Telecommunications and information theory
Upper bound
Vices
zero-error capacity
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/TIT.2011.2161753