Splittings of cyclic groups and perfect shift codes
A splitting of an additive abelian group \(G\) is a pair \((M,S)\), where \(M\) is a set of integers and \(S\) is a subset of \(G\), such that every non-zero element of \(G\) can be expressed uniquely in the form \(mh\) for some \(m\in M, h\in S\). The author investigates splittings of cyclic groups \(Z_p\) of prime order by sets of the form \[ M_1=\{1,a,a^2,\ldots,a^r,b,b^2,\ldots, b^s\}\text{ and }M_2=\{\pm 1,\pm a,\pm a^2,\ldots,\pm a^r,\pm b,\pm b^2,\ldots, \pm b^s\}, \] where \(r,s\geq 1\). It is shown that the search for such splittings is equivalent to the search for factorizations \(M_1S\) of the groups \(Z_p^*\) and \(Z_p^*/\{\pm 1\}\) respectively. The main result is a set of necessary and sufficient conditions for splittings to exist and an explicit description of the splitting sets \(S\). Computational issues arising from the search for splittings are discussed. The author also describes connections with \(k\)-shift codes, perfect shift codes, tilings of Euclidean space, run-length limited codes, and notes a connection with the study of memory with defects.
- On perfect t-shift codes in abelian groups
- Complete decompositions of finite abelian groups
- On tilings of asymmetric limited-magnitude balls
- Nonsingular splittings of cyclic groups
- On the existence of perfect splitter sets
- On the non-existence of lattice tilings by quasi-crosses
- Integer \(t\)-shift codes and factoring abelian groups
- On lattice tilings of \(\mathbb{Z}^n\) by limited-magnitude error balls \(\mathcal{B}(n, 2, k_1, k_2)\) with \(k_1 > k_2\)
This page was built for publication: Splittings of cyclic groups and perfect shift codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4701179)