Refine
Document Type
- Article (1)
- Doctoral Thesis (1)
- Preprint (1)
Keywords
- endliche Geometrie (2)
- Assoziationsschema (1)
- Codierungstheorie (1)
- Galois-Feld (1)
- Galois-Ring (1)
- Gray-Abbildung (1)
- Hamming-Abstand (1)
- Kerdock-Code (1)
- Kombinatorik (1)
- Lee metric (1)
-
Inclusion-maximal integral point sets over finite fields
(2007)
- We consider integral point sets in affine planes over finite fields. Here an integral point set is a set of points in $GF(q)^2$ where the formally defined Euclidean distance of every pair of points is an element of $GF(q)$. From another point of view we consider point sets over $GF(q)^2$ with few and prescribed directions. So this is related to Redeis work. Another motivation comes from the field of ordinary integral point sets in Euclidean spaces. In this article we study the spectrum of integral point sets over $GF(q)^2$ which are maximal with respect to inclusion. We give some theoretical results, constructions, conjectures, and some numerical data.
-
Double and bordered alpha-circulant self-dual codes over finite commutative chain rings
(2008)
- In this paper we investigate codes over finite commutative rings R, whose generator matrices are built from alpha-circulant matrices. For a non-trivial ideal I < R we give a method to lift such codes over R/I to codes over R, such that some isomorphic copies are avoided. For the case where I is the minimal ideal of a finite chain ring we refine this lifting method: We impose the additional restriction that lifting preserves self-duality. It will be shown that this can be achieved by solving a linear system of equations over a finite field. Finally we apply this technique to Z_4-linear double nega-circulant and bordered circulant self-dual codes. We determine the best minimum Lee distance of these codes up to length 64.
-
Geometrische Konstruktionen linearer Codes über Galois-Ringen der Charakteristik 4 von hoher homogener Minimaldistanz
(2012)
- In dieser Arbeit werden vier neue unendliche Serien von linearen Codes über Galois-Ringen der Charakteristik 4 konstruiert. Hinsichtlich der Minimaldistanz übertreffen die Gray-Bilder der konstruierten Codes alle bekannten vergleichbaren linearen Codes. In den Konstruktionen wird die Theorie der projektiven Hjelmslev-Geometrien, der Assoziationsschemata sowie der symmetrischen Bilinearformen in endlichdimensionalen GF(2)-Vektorräumen benutzt.
