Performance of Reed–Solomon codes with dependent symbol errors
Thomas Aaron Gulliver, M. B. Jorgenson, W.K. Moreland · IEE Proceedings - Communications · 1996
Reed–Solomon (RS) error-correcting codes are often proposed for communication systems requiring burst-error-correction capabilities. The performance of RS codes is examined for the case when symbol errors are dependent and therefore not random. This situation arises when interleaving is not possible due to delay constraints, such as in most voice-communication systems. The performance is compared with that obtained using a random-error assumption.