Evaluation of a coding design for a very noisy channel
Evaluation d'une Configuration de Codage Pour une Ligne tres Bruitee
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.
Key-wordsCode concatenation pseudo-random interleaving erasures polynomial of correctable patterns
frCode concaténation entrelacement pseudo-aléatoire effacements polynôme des schémas corrigibles
Unable to display preview. Download preview PDF.