AbstractLet G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the dual code of the code spanned by the sets of fixed points of involutions of G. We show that any G-invariant self-orthogonal code of length n is contained in C(G,Ω). Many self-orthogonal codes related to sporadic simple groups, including the extended Golay code, are obtained as C(G,Ω). Some new self-dual codes invariant under sporadic almost simple groups are constructed
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
AbstractA general method unifying the known constructions of binary self-orthogonal codes from desig...
AbstractWe give a construction of binary doubly even self dual codes as binary images of some princi...
Let G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the d...
AbstractLet G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined ...
Let G be a permutation group on an n-element set . We study the binary code C(G;) de¯ned as the dual...
AbstractWe examine a design D and a binary code C constructed from a primitive permutation represent...
AbstractWe study the orthogonal group Om of m×m matrices over the field of two elements and give app...
Through a modular representation theoretical approach we enumerate all non-trivial codes from the 2-...
Through a modular representation theoretical approach we enumerate all non-trivial codes from the 2-...
AbstractWe construct self-dual codes of length 100 invariant under the Hall–Janko group J2. We also ...
AbstractLet C be a binary code of length n and let JC (a, b, c, d) be its biweight enumerator. If n ...
AbstractAll optimal binary self-dual codes of length 42 which have an automorphism of order 3 are co...
AbstractA general method unifying known constructions of binary self-orthogonal codes from combinato...
AbstractWe prove that almost every binary self-dual code has trivial automorphism group. We also con...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
AbstractA general method unifying the known constructions of binary self-orthogonal codes from desig...
AbstractWe give a construction of binary doubly even self dual codes as binary images of some princi...
Let G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined as the d...
AbstractLet G be a permutation group on an n-element set Ω. We study the binary code C(G,Ω) defined ...
Let G be a permutation group on an n-element set . We study the binary code C(G;) de¯ned as the dual...
AbstractWe examine a design D and a binary code C constructed from a primitive permutation represent...
AbstractWe study the orthogonal group Om of m×m matrices over the field of two elements and give app...
Through a modular representation theoretical approach we enumerate all non-trivial codes from the 2-...
Through a modular representation theoretical approach we enumerate all non-trivial codes from the 2-...
AbstractWe construct self-dual codes of length 100 invariant under the Hall–Janko group J2. We also ...
AbstractLet C be a binary code of length n and let JC (a, b, c, d) be its biweight enumerator. If n ...
AbstractAll optimal binary self-dual codes of length 42 which have an automorphism of order 3 are co...
AbstractA general method unifying known constructions of binary self-orthogonal codes from combinato...
AbstractWe prove that almost every binary self-dual code has trivial automorphism group. We also con...
Extended binary Golay codes are examples of extreme binary self-dual codes of Type II (linear binary...
AbstractA general method unifying the known constructions of binary self-orthogonal codes from desig...
AbstractWe give a construction of binary doubly even self dual codes as binary images of some princi...