On perfect t-shift codes in abelian groups

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


Let G be a finite abelian group, t a positive integer. The t-shift sphere with center x ∈G is the set St(x)={±ix|i=1,..., t}. A t-shift code is a subset X of G such that the sets St(x) (x ∈X) have size 2 t and are disjoint. Clearly, the sphere packing bound: 2 t|X|+1≤|G| holds for any t-shift code X. A perfect t-shift code is a t-shift code X with 2 t|X|+1=|G|. A necessary and sufficient condition for the existence of a perfect t-shift code in a finite abelian group is known for t-1, 2. In this paper, we determine finite abelian groups in which there exists a perfect t-shift code for t=3, 4.

Original languageEnglish
Pages (from-to)253-259
Number of pages7
JournalDesigns, Codes, and Cryptography
Issue number3
Publication statusPublished - 1995 May


Dive into the research topics of 'On perfect t-shift codes in abelian groups'. Together they form a unique fingerprint.

Cite this