All Dates/Times are Australian Eastern Standard Time (AEST)

Technical Program

Paper Detail

Paper IDD1-S7-T2.3
Paper Title Tiling of Constellations
Authors Maiara Francine Bollauf, Øyvind Ytrehus, Simula UiB, Norway
Session D1-S7-T2: Algebraic Codes
Chaired Session: Tuesday, 13 July, 00:00 - 00:20
Engagement Session: Tuesday, 13 July, 00:20 - 00:40
Abstract Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in $\mathbb{Z}_{2^L}^n$ by subsets, in the case that the constellation does not possess an abelian group structure. The property that we do require is that the constellation is generated by a linear code through an injective mapping. The intrinsic relation between the code and the constellation provides a sufficient condition for a tiling to exist. We also present a necessary condition. Inspired by a result in group theory, we discuss results on tiling for the particular case when the finer constellation is an abelian group as well.