Abstract
The well-known upper bound on the miscorrection probability with bounded distance decoding for a Reed-Solomon code is shown to hold for any code, assuming that error patterns are equiprobable if they have equal support, i.e. if they corrupt the same set of postions. In previous papers, it was assumed that error patterns of equal weight are equiprobable; this prevented application of the bound if the code is used on a bursty channel.
Moreover, it is shown that for the case of MDS codes, the number of error vectors with given support that yield a miscorrection, only depends on the size of the support.
A generalization to error-and-erasure decoding is included.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L.H.M.E. Driessen and L.B. Vries, “Performance Calculations of the Compact Disc Error Correcting Code”, Proc. Int. Conf. Video and Data Recording, Univ. of Southampton, April 20–23, 1982, pp. 385–395.
R.J. McEliece and L. Swanson, “On the decoder error probability for Reed-Solomon codes”, IEEE Trans. on Inform. Th., 32, 5, 1986, pp. 701–703.
Kar-Ming Cheung, “More on the decoder error probability for Reed-Solomon codes”, IEEE Trans. on Inform. Th., 35, 4, 1989, pp. 895–900.
F.J. MacWilliams and N.J.A. Sloane, The Theory of Error-Correcting Codes, North-Holland, 1977.
R.E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley, 1983.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Wien
About this chapter
Cite this chapter
Tolhuizen, L.M.G.M. (1993). A Universal Upper Bound on the Miscorrection Probability with Bounded Distance Decoding for a Code Used on an Error-Value Symmetric Channel. In: Camion, P., Charpin, P., Harari, S. (eds) Eurocode ’92. International Centre for Mechanical Sciences, vol 339. Springer, Vienna. https://doi.org/10.1007/978-3-7091-2786-5_26
Download citation
DOI: https://doi.org/10.1007/978-3-7091-2786-5_26
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82519-8
Online ISBN: 978-3-7091-2786-5
eBook Packages: Springer Book Archive