Set Partitioning and Multilevel Coding for Codes Over Gaussian Integer Rings

This work demonstrates that the concept of set partitioning can be applied to Gaussian integer rings. It is shown that it is always possible to partition the Gaussian integer rings into subsets in a manner that the minimum Euclidean distance of each subset is strictly larger than in the original set. This enables multilevel code constructions for codes over Gaussian integers.