🤖 AI Summary
This study addresses the existence of perfect and quasi-perfect splitting sets in finite abelian groups—a problem with significant applications in flash memory coding. Using cyclotomic polynomial theory, we conduct a structural analysis of splittings over ℤₙ, integrating tools from algebraic number theory and combinatorial design. Our contributions are threefold: (i) we establish a novel structural correspondence between B[-k,k](q) and B[-(k−1),k+1](q) splitting sets; (ii) we derive the first necessary and sufficient condition for the existence of perfect B[-1,5](q) splitting sets; and (iii) we rigorously prove the nonexistence of two canonical classes of quasi-perfect splitting sets in all prime-power-order groups. Collectively, these results provide a general existence criterion for perfect splitting sets under specific parameters and fill a critical gap in the theoretical understanding of quasi-perfect splittings—thereby advancing and systematizing the foundational framework of splitting set theory.
📝 Abstract
In this paper, the existence of perfect and quasi-perfect splitter sets in finite abelian groups is studied, motivated by their application in coding theory for flash memory storage. For perfect splitter sets we view them as splittings of $mathbb{Z}_n$, and using cyclotomic polynomials we derive a general condition for the existence of such splittings under certain circumstances. We further establish a relation between $B[-k, k](q)$ and $B[-(k-1), k+1](q)$ splitter sets, and give a necessary and sufficient condition for the existence of perfect $B[-1, 5](q)$ splitter sets. Finally, two nonexistence results for quasi-perfect splitter sets are presented.