Using the Simplex Code to Construct Relative Difference Sets in 2-groups

Designs, Codes, and Cryptography

Volumn 11, Issue 3, 1997, Pages 267-277

  Davis, James A ^a   Sehgal, Surinder K ^b  

^a UNIVERSITY OF RICHMOND   (United States)

^b OHIO STATE UNIVERSITY   (United States)

Author keywords

2 groups; Relative difference sets; Simplex code

Indexed keywords

EID: 0010996066     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008246212180     Document Type: Article

References (9)

1. K. T. Arasu and S. Sehgal, Some new difference sets, J. Comb. Th., Ser. A, Vol. 69 (1995), pp. 170-172.
2. J. A. Davis, Construction of relative difference sets in p-groups, Discrete Mathematics, Vol. 103, (1992) pp. 7-15.
3. J. E. H. Elliot and A. T. Butson, Relative difference sets, Illinois J. Math, Vol 10, (1966) pp. 517-531.
4. R. Hill, A first course in coding theory, in Oxford Applied Mathematics and Computing Science Series, Oxford University Press, New York (1993).
5. D. Jungnickel, On automorphism groups of divisible designs, Can. J. Math, Vol. 34, (1982) pp. 257-297.
6. a-1) relative difference sets, Designs, Codes and Cryptography, Vol. 6 (1995) pp. 57-72.
7. A. Pott, A survey on relative difference sets. In K. T. Arasu et al., editors, Groups, Difference Sets, and the Monster, pp. 195-232, de Gruyter, Berlin-New York, 1996.
8. A. Pott, On the structure of abelian groups admitting divisible difference sets, J. Comb. Th., Ser. A, Vol. 65, (1994) pp. 202-213.
9. R. J. Turyn, Character sums and difference sets, Pacific J. Math., Vol 15, (1965) pp. 319-346.