In this paper, we obtain an upper bound on the order of a blockwise-burst \([11]\) that can be detected by a row-cyclic array code \([10]\) and obtain the fraction of blockwise-bursts of order exceeding the upper bound that go undetected. We also give a decoding algorithm for the correction of blockwise-bursts in row-cyclic array codes.