|
|
Author |
Cohen,G. (Author)
Fachini,E. (Author)
Korner,J. (Author)
|
Journal Title |
IEEE Transactions on Information Theory
|
Volume/ Issue |
2011/NOV V.57 N.11
|
Physical Description |
p 7313 - 7316
|
Subject Area |
Computer
|
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.... |
View Full Abstract
|
Subject Headings |
Information Theory
|
Call Number |
003.4505 ITI
|
Location |
Periodicals Hall 2nd floor - قاعة الدوريات - الطابق الثاني
|