Application of coding theory to the construction of the Singer difference sets† (Q5675265)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 3410922
Language Label Description Also known as
default for all languages
No label defined
    English
    Application of coding theory to the construction of the Singer difference sets†
    scientific article; zbMATH DE number 3410922

      Statements

      Application of coding theory to the construction of the Singer difference sets† (English)
      0 references
      0 references
      0 references
      1973
      0 references
      0 references
      0 references
      In this paper the authors construct, using elementary notions from algebraic coding theory, the cyclic difference sets on parameters \(v=q^{n-1}/(q-1)\), \(k=q^{n-1}\), \(\lambda=q^{n-2}(q-1)\), where \(q\) is a prime power. These are the complements of the Singer difference sets. The construction is simple and especially convenient for a computing machine. For \(q=2\) an advantage of this method is that the 2-ranks (rank as a matrix over \(\mathrm{GF}(2)\)) of the incidence matrices are apparent for both these designs and their complements..
      0 references

      Identifiers