Summary
In this paper we give sharp bounds for the block-length n of optimal linear (n, k)-codes over GF(q).
Similar content being viewed by others
References
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)
Heise, W., Karzel, H.: Laguerre und Minkowski-m-Strukturen. Rend. 1st. Mat. Univ. Trieste 4, 139–147 (1972)
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
Joshi, D. D.: A note on upper bounds for maximum distance codes. Information and Control 1, 289–295 (1958)
Singleton, R. C.: Maximum distance Q-nary codes. IEEE Trans. Information Theory IT 10, 116–118 (1964)
Author information
Authors and Affiliations
Rights 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
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00268141