We recursively construct a new family of (26d+4, 8, 26d+4, 26d+1) semi-regular relative difference sets in abelian groups G relative to an elementary abelian subgroup U. The initial case d = 0 of the recursion comprises examples of (16, 8, 16, 2) relative difference sets for four distinct pairs (G, U).
Copyright © 1998, Springer. This article first appeared in Designs, Codes, and Cryptography: 17:1 (1998), 305-312.
Please note that downloads of the article are for private/personal use only.
Davis, James A., and Jonathan Jedwab. "A New Family of Relative Difference Sets in 2-Groups." Designs, Codes, and Cryptography 17, no. 1 (September 1998): 305-12. doi:10.1023/A:1008371005749.