Some New Results on Splitter Sets

Zuo Ye, Tao Zhang, Xiande Zhang, Gennian Ge

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Splitter sets have been widely studied due to their applications in flash memories, and their close relations with lattice tilings and conflict avoiding codes. In this paper, we give necessary and sufficient conditions for the existence of nonsingular perfect splitter sets, ${B}[-{k}_{1},{k}_{2}]({p})$ sets, where \le {k}_{1}\leq {k}_{2}=4$. Meanwhile, constructions of nonsingular perfect splitter sets are given. When perfect splitter sets do not exist, we present four new constructions of quasi-perfect splitter sets. Finally, we give a connection between nonsingular splitter sets and Cayley graphs, and as a byproduct, a general lower bound on the maximum size of nonsingular splitter sets is given.

Original languageEnglish
Article number8894541
Pages (from-to)2765-2776
Number of pages12
JournalIEEE Transactions on Information Theory
Issue number5
StatePublished - 1 May 2020
Externally publishedYes


  • Cayley graph
  • Splitter set
  • flash memory
  • lattice tiling

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences


Dive into the research topics of 'Some New Results on Splitter Sets'. Together they form a unique fingerprint.

Cite this