Skip to main content
Log in

Optimal codes, n-arcs and Laguerre geometry

  • Published:
Acta Informatica Aims and scope Submit manuscript

Summary

In this paper we give sharp bounds for the block-length n of optimal linear (n, k)-codes over GF(q).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Halder, H.-R., Heise, W.: On the existence of finite chain-m-structures and k-arcs in finite projective spaces. Geometriae Dedicata 3, 483–486 (1975)

    Google Scholar 

  2. Heise, W., Karzel, H.: Laguerre und Minkowski-m-Strukturen. Rend. 1st. Mat. Univ. Trieste 4, 139–147 (1972)

    Google Scholar 

  3. Heise, W., Seybold, H.: Das Existenzproblem der Möbius-, Laguerre und Minkowski-Erweiterungen endlicher affiner Ebenen. Bayerische Akademie der Wissenschaften Klasse Mathematik-Naturwissenschaft 1975, S. 43–58

  4. Joshi, D. D.: A note on upper bounds for maximum distance codes. Information and Control 1, 289–295 (1958)

    Google Scholar 

  5. Singleton, R. C.: Maximum distance Q-nary codes. IEEE Trans. Information Theory IT 10, 116–118 (1964)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heise, W. Optimal codes, n-arcs and Laguerre geometry. Acta Informatica 6, 403–406 (1976). https://doi.org/10.1007/BF00268141

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00268141

Keywords

Navigation