We determine the exact exponential asymptotics of the maximum number of n-length binary strings any two of which differ in the following strong sense: there must be a coordinate in which one of them has a 1 in correspondence with a predetermined position within a "long run" of zeros in the other string. We discuss some generalizations and implications of this result.
Coding for a long silence / Fachini, E; Korner, Janos. - In: IEEE TRANSACTIONS ON INFORMATION THEORY. - ISSN 0018-9448. - STAMPA. - 49:8(2003), pp. 2020-2023. [10.1109/TIT.2003.814933]
Coding for a long silence
FACHINI E;KORNER, JANOS
2003
Abstract
We determine the exact exponential asymptotics of the maximum number of n-length binary strings any two of which differ in the following strong sense: there must be a coordinate in which one of them has a 1 in correspondence with a predetermined position within a "long run" of zeros in the other string. We discuss some generalizations and implications of this result.File allegati a questo prodotto
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
