Characterising bimodal collections of sets in finite groups
Combinatorics
2019-03-29 v1
Abstract
A collection of disjoint subsets of a finite abelian group is said to have the \emph{bimodal} property if, for any non-zero group element , either never occurs as a difference between an element of and an element of some other set , or else for every element in there is an element for some such that . This property arises in various familiar situations, such as the cosets of a fixed subgroup or in a group partition, and has applications to the construction of optimal algebraic manipulation detection (AMD) codes. In this paper, we obtain a structural characterisation for bimodal collections of sets.
Keywords
Cite
@article{arxiv.1903.11620,
title = {Characterising bimodal collections of sets in finite groups},
author = {Sophie Huczynska and Maura B. Paterson},
journal= {arXiv preprint arXiv:1903.11620},
year = {2019}
}