Using the simplex code to construct relative difference sets in 2-groups (Q1358666)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Using the simplex code to construct relative difference sets in 2-groups |
scientific article; zbMATH DE number 1028918
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Using the simplex code to construct relative difference sets in 2-groups |
scientific article; zbMATH DE number 1028918 |
Statements
Using the simplex code to construct relative difference sets in 2-groups (English)
0 references
3 July 1997
0 references
A generalization of a construction by \textit{K. T. Arasu} and \textit{S. K. Sehgal} [Some new difference sets, J. Comb. Theory, Ser. A 69, No. 1, 170-172 (1995; Zbl 0822.05004)] is presented that gives a family of relative difference sets in 2-groups that have a lower rank then previously known examples. The binary simplex code plays an important role in this construction.
0 references
relative difference sets
0 references
binary simplex code
0 references
0.86245596
0 references
0.85665286
0 references
0.8540783
0 references
0.85398865
0 references
0.85288477
0 references
0.8526038
0 references
0.85216534
0 references
0.8432267
0 references
0.8417093
0 references
