Words Strongly Avoiding Fractional Powers

Let k be fixed, 1 < k < 2. There exists an infinite word over a finite alphabet which contains no subword of the form xyz with |xyz | / | xy | ≥ k and where z is a permutation of x.