Several aspects of problems encountered in coding applications

  • C. Goutelard
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 229)


The applications of encoding cover some very large domains, such as telecommunications, by hertzian or guided channels, magnetic recording, instrumentation, teledetection, confidentiality...where a set of chronic problems appear.

An analysis of the principles issues follows.

The theorician defines codes which have properties stemming from their algebraic structure, and their exploitation allows the correction of a finite number of error configurations in decoding. Firstly, the implementation of procedures come up against material constraints of the complexity and rapidity of the calculations. In this domain, the rapid evolution of technology since 1970 has allowed for the implementation of powerful codes and in the near future we can already foresee the large growth of possibilities. However, the principle problems appear essentially in the actual choice of the codes used. The error configurations depend, in the transmission channels, on the energy distribution of a bit of information and on the distribution of noise in the channel in the time-frequency domain, and the characteristics of the signal used. The use of linear codes is often adopted, but if the cyclic codes, for which the mathematic tool is better adjusted, are frequently chosen, the convolutive codes reserve inviting aspects for the user thanks to their possibilities in exploiting weighted decisions. Finally, in certain cases, only the non-linear codes are susceptible to resolve the problems posed by the characteristics of actuel channels.

The choice in coding, in practice, results in a compromise which takes into account the mastering of developped techniques on known codes, the complexity of the material, the rapidity of processing and an estimation of error patterns. A different approach, but which is generally not used, consists in determining code characteristics using those from the transmission channel. This approach, which implies a more precise definition of the channel and specific research of codes leads to a more rational conception of systems. These additional techniques, like interleaving, combine to make the correction of certain error patterns casier.

Some examples show the effectiveness of encoding but also bring out its weaknesses.

They repose the crucial question of the cost of implantation of a code in a system faced with the solutions of substitution.


Error Probability Power Density Spectrum Transmission Channel Cyclic Code Convolutional Code 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    C.E. SHANNON. The mathematical theory of communication. University of Illinois Press 1949Google Scholar
  2. [2]
    F. CHAVAND, C. GOUTELARD, S. HARARI. Codage correcteur d'erreurs pour modem autoadaptatif. Résultats théoriques et expérimentaux. Symposium AGARD. 4–8 juin 1984. Grèce. Conference Proceeding AGARD No 363Google Scholar
  3. [3]
    P. GODLEWSKI. Principales classes de codes correcteurs d'erreurs. Traitement du signal. Volume 1 No 2–2. No spécial 1984Google Scholar
  4. [4]
    C. GOUTELARD, F. CHAVAND. Définition et construction des codes pseudo-orthogonaux. Annales des télécommunications. Tome 33 No 65. Mai-juin 1968.Google Scholar
  5. [5]
    N. NAKAGMI. The m distribution, a general formula of intensity distribution of rapid fadings, in: statistical methods in radiowave propagation. W.C. Hoffman Pergamon press 1960Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • C. Goutelard

There are no affiliations available

Personalised recommendations