Using the simplex code to construct relative difference sets in 2-groups

DOI10.1023/A:1008246212180zbMath0880.05020OpenAlexW1576363077MaRDI QIDQ1358666

Surinder K. Sehgal, James A. Davis

Publication date: 3 July 1997

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1008246212180

zbMATH Keywords

relative difference setsbinary simplex code

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10)

Related Items (3)

On \((p^ a,p,p^ a,p^{a-1})\)-relative difference sets ⋮ A unifying construction for difference sets ⋮ Relative \((p^a, p^b, p^a, p^{a-b})\)-difference sets: A unified exponent bound and a local ring construction

This page was built for publication: Using the simplex code to construct relative difference sets in 2-groups