Skip to main content

On computing the performance probabilities of Reed-Solomon codes

  • Conference paper
  • First Online:
Algebraic Algorithms and Error-Correcting Codes (AAECC 1985)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 229))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. R. Berlekamp, Algebraic Coding Theory, Aegean Park Press 1984

    Google Scholar 

  2. G. D. Forney, Concatenated Codes, MIT Press, 1966

    Google Scholar 

  3. 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.

    Google Scholar 

  4. 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.

    Google Scholar 

  5. 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.

    Google Scholar 

  6. F. J. MacWilliams & N. J. A. Sloane, The Theory of Error Correcting codes, North Holland 1977

    Google Scholar 

  7. 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.

    Google Scholar 

  8. P.J. Trafton, “Performance of Reed-Solomon codes on a symmetric erasure channel”, Proc. IEEE Int. Conf. Commun., pp18.1–18.5, 1970.

    Google Scholar 

  9. 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.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jacques Calmet

Rights and permissions

Reprints 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

Publish with us

Policies and ethics