Advertisement

Some aspects of coding theory between probability, algebra, combinatorics and complexity theory

  • Thomas Beth
Conference paper
Part of the Lecture Notes in Mathematics book series (LNM, volume 969)

Abstract

The aim of this survey report is to draw attention to some recent developments which seem to have changed the face of Coding Theory completely. While this area of applicable algebra -which has strongly been influenced [3] by hard problems of communications engineering- during the last two decades has become a main part of Combinatorics, reachign from Finite Geometries to Representation Theory [18], it has never been fully accepted as a part of Algebra itself — the reasons for this being manifold. On the one hand, Coding Theory can easily be mistaken for a part of Linear Algebra, while on the other hand a non-typical feature distinguishes it from the main concept of modern and classical algebra: The properties of codes are "basis-dependent" so that the many tools of "basis-free" algebra are not always helpful.

Due to some very recent publications ([13],[19],[29]) this situation may be changing very soon, as the interaction between these fields has provided new insights into both:

Results from Algebraic Geometry permit the construction of codes, which are better than those known before, while very well-known bounds on codes in turn improve Weil's bound for the number of points on a curve over a finite field.

On the other hand, a very recent paper [9] shows that the construction of extremely good codes is possible by rather elementary means.

The aim of this survey report is to introduce a general mathematical audience to the background, eventually leading to these new developments. As is usual for a survey the author has included results from many different fields, not just from his own one. Thus, this report hopefully is in the spirit of the classical understanding of research — providing a collection of material which is not even contained in the most recent book [30] on Coding Theory.

Keywords

Linear Code Minimum Weight Cyclic Code Code Theory Control Matrix 
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]
    R.Ahlswede, G.Dueck: The best known codes are Highly Probable and can be produced by a few permutations, Universität Bielefeld, Materialien XXIII, 1982Google Scholar
  2. [2]
    A.V.Aho, J.E.Hopcroft, J.D.Ullmann: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974Google Scholar
  3. [3]
    E.R.Berlekamp: Algebraic Coding Theory, McGraw-Hill, 1968Google Scholar
  4. [4]
    E.R. Berlekamp, R. McEliece, H.V. Tilburg: On the inherent intractability of certain coding problems, IEEE Trans.Inf.Th. 24, 384–386, 1978MathSciNetCrossRefzbMATHGoogle Scholar
  5. [5]
    T. Beth, V. Strehl: Materialien zur Codierungstheorie, Berichte IMMD, Erlangen, 11 Heft 14, 1978zbMATHGoogle Scholar
  6. [6]
    T. Beth et al.: Materialien zur Codierungstheorie II, Berichte IMMD, Erlangen, 12 Heft 10, 1979zbMATHGoogle Scholar
  7. [7]
    P.Camion: Ableian Codes, Math.Res.Center, Univ. of Wisconsin, Rept.1059, 1970Google Scholar
  8. [8]
    J.H.Davenport: On the Integration of Algebraic Functions, LNCS 102, Springer 1981Google Scholar
  9. [9]
    P. Delsarte, P. Piret: Algebraic Constructions of Shannon Codes for Regular Channels, IEEE Trans.Inf.Th. 28, 593–599, 1982MathSciNetCrossRefzbMATHGoogle Scholar
  10. [10]
    M.Eichler: Introduction to the Theory of Algebraic Numbers and Functions, Acad.Press, 1966Google Scholar
  11. [11]
    R. McEliece, E.R. Rodemich et al.: New upper bounds on the rate of a code via the Delsarte-MacWilliam inequalities, IEEE Trans.Inf.Th. 23, 157–166, 1977MathSciNetCrossRefzbMATHGoogle Scholar
  12. [12]
    G. Falkner, W. Heise et al.: On the existence of Cyclic Optimal Codes, Atti Sem. Mat.Fis., Univ.Modena, XXVIII, 326–341, 1979MathSciNetzbMATHGoogle Scholar
  13. [13]
    V.D. Goppa: Codes on Algebraic Curves, Soviet Math.Dokl. 24, 170–172, 1981MathSciNetzbMATHGoogle Scholar
  14. [14]
    J.Hirschfeld: Projective Geometries over Finite Fields, Oxford University 1979Google Scholar
  15. [15]
    Y. Ihara: Some remarks on the number of rational points of algebraic curves over finite fields, J.Fac.Science, Tokyo, 28, 721–724, 1981MathSciNetzbMATHGoogle Scholar
  16. [16]
    Y.Ihara: On modular curves over finite fields, in: Discrete subgroups of Lie groups and applications to moduli, Oxford Univ.Press 1973Google Scholar
  17. [17]
    K.Ireland, M.Rosen: A Classical Introduction to Modern Number Theory, Springer GTM 84, 1982Google Scholar
  18. [18]
    F.J.MacWilliams, N.J.A.Sloane: The Theory of Error-Correcting codes, North-Holland, 1978Google Scholar
  19. [19]
    Y.I. Manin: What is the maximum number of points on a curve over FF2? Fac.Science, Tokyo, 28, 715–720, 1981zbMATHGoogle Scholar
  20. [20]
    J.L. Massey: Step by Step decoding of the BCH-codes, IEEE Trans.Inf.Th. 11, 580–585, 1965MathSciNetCrossRefzbMATHGoogle Scholar
  21. [21]
    H. Nussbaumer: The Fast Fourier Transform and Convolution Algorithms, Springer, Wien, 1980.zbMATHGoogle Scholar
  22. [22]
    N.J. Patterson: The algebraic decoding of Goppa-Codes, IEEE Trans.Inf.Th.,21, 203–207, 1975MathSciNetCrossRefzbMATHGoogle Scholar
  23. [23]
    C.Roos: A result on the minimum distance of a linear code with applications to cyclic codes, manuscript, 1982Google Scholar
  24. [24]
    G. Schellenberger: Ein schneller Weg zum Riemann-Roch'schen Theorem, Studienarbeit, Erlangen, 1981Google Scholar
  25. [25]
    G.Schellenberger: Codes on Curves, to appear in: Proceedings Colloquium Geometry and its Applications, Passa di Mendola, 1982Google Scholar
  26. [26]
    W.M.Schmidt: Equations over Finite Fields — An Elementary Approach, Springer LNM 536, 1970Google Scholar
  27. [27]
    C.E. Shannon: Communication in the presence of noise, Proc.IEEE, 37, 10–21, 1949MathSciNetGoogle Scholar
  28. [28]
    A. Tietáväinen: On the nonexistence of perfect codes over finite fields, SIAM J.Appl.Math 24, 88–96, 1973MathSciNetCrossRefGoogle Scholar
  29. [29]
    M.A.Tsfassman, S.G.Vladut, T.Zink: Modular curves, Skimura curves and Goppa codes, better than Gilbert-Varshamov bound, Manuscript1982Google Scholar
  30. [30]
    J.H.van Lint: Introduction to Coding Theory, Springer GTM 86, 1982Google Scholar
  31. [31]
    B.L.van der Waerden: Algebra II, Springer HTB 23, 1966Google Scholar
  32. [32]
    I. Zech: Methoden der fehlerkorrigierenden Codierung, Studienarbeit, Erlangen 1982.Google Scholar

Copyright information

© Springer-Verlag 1982

Authors and Affiliations

  • Thomas Beth
    • 1
  1. 1.Institute für Mathematische Maschinen und Datenverarbeitung IUniversität Erlangen-NürnbergErlangenFederal Republic of Germany

Personalised recommendations