Application of coding theory to the construction of the Singer difference sets†
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..
- On Abelian difference set codes
- Uncorrelated minimum-length sequence and its application to parameter estimation
- Gauss sums, Jacobi sums, and \(p\)-ranks of cyclic difference sets
- An application of difference sets to a problem concerning graphical codes
- scientific article; zbMATH DE number 3847401 (Why is no real title available?)
- An Application of Set Theory to Coding Theory
- scientific article; zbMATH DE number 1867221 (Why is no real title available?)
This page was built for publication: Application of coding theory to the construction of the Singer difference sets†
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5675265)