bei Google ScholarTitelangaben
Kohnert, Axel:
Constructing two-weight codes with prescribed groups of automorphisms.
In: Discrete Applied Mathematics.
Bd. 155
(2007)
Heft 11
.
- S. 1451-1457.
ISSN 1872-6771
DOI: https://doi.org/10.1016/j.dam.2007.03.006
Abstract
We construct new linear two-weight codes over the finite field with q elements. To do so we solve the equivalent problem of finding point sets in the projective geometry with certain intersection properties. These point sets are in bijection to solutions of a Diophantine linear system of equations. To reduce the size of the system of equations we restrict the search for solutions to solutions with special symmetries.
Two-weight codes can be used to define strongly regular graphs. We give tables of the two-weight codes and the corresponding strongly regular graphs. In some cases we find new distance-optimal two-weight codes and also new strongly regular graphs.
Weitere Angaben
| Publikationsform: | Artikel in einer Zeitschrift |
|---|---|
| Begutachteter Beitrag: | Ja |
| Keywords: | Finite projective geometry; Two-weight codes; Strongly regular graphs |
| Institutionen der Universität: | Fakultäten > Fakultät für Mathematik, Physik und Informatik > Mathematisches Institut > Lehrstuhl Mathematik II (Computeralgebra) Fakultäten Fakultäten > Fakultät für Mathematik, Physik und Informatik Fakultäten > Fakultät für Mathematik, Physik und Informatik > Mathematisches Institut |
| Titel an der UBT entstanden: | Ja |
| Themengebiete aus DDC: | 500 Naturwissenschaften und Mathematik > 510 Mathematik |
| Eingestellt am: | 22 Jan 2015 14:58 |
| Letzte Änderung: | 16 Mär 2023 11:44 |
| URI: | https://eref.uni-bayreuth.de/id/eprint/5796 |