Design theory
Generalised Hadamard matrices which are developed modulo a group
Discrete Mathematics
A weak difference set construction for higher dimensional designs
Designs, Codes and Cryptography
Cocyclic Development of Designs
Journal of Algebraic Combinatorics: An International Journal
A survey on relative difference sets
GDSTM '93 Proceedings of a special research quarter on Groups, difference sets, and the monster
On (p^a, p^b, p^a, p^a-b)-Relative DifferenceSets
Journal of Algebraic Combinatorics: An International Journal
A unifying construction for difference sets
Journal of Combinatorial Theory Series A
A New Construction of Central Relative (pa, pa, pa, 1)-Difference Sets
Designs, Codes and Cryptography
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Characteristic Functions of Relative Difference Sets, Correlated Sequences and Hadamard Matrices
AAECC-13 Proceedings of the 13th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A Concise Guide to Complex Hadamard Matrices
Open Systems & Information Dynamics
Bundles, presemifields and nonlinear functions
Designs, Codes and Cryptography
Equivalence classes of multiplicative central (pn, pn, pn, 1)-relative difference sets
Cryptography and Communications
Divisible designs and semi-regular relative difference sets from additive Hadamard cocycles
Journal of Combinatorial Theory Series A
A theory of highly nonlinear functions
AAECC'06 Proceedings of the 16th international conference on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Hi-index | 0.00 |
Cocyclicmatrices have the form M = [ \psi(g, h)]_{g, h \in G}, where G is a finite group, C is afinite abelian group and \psi : G \times G \rightarrowC is a (two-dimensional) cocycle; that is, \psi(g, h) \psi(gh, k) = \psi(g,hk) \psi(h, k), \forall g, h, k \inG. This expression of the cocycle equation for finitegroups as a square matrix allows us to link group cohomology,divisible designs with regular automorphism groups and relativedifference sets. Let G have order vand C have order w, with w|v.We show that the existence of a G-cocyclic generalisedHadamard matrix GH (w, v/w) with entries in Cis equivalent to the existence of a relative ( v, w, v,v/w)-difference set in a central extension Eof C by G relative to the central subgroupC and, consequently, is equivalent to the existenceof a (square) divisible ( v, w, v, v/w)-design,class regular with respect to C, with a centralextension E of C as regular group ofautomorphisms. This provides a new technique for the constructionof semiregular relative difference sets and transversal designs,and generalises several known results.