Some aspects of coding theory between probability, algebra, combinatorics and complexity theory
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  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 , 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 (,,) 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  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  on Coding Theory.
KeywordsLinear Code Minimum Weight Cyclic Code Code Theory Control Matrix
Unable to display preview. Download preview PDF.
- 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
- A.V.Aho, J.E.Hopcroft, J.D.Ullmann: The Design and Analysis of Computer Algorithms, Addison-Wesley, 1974Google Scholar
- E.R.Berlekamp: Algebraic Coding Theory, McGraw-Hill, 1968Google Scholar
- P.Camion: Ableian Codes, Math.Res.Center, Univ. of Wisconsin, Rept.1059, 1970Google Scholar
- J.H.Davenport: On the Integration of Algebraic Functions, LNCS 102, Springer 1981Google Scholar
- M.Eichler: Introduction to the Theory of Algebraic Numbers and Functions, Acad.Press, 1966Google Scholar
- J.Hirschfeld: Projective Geometries over Finite Fields, Oxford University 1979Google Scholar
- Y.Ihara: On modular curves over finite fields, in: Discrete subgroups of Lie groups and applications to moduli, Oxford Univ.Press 1973Google Scholar
- K.Ireland, M.Rosen: A Classical Introduction to Modern Number Theory, Springer GTM 84, 1982Google Scholar
- F.J.MacWilliams, N.J.A.Sloane: The Theory of Error-Correcting codes, North-Holland, 1978Google Scholar
- C.Roos: A result on the minimum distance of a linear code with applications to cyclic codes, manuscript, 1982Google Scholar
- G. Schellenberger: Ein schneller Weg zum Riemann-Roch'schen Theorem, Studienarbeit, Erlangen, 1981Google Scholar
- G.Schellenberger: Codes on Curves, to appear in: Proceedings Colloquium Geometry and its Applications, Passa di Mendola, 1982Google Scholar
- W.M.Schmidt: Equations over Finite Fields — An Elementary Approach, Springer LNM 536, 1970Google Scholar
- M.A.Tsfassman, S.G.Vladut, T.Zink: Modular curves, Skimura curves and Goppa codes, better than Gilbert-Varshamov bound, Manuscript1982Google Scholar
- J.H.van Lint: Introduction to Coding Theory, Springer GTM 86, 1982Google Scholar
- B.L.van der Waerden: Algebra II, Springer HTB 23, 1966Google Scholar
- I. Zech: Methoden der fehlerkorrigierenden Codierung, Studienarbeit, Erlangen 1982.Google Scholar