Paper Info
Title
Propelinear codes related to some classes of optimal codes.
Abstract
A code is said to be propelinear if its automorphism group contains a subgroup that acts regularly on codewords. We show propelinearity of complements of cyclic codes C 1,i , (i, 2 m − 1) = 1, of length n = 2 m − 1, including the primitive two-error-correcting BCH code, to the Hamming code; the Preparata code to the Hamming code; the Goethals code to the Preparata code; and the Z4-linear Preparata code to the Z4-linear perfect code.
Year
DOI
Venue
2017
10.1134/S0032946017030061
Probl. Inf. Transm.
Field
DocType
Volume
Hamming code,Discrete mathematics,Preparata code,Automorphism group,Combinatorics,Block code,BCH code,Linear code,Code (cryptography),Mathematics
Journal
53
Issue
ISSN
Citations 
3
0032-9460
0
PageRank 
References 
Authors
0.34
7
2
Name
Order
Citations
PageRank
Ivan Yu. Mogilnykh1368.74
Faina I. Solov'eva25914.78