Weighted external difference families and R-optimal AMD codes
Abstract
In this paper, we provide a mathematical framework for characterizing AMD codes that are R-optimal. We introduce a new combinatorial object, the reciprocally-weighted external difference family (RWEDF), which corresponds precisely to an R-optimal weak AMD code. This definition subsumes known examples of existing optimal codes, and also encompasses combinatorial objects not covered by previous definitions in the literature. By developing structural group-theoretic characterizations, we exhibit infinite families of new RWEDFs, and new construction methods for known objects such as near-complete EDFs. Examples of RWEDFs in non-abelian groups are also discussed.
Citation
Huczynska , S & Paterson , M 2019 , ' Weighted external difference families and R-optimal AMD codes ' , Discrete Mathematics , vol. 342 , no. 3 , pp. 855-867 . https://doi.org/10.1016/j.disc.2018.11.009
Publication
Discrete Mathematics
Status
Peer reviewed
ISSN
0012-365XType
Journal article
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.