Advertisement

Eurocode ’92 pp 291-303 | Cite as

The Polynomial of Correctable Patterns

  • N. Sendrier
Part of the International Centre for Mechanical Sciences book series (CISM, volume 339)

Abstract

We present here some new combinatoric tools to evaluate the performances of a decoding algorithm correcting either errors alone, either errors and erasures simultaneously. We show how the newly defined polynomials of correctable patterns and polynomials of miscorrected patterns can be connected with the correction an miscorrection probabilities in a given symmetric memoryless channel with or without erasures.

We propose a definition of a decoding algorithm that fits to symmetric channels with errors and erasures. In particular we define the closed algorithms: for instance the Berleykamp-Massey algorithm for BCH codes. For this class of algorithm, we are able to compute the polynomials of correctable and miscorrected patterns. Thus we have a short and easily computed formula for the probabilities of correction and miscorrection of any code using a closed decoding algorithm.

Keywords

Transmission Channel Decode Algorithm Weight Enumerator Error Weight Correctable Pattern 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P. Camion. Private communication.Google Scholar
  2. [2]
    P. Camion and J.-L. Politano. Evaluation of a coding design for a very noisy chanel. In G. Cohen and J. Wolfmann, editors, Coding Theory and Applications, number 388 in LNCS. Springer-Verlag, 1988.Google Scholar
  3. [3]
    K. Cheung. More on the decoder error probability for Reed-Solomon codes. IEEE Transaction on Information Theory, 35: 895–900, July 1989.CrossRefMATHGoogle Scholar
  4. [4]
    P. Delsarte. An Algebraic Approach to the Association Schemes of Coding Theory. Thèse, Université Catholique de Louvain, June 1973.MATHGoogle Scholar
  5. [5]
    I. Goulden and D. Jackson. Combinatorial Enumeration. John Wiley & Sons, 1983.Google Scholar
  6. [6]
    Z. Huntoon and A. Michelson. On the computation of the probability of post-decoding error events for block codes. IEEE Transaction on Information Theory, 23: 399–403, May 1977.CrossRefMATHGoogle Scholar
  7. [7]
    S. Jennings. On computing the performance probabilities of Reed-Solomon codes. In J. Calmet, editor, Proceedings of the 3rd International Conference, AAECC-3, number 229 in LNCS, pages 59–68. Springer Verlag, July 1985.Google Scholar
  8. [8]
    T. Kasami and S. Lin. On the probability of undetected error for the maximum distance separable codes. IEEE Transaction on Communication, 32: 998–1006, Sept. 1984.CrossRefMATHMathSciNetGoogle Scholar
  9. [9]
    T. Klove. The probability of undetected error when a code is used for error correction and detection. IEEE Transaction on Information Theory, 30: 388–392, Mar. 1984.CrossRefMathSciNetGoogle Scholar
  10. [10]
    F. MacWilliams and N. Sloane. The Theory of Error Correcting Codes. North-Holland, 1977.Google Scholar
  11. [11]
    R. McEliece and L. Swanson. On the decoder error probability for Reed-Solomon codes. IEEE Transaction on Information Theory, 32: 701–703, Sept. 1986.CrossRefMATHMathSciNetGoogle Scholar
  12. [12]
    N. Sendrier. Codes Correcteurs d’Erreurs à Haut Pouvoir de Correction. Thèse de doctorat, Université Paris 6, Dec. 1991.Google Scholar
  13. [13]
    J. Vitter and P. Flajolet. Analysis of algorithms and data structures. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume A: Algorithms and Complexity, chapter 9, pages 431–524. North Holland, 1990.Google Scholar
  14. [14]
    J. Wolf, A. Michelson, and A. Levesque. On the probability of undetected error for linear block codes. IEEE Transaction on Communication, 30: 317–324, Feb. 1982.CrossRefMATHGoogle Scholar

Copyright information

© Springer-Verlag Wien 1993

Authors and Affiliations

  • N. Sendrier
    • 1
  1. 1.INRIA, RocquencourtLe ChesnayFrance

Personalised recommendations