DeepAI
Log In Sign Up

Tiling of Constellations

05/10/2021
by   Maiara F. Bollauf, et al.
0

Motivated by applications in reliable and secure communication, we address the problem of tiling (or partitioning) a finite constellation in ℤ_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.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/30/2019

Do non-free LCD codes over finite commutative Frobenius rings exist?

In this paper, we clarify some aspects on LCD codes in the literature. W...
08/03/2022

On the Identity Problem and the Group Problem in nilpotent groups

Let 𝒢 be a finite set of matrices in a unipotent matrix group G over ℚ, ...
12/24/2020

Linear complementary pair of group codes over finite principal ideal rings

A pair (C, D) of group codes over group algebra R[G] is called a linear ...
03/27/2018

Minimal Linear Codes over Finite Fields

As a special class of linear codes, minimal linear codes have important ...
01/03/2018

On maximum distance separable group codes with complementary duals

Given an LCD group code C in a group algebra KG, we inspect kinship betw...
07/12/2018

A note on regular subgroups of the automorphism group of the linear Hadamard code

We consider the regular subgroups of the automorphism group of the linea...
07/08/2020

A complete characterization of the APN property of a class of quadrinomials

In this paper, by the Hasse-Weil bound, we determine the necessary and s...