This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
E. R. Berlekamp, Algebraic Coding Theory, Aegean Park Press 1984
G. D. Forney, Concatenated Codes, MIT Press, 1966
T. Kasami & S. Lin, “On the probability of undetected error for the maximum distance separable codes”, IEEE Trans. Commun., vol.COM-32, pp998–1006, Sept.1984.
T. Klove, “The probability of undetected error when a code is used for error correction and detection”, IEEE Trans. Inform. Theory, vol.IT-30, pp388–392, March 1984.
S.K. Leung-Yan-Cheong, E.R. Barnes & D.U. Friedman, “Some properties of undetected error probability of linear codes”, IEEE Trans. Inform. Theory, vol IT-25, p110–112, Jan.1979.
F. J. MacWilliams & N. J. A. Sloane, The Theory of Error Correcting codes, North Holland 1977
Z. McC. Huntoon & A.M. Michelson, “On the computation of the probability of post-decoding error events for block codes, IEEE Trans. Inform. Theory, vol.IT-23, pp399–403, May 1977.
P.J. Trafton, “Performance of Reed-Solomon codes on a symmetric erasure channel”, Proc. IEEE Int. Conf. Commun., pp18.1–18.5, 1970.
J.K. Wolf, A.M. Michelson & A.H. Levesque, “On the probability of undetected error for linear block codes”, IEEE Trans. Commun., vol. COM-30, pp 317–324, Feb 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jennings, S. (1986). On computing the performance probabilities of Reed-Solomon codes. In: Calmet, J. (eds) Algebraic Algorithms and Error-Correcting Codes. AAECC 1985. Lecture Notes in Computer Science, vol 229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16776-5_709
Download citation
DOI: https://doi.org/10.1007/3-540-16776-5_709
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16776-1
Online ISBN: 978-3-540-39855-4
eBook Packages: Springer Book Archive