Construction of Two-Weight Codes

This is a talk given at the conference: Algebra and Computation 2005 in Tokyo. We describe a method for the construction of two-weight codes. This also allows to realize certain strongly regular graphs or equivalently certain point sets in the a finite projective geometry. We use the method of prescibed automorphisms, which allows us to reduce the problem to a size where we can use powerful Diophantine equation solvers provided by Alfred Wassermann.

Download full text files

Export metadata

  • Export Bibtex
  • Export RIS
  • frontdoor_exportcitavi

Additional Services

    Share in Twitter Search Google Scholar
Metadaten
Institutes:Informatik
Author: Axel Kohnert
Year of Completion:2005
SWD-Keyword:Codierungstheorie; Projektive Geometrie; Stark regulärer Graph
Dewey Decimal Classification:004 Datenverarbeitung; Informatik
URN:urn:nbn:de:bvb:703-opus-1908
Document Type:Article
Language:English
Date of Publication (online):05.12.2005