Codes from Affine Permutation Groups

被引：6
|
作者：
Kaikkonen M. [1 ]
机构：
[1] Halkosuontie 65 C 5
来源：
Designs, Codes and Cryptography | 1998年 / 15卷 / 2期
关键词：
Affine permutation group; Binary code; Minimum distance;
D O I：
10.1023/A:1008315701179
中图分类号：
学科分类号：
摘要：
It is shown that A(22, 10) ≥ 50, A(23, 10) ≥ 76, A(25, 10) ≥ 166, A(26, 10) ≥ 270, A(29, 10) ≥ 1460, and A(28, 12) ≥ 178, where A(n, d) denotes the maximum cardinality of a binary code of length n and minimum Hamming distance d. The constructed codes are invariant under permutations of some affine (or closely related) permutation group and have been found using computer search.
引用
收藏
页码：183 / 186
页数：3
相关论文
共 50 条
12345