TY - JOUR
T1 - On perfect t-shift codes in abelian groups
AU - Munemasa, Akihiro
PY - 1995/5
Y1 - 1995/5
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=33749437536&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33749437536&partnerID=8YFLogxK
U2 - 10.1007/BF01388387
DO - 10.1007/BF01388387
M3 - Article
AN - SCOPUS:33749437536
SN - 0925-1022
VL - 5
SP - 253
EP - 259
JO - Designs, Codes, and Cryptography
JF - Designs, Codes, and Cryptography
IS - 3
ER -