Evaluation of a coding design for a very noisy channel

Evaluation d'une Configuration de Codage Pour une Ligne tres Bruitee

  • Paul Camion
  • Jean-Luc Politano
Section IV Applications
Part of the Lecture Notes in Computer Science book series (LNCS, volume 388)


An interleaving array of depth I comprises I code-words obtained by concatenating two codes. The symbols of that array are permuted according to a pseudo-random law. The sequence of symbols obtained in that way is transmitted over a very noisy channel. That channel can be for example an erasable recording medium. It is assumed that at most E erasures may occur which appear in the restored array as if they were dealt according to a uniform probability law. A random variable θ is defined over the set of all arrays comprising E erasures. The value of θ is the number of concatenated code-words in the array that may be corrected. The notion of polynomial of correctable patterns is introduced. That polynomial allows calculating the moments of the random variable θ. To set one's ideas, the investigation is lead on the particular case of concatenating a Reed-Solomon (14,7) code and a Hamming (8,4) binary code.


Code concatenation pseudo-random interleaving erasures polynomial of correctable patterns 


Code concaténation entrelacement pseudo-aléatoire effacements polynôme des schémas corrigibles 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F.J. MACWILLIAMS, N.J.A. SLOANE, "The Theory of Error-Correcting Codes", North-Holland.Google Scholar
  2. [2]
    W. FELLER, "An Introduction to Probability Theory and Its Applications", Vol. 1, Third Edition, John Wiley & Sons.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Paul Camion
    • 1
  • Jean-Luc Politano
    • 2
  1. 1.CNRS et INRIA Domaine de Voluceau - RocquencourtLe Chesnay CedexFrance
  2. 2.ATFH et INRIALevallois PerretFrance

Personalised recommendations