A collection of disjoint subsets A = {A1, A2, ..., Am} of a finite abelian group has the bimodal property if each non-zero group element δ either never occurs as a difference between an element of Ai and an element of Aj with j ≠ i, or else for every element ai in Ai there is an element aj ∈ Aj for some j ≠ i with ai - aj = δ. This property arises in familiar situations, such as cosets of a fixed subgroup or in a group partition, and has applications to the construction of optimal algebraic manipulation detection codes. In this paper, we obtain a structural characterisation for bimodal collections of sets
On supplementary difference sets Given a finite abelian group V and subsets S1, S2,...,Sn of V, writ...
Let G be a finite group. A subset X of G is a set of pairwise non-commuting elements if any two dist...
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite...
A collection of disjoint subsets A = {A1, A2, ..., Am} of a finite abelian group has the bimodal pro...
All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm whi...
The subgroup lattice of a group G is the graph whose vertices are the subgroups of G and adjacency i...
Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the ma...
AbstractA matching in a group G is a bijection φ from a subset A to a subset B in G such that aφ(a)∉...
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for...
Let $G$ be an abelian group of bounded exponent and $A \subseteq G$. We show that if the collection...
Abstract. Let n> 0 be an integer and X be a class of groups. We say that a group G satisfies the ...
Abstract. We extend Kemperman’s Structure Theorem by completely characterizing those finite subsets ...
AbstractConvolutional codes over Abelian groups provide an effective theoretical framework for the a...
Convolutional codes over Abelian groups provide an effective theoretical framework for the analysis ...
AbstractLet G be a finite abelian group with a ‘sufficiently small’ proportion of elements of order ...
On supplementary difference sets Given a finite abelian group V and subsets S1, S2,...,Sn of V, writ...
Let G be a finite group. A subset X of G is a set of pairwise non-commuting elements if any two dist...
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite...
A collection of disjoint subsets A = {A1, A2, ..., Am} of a finite abelian group has the bimodal pro...
All non-abelian finite simple groups can be symmetrically generated by involutions. An algorithm whi...
The subgroup lattice of a group G is the graph whose vertices are the subgroups of G and adjacency i...
Given a finite abelian group $G$ and a subset $J\subset G$ with $0\in J$, let $D_{G}(J,N)$ be the ma...
AbstractA matching in a group G is a bijection φ from a subset A to a subset B in G such that aφ(a)∉...
Coset enumeration, based on the methods described by Todd and Coxeter, is one of the basic tools for...
Let $G$ be an abelian group of bounded exponent and $A \subseteq G$. We show that if the collection...
Abstract. Let n> 0 be an integer and X be a class of groups. We say that a group G satisfies the ...
Abstract. We extend Kemperman’s Structure Theorem by completely characterizing those finite subsets ...
AbstractConvolutional codes over Abelian groups provide an effective theoretical framework for the a...
Convolutional codes over Abelian groups provide an effective theoretical framework for the analysis ...
AbstractLet G be a finite abelian group with a ‘sufficiently small’ proportion of elements of order ...
On supplementary difference sets Given a finite abelian group V and subsets S1, S2,...,Sn of V, writ...
Let G be a finite group. A subset X of G is a set of pairwise non-commuting elements if any two dist...
A packing of partial difference sets is a collection of disjoint partial difference sets in a finite...