Coset Weight Enumerators of the Extremal Self-Dual Binary Codes of Length 32
Coset Weight Enumerators of the Extremal Self-Dual Binary Codes of Length 32
复制标题
长度为32的极值自对偶二进制码的陪集权枚举器
DOI：
10.1007/978-3-7091-2786-5_2
复制
发表时间：
1993
期刊：
影响因子：
--
通讯作者：
A. Monpetit
中科院分区：
文献类型：
--
作者：
P. Camion;B. Courteau;A. Monpetit
Conway and Pless have enumerated in [6] the 85 non-equivalent self-dual doubly-even codes of length 32. From this enumeration it happened that five codes were extremal, having the largest possible minimum distance which is 8 in length 32. Two of these five codes were already known, the second order Reed-Muller code RM32 and the extended quadratic residue code QR32 of length 32. The other three denoted 2g16, 8f4and 16f2by Conway and Pless were new. In [8], Koch has given another more direct construction of these Conway-Pless codes denoted by himF= 2g16,U= 8f4andG= 16f2. Since the five extremal codes, though pairwise non-equivalent, have the same weight enumerator it is natural to try to calculate the coset weight enumerators and to ask for some parameters which may distinguish them.
