Sciweavers

Share
90 search results - page 1 / 18
» Bounds for the generalized repetition threshold
Sort
View
TCS
2011
8 years 2 months ago
Bounds for the generalized repetition threshold
The notion of repetition threshold, which is the object of Dejean’s conjecture (1972), was generalized by Ilie, Ochem, and Shallit in 2005, to include the lengths of the avoided ...
Francesca Fiorenzi, Pascal Ochem, Elise Vaslet
MFCS
2004
Springer
9 years 23 days ago
A Generalization of Repetition Threshold
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number α such that there exists an infinite word over a k-letter alphabet t...
Lucian Ilie, Pascal Ochem, Jeffrey Shallit
TIT
2002
126views more  TIT 2002»
8 years 7 months ago
Two-dimensional interleaving schemes with repetitions: Constructions and bounds
Abstract--Two-dimensional interleaving schemes with repetitions are considered. These schemes are required for the correction of two-dimensional bursts (or clusters) of errors in a...
Tuvi Etzion, Alexander Vardy
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
9 years 1 months ago
Chernoff-Type Direct Product Theorems
Consider a challenge-response protocol where the probability of a correct response is at least α for a legitimate user and at most β < α for an attacker. One example is a CAP...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
APPROX
2015
Springer
33views Algorithms» more  APPROX 2015»
3 years 3 months ago
Reconstruction/Non-reconstruction Thresholds for Colourings of General Galton-Watson Trees
The broadcasting models on trees arise in many contexts such as discrete mathematics, biology, information theory, statistical physics and computer science. In this work, we consi...
Charilaos Efthymiou
books