Abstract A Sidon set is a subset of an Abelian group with the property that the sums of two distinct elements are distinct. We relate the Sidon sets constructed by Bose to affine subspaces of $ \mathbb {F} _ {q ^ 2} $ of dimension one. We define Sidon arrays which are combinatorial objects giving a partition of the group $\mathbb {Z}_{q ^ 2} $ as a union of Sidon sets. We also use linear recurring sequences to quickly obtain Bose-type Sidon sets without the need to use the discrete logarithm.
Tópico:
graph theory and CDMA systems
Citaciones:
1
Citaciones por año:
Altmétricas:
0
Información de la Fuente:
FuenteBulletin of the Australian Mathematical Society