New Results on Binary Codes Obtained by Doubling Construction

Abstract

Binary codes created by doubling construction, including quasi-perfect ones with distance d = 4, are investigated. All [17·2r−6, 17·2r−6 − r, 4] quasi-perfect codes are classified. Weight spectrum of the codes dual to quasi-perfect ones with d = 4 is obtained. The automorphism group Aut(C) of codes obtained by doubling construction is studied. A subgroup of Aut(C) is described and it is proved that the subgroup coincides with Aut(C) if the starting matrix of doubling construction has an odd number of columns. (It happens for all quasi-perfect codes with d = 4 except for Hamming one.) The properness and t-properness for error detection of codes obtained by doubling construction are considered.

Keywords

• linear binary codes
• doubling construction
• quasi-perfect codes
• automorphism group of a code
• proper and t-proper codes