MOC
2002
13 years 10 months ago
2002
As in the earlier paper with this title, we consider a question of Byrnes concerning the minimal length N(m) of a polynomial with all coeffi
COMBINATORICS
1998
13 years 10 months ago
1998
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
GD
2005
Springer
14 years 4 months ago
2005
Springer
Most diagram editors and graph construction tools provide some form of automatic connector routing, typically providing orthogonal or poly-line connectors. Usually the editor provi...
IH
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This paper estimates the minimal length of a binary probabilistic traitor tracing code. We consider the code construction proposed by G. Tardos in 2003, with the symmetri...