Using the simplex code to construct relative difference sets in 2-groups
type: Item
instance of: scholarly article
title: Using the simplex code to construct relative difference sets in 2-groups
zbMATH Open document ID: 0880.05020
DOI: 10.1023/A:1008246212180
author: James A. Davis
author: Surinder K. Sehgal
published in: Designs, Codes and Cryptography
publication date: 1997-07-03T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05B10
Mathematics Subject Classification ID: 94B05
zbMATH DE Number: 1028918
zbMATH Keywords: relative difference sets
zbMATH Keywords: binary simplex code
reviewed by: Vladimir D. Tonchev
MaRDI profile type: Publication
full work available at URL: a:1008246212180
OpenAlex ID: W1576363077
Recommended article: Construction of relative difference sets and Hadamard groups
Recommended article: A group extensions approach to relative difference sets
Recommended article: On relative difference sets in dihedral groups
Recommended article: A new family of relative difference sets in \(2\)-groups
Recommended article: Construction of relative difference sets in \(p\)-groups
Recommended article: Properties of codes from difference sets in 2-groups.
Recommended article: Constructions of low rank relative difference sets in 2-groups using Galois rings
Recommended article: An application of difference sets to a problem concerning graphical codes
Recommended article: Two generalized constructions of relative difference sets
Recommended article: A group extensions approach to affine relative difference sets of even order
description: scientific article; zbMATH DE number 1028918