On enumeration of nonequivalent perfect binary codes of length 15 and rank 15

被引：0
|
作者：
Malyugin S.A. [1 ]
机构：
[1] Sobolev Institute of Mathematics, Novosibirsk 630090
来源：
Journal of Applied and Industrial Mathematics | 2007年 / 1卷 / 01期
基金：
俄罗斯基础研究基金会;
关键词：
Automorphism Group; Linear Code; Perfect Code; Suitable Vector; Cyclic Representation;
D O I：
10.1134/S1990478907010085
中图分类号：
学科分类号：
摘要：
All nonequivalent perfect binary codes of length 15 and rank 15 are constructed that are obtained from the Hamming code H15 by translating its disjoint components. Also, the main invariants of this class of codes are determined such as the ranks, dimensions of kernels, and orders of automorphism groups. © Pleiades Publishing, Ltd. 2007.
引用
收藏
页码：77 / 89
页数：12
相关论文
共 50 条
12345