Abstract
(MDS)- and Laguerre codes are closely related to geometry and can be used in order to construct certain finite incidence structures. Here we present some structure theorems on near rings, introduce the notion of a “coding set” of a near ring, which enables us to construct (MDS)-codes, and discuss the same problem for Laguerre codes. To find non trivial “Laguerre sets” in a near ring is much more difficult.
Keywords
Structure Theorem Incidence Structure Finite Incidence Finite Incidence Structure
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.
References
- [1]ANSHEL, M., and CLAY, J.R.: Planarity in algebraic systems. Bull. Amer. Math. Soc.74 (1968), 746–748Google Scholar
- [2]BETSCH, G., and CLAY, J.R.: Block designs from Frobenius groups and planar near-rings. Proc. Conf. finite groups (Park City, Utah), Acad. Press 1976, 473–502Google Scholar
- [3]FERRERO, G.: Classificazione e costruzione degli stems p-singolari. Ist. Lombardo Accad. Sci. Lett. Rend. A.102 (1968), 597–613Google Scholar
- [4]HALDER, H.-R., and HEISE, W.: Einführung in die Kombinatorik. Carl Hanser Verlag, München Wien 1976Google Scholar
- [5]HEISE, W., and QUATTROCCHI, P.: Informations- und Codierungstheorie. Springer Verlag, Berlin-Heidelberg-New York 1989Google Scholar
- [6]KARZEL, H.: Circle Geometry and its Application to Code Theory. To appear in CISM Lecture Notes, UDINEGoogle Scholar
- [7]KARZEL, H., and KROLL, H.-J.: Geschichte der Geometrie seit Hilbert. Wiss. Buchgesellschaft Darmstadt 1988Google Scholar
- [8]MELDRUM, J.: Near-rings and their links with groups. Pitman Publ. Co. (Research Note Series No.134), 1985Google Scholar
- [9]PILZ, G.: Near-Rings. Amsterdam-New York- Oxford 1977Google Scholar
- [10]WÄHLING, H.: Theorie der Fastkörper. Thales Verlag Essen 1987Google Scholar
Copyright information
© Birkhäuser Verlag 1990