  We propose a refined scaling law to predict the finite-length performance in
the waterfall region of spatially coupled low-density parity-check codes over
the binary erasure channel. In particular, we introduce some improvements to
the scaling law proposed by Olmos and Urbanke that result in a better agreement
between the predicted and simulated frame error rate. We also show how the
scaling law can be extended to predict the bit error rate performance.
