On a problem of Berlekamp
Ulrich Tamm · 2003
At the 3rd Waterloo Conference on Combinatorics Berlekamp presented the following combinatorial problem, which originally arose in his studies on burst-error correcting convolution codes Berlekamp, ER (1963). The problem will be illustrated with example. We shall analyze an equivalent lattice path model and use a probablistic approach due to Gessel, I (1986).