DocumentCode :
4273
Title :
Involutions in Additive 1-Perfect Codes
Author :
Phelps, Kevin T.
Author_Institution :
Math. & Stat. Dept., Auburn Univ., Auburn, AL, USA
Volume :
59
Issue :
10
fYear :
2013
fDate :
Oct. 2013
Firstpage :
6593
Lastpage :
6596
Abstract :
Given a 1-perfect code C, the group of symmetries of C, Sym(C)={π ∈ Sn | π(C)=C}, is a subgroup of the group of automorphisms of C. In this paper, we focus on symmetries of order 2, i.e., involutions. Let Inv(C) ⊆ Sym(C) be the set of involutions of C. An additive code C of type (α,β) is a subgroup of BBZ2α×BBZ4β. For additive 1-perfect codes C of length 2t-1, we establish that any involution π ∈ Inv(C) must have at least 2k-1 fixed points where k ≥ [t/2].
Keywords :
codes; computational complexity; additive 1-perfect codes; automorphisms; involutions; symmetry group; Additives; Binary codes; Educational institutions; Error correction codes; Generators; Kernel; Vectors; ${BBZ}_{2}{BBZ}_{4}$-linear codes; Additive codes; automorphism group; involutions; perfect codes; symmetry group;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2013.2270274
Filename :
6544693
Link To Document :
بازگشت