9 April 2021 in Designs, Codes and Cryptography
In this paper we consider a finite-dimensional vector space $${\mathcal {P}}$$ over the Galois field $${\text {GF}}(2),$$ and the family $${\mathcal {B}}_k$$ (respectively, $${\mathcal {B}}_k^*$$ ) of all the k-sets of elements of $$\mathcal {P}$$ (respectively, of $${\mathcal {P}}^*= {\mathcal {P}} \setminus \{0\}$$ ) summing up to zero. We compute the parameters of the 3-design $$({\mathcal {P}},{\mathcal {B}}_k)$$ for any (necessarily even) k, and of the 2-design $$({\mathcal {P}}^{*},{\mathcal {B}}_k^{*})$$ for any k. Also, we find a new proof for the weight distribution of the binary Hamming code. Moreover, we find the automorphism groups of the above designs by characterizing the permutations of $${\mathcal {P}}$$ , respectively of $${\mathcal {P}}^*$$ , that induce permutations of $${\mathcal {B}}_k$$ , respectively of $${\mathcal {B}}_k^*.$$ In particular, this allows one to relax the definitions of the permutation automorphism groups of the binary Hamming code and of the extended binary Hamming code as the groups of permutations that preserve just the codewords of a given Hamming weight.
2 September 2016 in Journal of Algebraic Combinatorics
13 June 2020 in Journal of Algebraic Combinatorics
1 February 2011 in Linear Algebra and its Applications
1 January 2018 in Moscow Mathematical Journal
9 April 2007 in Journal of the Australian Mathematical Society
We call an algebraic group monothetic if it possesses a dense cyclic subgroup. For an arbitrary field k we describe the structure of all, not necessarily affine, monothetic k-groups G and determine in which cases G has a k-rational generator.