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 条
  • [41] Enumeration of binary trees compatible with a perfect phylogeny
    Julia A. Palacios
    Anand Bhaskar
    Filippo Disanto
    Noah A. Rosenberg
    Journal of Mathematical Biology, 2022, 84
  • [42] Enumeration of binary trees compatible with a perfect phylogeny
    Palacios, Julia A.
    Bhaskar, Anand
    Disanto, Filippo
    Rosenberg, Noah A.
    JOURNAL OF MATHEMATICAL BIOLOGY, 2022, 84 (06)
  • [43] ON THE SYMMETRY GROUP OF EXTENDED PERFECT BINARY CODES OF LENGTH n+1 AND RANK n-log(n+1)+2
    Heden, Olof
    Pasticci, Fabio
    Westerback, Thomas
    ADVANCES IN MATHEMATICS OF COMMUNICATIONS, 2012, 6 (02) : 121 - 130
  • [44] On rank and kernel of some mixed perfect codes
    Pasticci, Fabio
    Westerback, Thomas
    DISCRETE MATHEMATICS, 2009, 309 (09) : 2763 - 2774
  • [45] On intersection problem for perfect binary codes
    Avgustinovich, SV
    Heden, O
    Solov'eva, FI
    DESIGNS CODES AND CRYPTOGRAPHY, 2006, 39 (03) : 317 - 322
  • [46] On Intersection Problem for Perfect Binary Codes
    Sergey V. Avgustinovich
    Olof Heden
    Faina I. Solov’eva
    Designs, Codes and Cryptography, 2006, 39 : 317 - 322
  • [47] On New Perfect Binary Nonlinear Codes
    A. C. Lobstein
    V. A. Zinoviev
    Applicable Algebra in Engineering, Communication and Computing, 1997, 8 : 415 - 420
  • [48] Criteria for nonsystematicness of perfect binary codes
    Malyugin, SA
    DOKLADY MATHEMATICS, 2000, 62 (03) : 325 - 327
  • [49] Enumeration and construction of all binary duadic codes
    Li, X
    Sun, W
    Yang, YX
    2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 113 - 113
  • [50] Enumeration of Extended Irreducible Binary Goppa Codes
    Chen, Bocong
    Zhang, Guanghui
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2022, 68 (08) : 5145 - 5153
12345